4460 search results - page 277 / 892 » Resources in process algebra |
150
click to vote
ICALP
2003
Springer
15 years 12 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...
157
click to vote
ISSAC
2001
Springer
15 years 11 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...
144
click to vote
CONCUR
1997
Springer
15 years 10 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 ...
161
click to vote
CTCS
1997
Springer
15 years 10 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 ...
201
click to vote
LICS
1994
IEEE
15 years 10 months 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...