Proving Approximate Implementations for Probabilistic I/O Automata
From MaRDI portal
Publication:2864525
DOI10.1016/j.entcs.2006.11.040zbMath1277.68111OpenAlexW1984319257MaRDI QIDQ2864525
Publication date: 6 December 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.11.040
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (5)
Stuttering for Abstract Probabilistic Automata ⋮ Stuttering for abstract probabilistic automata ⋮ Task-structured probabilistic I/O automata ⋮ Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms ⋮ Semantic Analysis of Gossip Protocols for Wireless Sensor Networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Metrics for labelled Markov processes
- Approximate simulation relations for hybrid systems
- Bisimulation through probabilistic testing
- A theory of timed automata
- Approximating labelled Markov processes
- Hybrid systems: computation and control. 5th international workshop, HSCC 2002, Stanford, CA, USA, March 25--27, 2002. Proceedings
- Task-structured probabilistic I/O automata
- Domain theory, testing and simulation for labelled Markov processes
- Hybrid systems: computation and control. 8th international workshop, HSCC 2005, Zurich, Switzerland, March 9--11, 2005. Proceedings
- The Theory of Timed I/O Automata
- Trace-Based Semantics for Probabilistic Timed I/O Automata
- Approximation Metrics for Discrete and Continuous Systems
- Foundations of Software Science and Computation Structures
- Hybrid Systems: Computation and Control
- Hybrid Systems: Computation and Control
This page was built for publication: Proving Approximate Implementations for Probabilistic I/O Automata
