95 search results - page 1 / 19 » Simulation Preorder over Simple Process Algebras |
IANDC
2002
13 years 4 months ago
2002
ICALP
1999
Springer
13 years 9 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
CONCUR
2006
Springer
13 years 8 months ago
2006
Springer
This paper studies the (in)equational theory of simulation preorder and equivalence over the process algebra BCCSP. We prove that in the presence of a finite alphabet with at least...
ENTCS
2008
13 years 4 months ago
2008
There are two ways to define a semantics for process algebras: either directly by means of an equivalence relation or by means of a preorder whose kernel is the desired equivalenc...
LICS
2008
IEEE
13 years 11 months ago
2008
IEEE
We investigate the (in)equational theory of impossible futures semantics over the process algebra BCCSP. We prove that no finite, sound axiomatization for BCCSP modulo impossible...