The complexity of bisimilarity-checking for one-counter processes. (Q1401395)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of bisimilarity-checking for one-counter processes. |
scientific article; zbMATH DE number 1965394
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of bisimilarity-checking for one-counter processes. |
scientific article; zbMATH DE number 1965394 |
Statements
The complexity of bisimilarity-checking for one-counter processes. (English)
0 references
17 August 2003
0 references
One-counter automata
0 references
One-counter nets
0 references
Bisimilarity
0 references
0 references
0 references
