Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326)
From MaRDI portal
scientific article; zbMATH DE number 1715327
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time |
scientific article; zbMATH DE number 1715327 |
Statements
Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (English)
0 references
3 March 2002
0 references
concurrency
0 references
onfinite-state systems
0 references
process algebras
0 references
verification
0 references
bisimulation
0 references
0 references
