1012 search results - page 123 / 203 » Process Algebra with Backtracking |
ISSAC
2001
Springer
15 years 2 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...
CONCUR
1997
Springer
15 years 2 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 ...
78
Voted
CTCS
1997
Springer
15 years 2 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 ...
103
click to vote
LICS
1994
IEEE
15 years 2 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...
CONCUR
1993
Springer
15 years 2 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...