7109 search results - page 280 / 1422 » Process Algebra with Combinators |
118
Voted
ICALP
2003
Springer
15 years 9 months ago
2003
Springer
We provide an answer to an open question, posed by van Glabbeek [4], regarding the axiomatizability of ready trace semantics. We prove that if the alphabet of actions is finite, t...
131
Voted
ISSAC
2001
Springer
15 years 9 months ago
2001
Springer
The degree of a rational map measures how often the map covers the image variety. In particular, when the rational map is a parametrization, the degree measures how often the para...
119
click to vote
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
We prove that a bounded stack can be specified in process algebra with just the operators alternative and sequential composition and iteration. The bounded bag cannot be specified ...
132
click to vote
CTCS
1997
Springer
15 years 8 months 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 ...
117
Voted
CONCUR
1993
Springer
15 years 8 months 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...