Sciweavers

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

60

Voted

ICALP
1997
Springer

favoriteEmaildiscussreport

84views Programming Languages» more ICALP 1997»

Bisimulation Equivalence is Decidable for One-Counter Processes

15 years 1 months ago

Bisimulation Equivalence is Decidable for One-Counter Processes

Download www.fi.muni.cz

Petr Jancar

Real-time Traffic

ICALP 1997 | Programming Languages |

claim paper

Related Content

» Decidability of Bisimulation Equivalence for Normed Pushdown Processes

» Deciding BisimulationLike Equivalences with FiniteState Processes

» Decidability of Bisimulation Equivalence for Processes Generating ContextFree Languages

» Bisimulation Equivalence is Decidable for all ContextFree Processes

» Refining the Undecidability Border of Weak Bisimilarity

» Actions Speak Louder than Words Proving Bisimilarity for ContextFree Processes

» Fast equivalencechecking for normed contextfree processes

» Visibly Pushdown Automata From Language Equivalence to Simulation and Bisimulation

» Divide and Congruence From Decomposition of Modalities to Preservation of Branching Bisimu...

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	ICALP
Authors	Petr Jancar

Comments (0)