Sciweavers

38 search results - page 1 / 8
» Non-interleaving bisimulation equivalences on Basic Parallel...
Sort
View
IANDC
2010
57views more  IANDC 2010»
13 years 3 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 4 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...
PARLE
1987
13 years 8 months ago
Decidability of Bisimulation Equivalence for Processes Generating Context-Free Languages
A context-freegrammar(CFG)in GreibachNormalForm coincides,in anothernotation,witha system of guarded recursion equations in Basic Process Algebra. Hence to each CFG a process can b...
Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
CONCUR
2005
Springer
13 years 10 months ago
Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
Abstract. We propose a polynomial-time decision procedure for hereditary history preserving bisimilarity (hhp-b) on Basic Parallel Processes (BPP). Furthermore, we give a sound and...
Sibylle B. Fröschle, Slawomir Lasota
ICALP
1997
Springer
13 years 9 months ago
Axiomatizations for the Perpetual Loop in Process Algebra
Abstract. Milner proposed an axiomatization for the Kleene star in basic process algebra, in the presence of deadlock and empty process, modulo bisimulation equivalence. In this pa...
Wan Fokkink