Proving approximate implementations for probabilistic I/O automata

DOI10.1016/J.ENTCS.2006.11.040zbMATH Open1277.68111OpenAlexW1984319257MaRDI QIDQ2864525FDOQ2864525

Authors: Sayan Mitra, Nancy Lynch 

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

Recommendations

• Task-structured probabilistic I/O automata
• Composition and behaviors of probabilistic I/O automata
• CONCUR 2003 - Concurrency Theory
• Probabilistic I/O Automata: Theories of Two Equivalences
• Probabilistic verification and approximation

zbMATH Keywords

equivalenceabstractionapproximate implementationapproximate simulationprobabilistic I/O automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• A theory of timed automata
• Title not available (Why is that?)
• Approximating labelled Markov processes
• Title not available (Why is that?)
• Bisimulation through probabilistic testing
• Title not available (Why is that?)
• Approximation Metrics for Discrete and Continuous Systems
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control
• Metrics for labelled Markov processes
• Title not available (Why is that?)
• Foundations of Software Science and Computation Structures
• Title not available (Why is that?)
• Axioms for probability and nondeterminism
• Title not available (Why is that?)
• Domain theory, testing and simulation for labelled Markov processes
• Task-structured probabilistic I/O automata
• Title not available (Why is that?)
• Approximate simulation relations for hybrid systems
• Hybrid systems: computation and control. 8th international workshop, HSCC 2005, Zurich, Switzerland, March 9--11, 2005. Proceedings
• The Theory of Timed I/O Automata
• Hybrid systems: computation and control. 5th international workshop, HSCC 2002, Stanford, CA, USA, March 25--27, 2002. Proceedings
• Trace-Based Semantics for Probabilistic Timed I/O Automata

Cited In (6)

• Stuttering for abstract probabilistic automata
• Stuttering for abstract probabilistic automata
• CONCUR 2003 - Concurrency Theory
• Tutorial on parameterized model checking of fault-tolerant distributed algorithms
• Task-structured probabilistic I/O automata
• Semantic analysis of gossip protocols for wireless sensor networks

Uses Software

• MATISSE

This page was built for publication: Proving approximate implementations for probabilistic I/O automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864525)