Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

25

TCS
1998

favoriteEmaildiscussreport

106views Theoretical Computer Science» more TCS 1998»

Decidability of Bisimulation Equivalence for Normed Pushdown Processes

13 years 10 months ago

Decidability of Bisimulation Equivalence for Normed Pushdown Processes

Download www.lfcs.inf.ed.ac.uk

We prove that bisimulation equivalence is decidable for normed pushdown processes.

Colin Stirling

Real-time Traffic

Bisimulation Equivalence | TCS 1998 | Theoretical Computer Science |

claim paper

Related Content

» Refining the Undecidability Border of Weak Bisimilarity

» Deciding BisimulationLike Equivalences with FiniteState Processes

» Simulation Preorder on Simple Process Algebras

» Visibly Pushdown Automata From Language Equivalence to Simulation and Bisimulation

» Fast equivalencechecking for normed contextfree processes

» On the complexity of checking semantic equivalences between pushdown processes and finites...

» PartiallyCommutative ContextFree Processes

» A ContextFree Process as a Pushdown Automaton

» Decidability of Bisimulation Equivalence for Processes Generating ContextFree Languages

Post Info
More Details (n/a)

Added	23 Dec 2010
Updated	23 Dec 2010
Type	Journal
Year	1998
Where	TCS
Authors	Colin Stirling

Comments (0)