12 search results - page 1 / 3 » Simulation Preorder on Simple Process Algebras |
ICALP
1999
Springer
13 years 11 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...
IANDC
2002
13 years 7 months ago
2002
ENTCS
2008
13 years 7 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...
CONCUR
2006
Springer
13 years 11 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...
FOSSACS
2004
Springer
14 years 24 days ago
2004
Springer
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left o...