Sciweavers

132 search results - page 7 / 27
» Process Equivalences as Global Bisimulations
Sort
View
CONCUR
2009
Springer
14 years 2 months ago
Computing Stuttering Simulations
Stuttering bisimulation is a well-known behavioural equivalence that preserves CTL-X, namely CTL without the next-time operator X. Correspondingly, the stuttering simulation preord...
Francesco Ranzato, Francesco Tapparo
FSTTCS
2010
Springer
13 years 5 months ago
Fast equivalence-checking for normed context-free processes
Bisimulation equivalence is decidable in polynomial time over normed graphs generated by a context-free grammar. We present a new algorithm, working in time O(n5 ), thus improving...
Wojciech Czerwinski, Slawomir Lasota
ICFP
1996
ACM
14 years 18 hour ago
A Theory of Weak Bisimulation for Core CML
Concurrent ML (CML) is an extension of Standard ML of New Jersey with concurrent features similar to those of process algebra. In this paper, we build upon John Reppy's reduc...
William Ferreira, Matthew Hennessy, Alan Jeffrey
APLAS
2007
ACM
13 years 12 months ago
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
: An Extended Abstract Alwen Tiu Computer Sciences Laboratory Australian National University Abstract. A notion of open bisimulation is formulated for the spi calculus, an extensio...
Alwen Tiu
BPM
2006
Springer
113views Business» more  BPM 2006»
13 years 11 months ago
Process Equivalence: Comparing Two Process Models Based on Observed Behavior
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...
Wil M. P. van der Aalst, Ana Karla A. de Medeiros,...