Fast equivalence-checking for normed context-free processes

DOI10.4230/LIPICS.FSTTCS.2010.260zbMATH Open1245.68134MaRDI QIDQ2908855FDOQ2908855

Wojciech Czerwiński, Sławomir Lasota

Publication date: 29 August 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_755d.html

zbMATH Keywords

normcontext-free grammarbisimulationsimple grammar

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (6)

• Equivalence of pushdown automata via first-order grammars
• Deciding the Bisimilarity of Context-Free Session Types
• Language equivalence of probabilistic pushdown automata
• Bisimulation equivalence and regularity for real-time one-counter automata
• The complexity of compressed membership problems for finite automata
• Decidability of bisimulation equivalence for process generating context-free languages

This page was built for publication: Fast equivalence-checking for normed context-free processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2908855)