A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297)

From MaRDI portal
Revision as of 18:03, 24 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Kleene theorem and model checking algorithms for existentially bounded communicating automata
scientific article

    Statements

    A Kleene theorem and model checking algorithms for existentially bounded communicating automata (English)
    0 references
    0 references
    0 references
    0 references
    12 July 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    communicating finite state machines
    0 references
    message sequence charts
    0 references
    Kleene theorem
    0 references
    model checking
    0 references
    0 references