2171 search results - page 211 / 435 » A Generic Process Algebra |
112
click to vote
CSFW
2003
IEEE
15 years 9 months ago
2003
IEEE
We perform a systematic expansion of protocol narrations into terms of a process algebra in order to make precise some of the detailed checks that need to be made in a protocol. W...
104
click to vote
ICALP
2003
Springer
15 years 8 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...
118
Voted
ISSAC
2001
Springer
15 years 8 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...
112
Voted
CONCUR
1997
Springer
15 years 7 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 ...
121
Voted
CTCS
1997
Springer
15 years 7 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 ...