The complexity of bisimilarity-checking for one-counter processes. (Q1401395)

From MaRDI portal
Revision as of 16:19, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The complexity of bisimilarity-checking for one-counter processes.
scientific article

    Statements

    The complexity of bisimilarity-checking for one-counter processes. (English)
    0 references
    0 references
    17 August 2003
    0 references
    One-counter automata
    0 references
    One-counter nets
    0 references
    Bisimilarity
    0 references

    Identifiers