946 search results - page 116 / 190 » Process Algebra and Non-Interference |
CTCS
1997
Springer
14 years 28 days ago
1997
Springer
Monads can be used to model term rewriting systems by generalising the well-known equivalence between universal algebra and monads on the category Set. In [L¨u96], this semantics ...
LICS
1994
IEEE
14 years 26 days ago
1994
IEEE
We develop a model for timed, reactive computation by extending the asynchronous, untimed concurrent constraint programming model in a simple and uniform way. In the spirit of pro...
CONCUR
1993
Springer
14 years 26 days ago
1993
Springer
The Communication Closed Layers law is shown to be modular complete for a model related to that of Mazurkiewicz. It is shown that in a modular style of program development the CCL...
CASC
2006
Springer
14 years 15 days ago
2006
Springer
In this paper, we deal with the problem of the computation of the homology of a finite simplicial complex after an "elementary simplicial perturbation" process such as th...
CMSB
2006
Springer
14 years 14 days ago
2006
Springer
Abstract. Starting from a biochemical signalling pathway model expressed in a process algebra enriched with quantitative information we automatically derive both continuous-space a...