Bisimulation Equivalence is Decidable for all Context-Free Processes (1995)

Cached

Download Links

by Søren Christensen , Hans Hüttel , Colin Stirling
Venue:Information and Computation
Citations:92 - 15 self

Active Bibliography

69 Verification on Infinite Structures – Olaf Burkart, Didier Caucal, Faron Moller, Bernhard Steffen - 2000
7 Decidability Issues for Infinite-State Processes -- a Survey – Søren Christensen, Hans Hüttel - 1996
45 Actions Speak Louder than Words: Proving Bisimilarity for Context-Free Processes – Hans Hüttel, Colin Stirling - 1991
11 Decidable Subsets of CCS – Søren Christensen, Yoram Hirshfeld, Faron Moller
Context-free Process Algebras Extended with Deadlocks – Jirí Srba, Jir Srba
48 A Polynomial Algorithm for Deciding Bisimilarity of Normed Context-Free Processes – Yoram Hirshfeld, Mark Jerrum, Faron Moller
25 Undecidable Equivalences for Basic Parallel Processes – Hans Hüttel - 1993
5 Comparing Expressibility of Normed BPA and Normed BPP Processes – Ivana Cerna, Mojmir Kretinsky, Fi Mu, Ivana Černá, Ivana Černá, Mojmír Křetínský, Antonin Kucera, Antonín Kučera - 1996
24 Decidability of Bisimulation Equivalence for Normed Pushdown Processes – Colin Stirling - 1996
16 An Elementary Bisimulation Decision Procedure for Arbitrary Context-Free Processes – Olaf Burkart, Didier Caucal, Bernhard Steffen - 1994
4 Regularity is decidable for normed BPA and normed BPP processes in polynomial time – Antonín Kučera - 1996
4 Bisimilarity of Processes with Finite-state Systems – Petr Jančar , Antonín Kučera - 1997
The Complexity of Bisimilarity-Checking for One-Counter Processes – Antonín Kučera
8 A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes – Yoram Hirshfeld, Mark Jerrum, Faron Moller - 1996
5 Deciding Regularity in Process Algebras – Antonín Kucera, Anton N Ku Cera - 1995
ftp ftp.brics.dk (cd pub/BRICS) Deciding Regularity in Process Algebras – Antonín Kučera
18 Regularity is Decidable for Normed PA Processes in Polynomial Time – Antonín Kučera - 1996
Decidability and complexity of equivalences for simple process algebras – Jitka Stribrna - 1998
9 Decidability of bisimulation equivalence for pushdown processes – Colin Stirling - 2000