scientific article; zbMATH DE number 2038739

zbMath1039.68084MaRDI QIDQ4449204

Richard Mayr

Publication date: 8 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27190570.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

bisimulation1-counter machines1-counter nets

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (7)

Countdown games, and simulation on (succinct) one-counter nets ⋮ DP lower bounds for equivalence-checking and model-checking of one-counter automata ⋮ A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ Weak bisimilarity and regularity of context-free processes is EXPTIME-hard ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes

This page was built for publication: