Well-abstracted transition systems: Application to FIFO automata. (Q1401924): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of logical theories / 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: Q2754102 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Communicating Finite-State Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derivatives of Regular Expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic model checking: \(10^{20}\) states and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753678 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4270062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4936148 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduction and covering of infinite reachability trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4730790 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-structured transition systems everywhere! / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proving safety properties of infinite state systems by compilation into Presburger arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576254 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3780411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4501519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equivalence, containment, and covering problems for the regular and context-free languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for unboundedness of fifo channels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel program schemata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2704225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714446 / rank
 
Normal rank

Latest revision as of 09:56, 6 June 2024

scientific article
Language Label Description Also known as
English
Well-abstracted transition systems: Application to FIFO automata.
scientific article

    Statements

    Well-abstracted transition systems: Application to FIFO automata. (English)
    0 references
    0 references
    0 references
    0 references
    19 August 2003
    0 references
    0 references
    Infinite state systems
    0 references
    Abstraction
    0 references
    Symbolic representation
    0 references
    Acceleration
    0 references
    Protocols
    0 references
    FIFO automata
    0 references
    Regular expressions
    0 references
    Flatness
    0 references