36 search results - page 4 / 8 » Bisimulation Equivalence is Decidable for all Context-Free P... |
QEST
2008
IEEE
14 years 2 months ago
2008
IEEE
We tackle the problem of non robustness of simulation and bisimulation when dealing with probabilistic processes. It is important to ignore tiny deviations in probabilities becaus...
LICS
1999
IEEE
14 years 5 days ago
1999
IEEE
Contextual equivalences for cryptographic process calculi, like the spi-calculus, can be used to reason about correctness of protocols, but their definition suffers from quantific...
CONCUR
2003
Springer
14 years 1 months ago
2003
Springer
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
PROCOMET
1998
13 years 9 months ago
1998
We develop a theory of bisimulations in the join-calculus. We introduce a refined operational model that makes interactions with the environment explicit, and discuss the impact o...
BPM
2006
Springer
13 years 11 months ago
2006
Springer
In various application domains there is a desire to compare process models, e.g., to relate an organization-specific process model to a reference model, to find a web service match...