scientific article; zbMATH DE number 1927587
From MaRDI portal
Publication:4484512
zbMath1012.68138MaRDI QIDQ4484512
Publication date: 12 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2421/24210579.htm
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) Decidability of theories and sets of sentences (03B25)
Related Items (5)
A generic framework for checking semantic equivalences between pushdown automata and finite-state automata ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ 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
This page was built for publication:
