Proving Approximate Implementations for Probabilistic I/O Automata (Q2864525): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A theory of timed automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task-structured probabilistic I/O automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Metrics for labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate simulation relations for hybrid systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Metrics for Discrete and Continuous Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Timed I/O Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisimulation through probabilistic testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Software Science and Computation Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2847403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trace-Based Semantics for Probabilistic Timed I/O Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid systems: computation and control. 8th international workshop, HSCC 2005, Zurich, Switzerland, March 9--11, 2005. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3999495 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid Systems: Computation and Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736610 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid systems: computation and control. 5th international workshop, HSCC 2002, Stanford, CA, USA, March 25--27, 2002. Proceedings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4417860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domain theory, testing and simulation for labelled Markov processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4791270 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535035 / rank
 
Normal rank

Revision as of 03:03, 7 July 2024

scientific article
Language Label Description Also known as
English
Proving Approximate Implementations for Probabilistic I/O Automata
scientific article

    Statements

    Proving Approximate Implementations for Probabilistic I/O Automata (English)
    0 references
    0 references
    0 references
    6 December 2013
    0 references
    approximate implementation
    0 references
    equivalence
    0 references
    approximate simulation
    0 references
    abstraction
    0 references
    probabilistic I/O automata
    0 references

    Identifiers