Sciweavers

132 search results - page 4 / 27
» Process Equivalences as Global Bisimulations
Sort
View
IANDC
2010
57views more  IANDC 2010»
13 years 6 months ago
Non-interleaving bisimulation equivalences on Basic Parallel Processes
Sibylle B. Fröschle, Petr Jancar, Slawomir La...
ENTCS
2006
141views more  ENTCS 2006»
13 years 7 months ago
Refining the Undecidability Border of Weak Bisimilarity
Weak bisimilarity is one of the most studied behavioural equivalences. This equivalence is undecidable for pushdown processes (PDA), process algebras (PA), and multiset automata (...
Mojmír Kretínský, Vojtech Reh...
QEST
2007
IEEE
14 years 2 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin