Sciweavers

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

89

Voted

CONCUR
1992
Springer

101views Distributed And Parallel Com...» more CONCUR 1992»

Bisimulation Equivalence is Decidable for all Context-Free Processes

15 years 6 months ago

Bisimulation Equivalence is Decidable for all Context-Free Processes

Download homepages.inf.ed.ac.uk

Søren Christensen, Hans Hüttel, Colin

Real-time Traffic

CONCUR 1992 | Distributed And Parallel Computing |

claim paper

Related Content

» Decidability of Bisimulation Equivalence for Processes Generating ContextFree Languages

» Actions Speak Louder than Words Proving Bisimilarity for ContextFree Processes

» PartiallyCommutative ContextFree Processes

» Decidability of Bisimulation Equivalence for Normed Pushdown Processes

» A ContextFree Process as a Pushdown Automaton

» Deadlocking States in ContextFree Process Algebra

» Bisimulation and Other Undecidable Equivalences for Lossy Channel Systems

» Deciding BisimulationLike Equivalences with FiniteState Processes

» Bisimulation Equivalence is Decidable for OneCounter Processes

Post Info
More Details (n/a)

Added	09 Aug 2010
Updated	09 Aug 2010
Type	Conference
Year	1992
Where	CONCUR
Authors	Søren Christensen, Hans Hüttel, Colin Stirling

Comments (0)