scientific article
From MaRDI portal
Publication:3395948
zbMath1169.68554MaRDI QIDQ3395948
Publication date: 15 September 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (7)
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ Decidability of Weak Bisimilarity for a Subset of BPA ⋮ Weak bisimilarity and regularity of context-free processes is EXPTIME-hard ⋮ On the computational complexity of bisimulation, redux ⋮ On the complexity of checking semantic equivalences between pushdown processes and finite-state processes ⋮ A general approach to comparing infinite-state systems with their finite-state specifications ⋮ Reachability is decidable for weakly extended process rewrite systems
This page was built for publication:
