A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 08:21, 5 March 2024

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