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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Verifying programs with unreliable channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3859267 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2004 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical definability on infinite traces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737197 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of regular MSC languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular sets of infinite message sequence charts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded MSC communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090322 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4474224 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verifying lossy channel systems has nonprimitive recursive complexity. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on finite asynchronous automata / rank
 
Normal rank

Latest revision as of 18:03, 24 June 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
    0 references