Verifying of interface assertions for infinite state Mealy machines (Q2453549): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3932269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Specification and Development of Interactive Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of System Interaction: Components, Interfaces, and Services / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interaction and Realizability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing machines, transition systems, and interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Computational Paradigms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability Logic: A Formal Theory of Interaction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Church's Thesis Still Holds. Some Notes on Peter Wegner's Tracts on Interaction and Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data Types as Lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3969890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theory of Interactive Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3833630 / rank
 
Normal rank

Latest revision as of 15:09, 8 July 2024

scientific article
Language Label Description Also known as
English
Verifying of interface assertions for infinite state Mealy machines
scientific article

    Statements

    Verifying of interface assertions for infinite state Mealy machines (English)
    0 references
    0 references
    10 June 2014
    0 references
    interactive systems
    0 references
    I/O-machines
    0 references
    specification
    0 references
    verification
    0 references
    invariants
    0 references

    Identifiers