scientific article
From MaRDI portal
Publication:2766532
zbMath0987.68045MaRDI QIDQ2766532
Publication date: 28 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) 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 (4)
DP lower bounds for equivalence-checking and model-checking of one-counter automata ⋮ On history-deterministic one-counter nets ⋮ The complexity of bisimilarity-checking for one-counter processes. ⋮ Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time
This page was built for publication:
