scientific article; zbMATH DE number 2087430
From MaRDI portal
Publication:4738225
zbMath1077.68653MaRDI QIDQ4738225
Zdeněk Sawa, Petr Jančar, Antonín Kučera, Faron Moller
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2303/23030172.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (3)
DP lower bounds for equivalence-checking and model-checking of one-counter automata ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ LTL over integer periodicity constraints
This page was built for publication:
