Bisimulation through probabilistic testing
Information and Computation
Theoretical Computer Science
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
A probabilistic poly-time framework for protocol analysis
CCS '98 Proceedings of the 5th ACM conference on Computer and communications security
The Metric Analogue of Weak Bisimulation for Probabilistic Processes
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Probabilistic Metric Semantics for a Simple Language with Recursion
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Composing Abstractions of Hybrid Systems
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Series of Abstractions for Hybrid Automata
HSCC '02 Proceedings of the 5th International Workshop on Hybrid Systems: Computation and Control
Polynomial Time Algorithms for Testing Probabilistic Bisimulation and Simulation
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Approximating labelled Markov processes
Information and Computation
Towards mobility as a network control primitive
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
Approximate Reasoning for Real-Time Probabilistic Processes
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Metrics for labelled Markov processes
Theoretical Computer Science - Logic, semantics and theory of programming
Domain theory, testing and simulation for labelled Markov processes
Theoretical Computer Science - Foundations of software science and computation structures
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science)
Bisimulation for communicating piecewise deterministic markov processes (CPDPs)
HSCC'05 Proceedings of the 8th international conference on Hybrid Systems: computation and control
Semantic analysis of gossip protocols for wireless sensor networks
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
| Hi-index | 0.00 |
In this paper we introduce the notion of approximate implementations for Probabilistic I/O Automata (PIOA) and develop methods for proving such relationships. We employ a task structure on the locally controlled actions and a task scheduler to resolve nondeterminism. The interaction between a scheduler and an automaton gives rise to a trace distribution-a probability distribution over the set of traces. We define a PIOA to be a (discounted) approximate implementation of another PIOA if the set of trace distributions produced by the first is close to that of the latter, where closeness is measured by the (resp. discounted) uniform metric over trace distributions. We propose simulation functions for proving approximate implementations corresponding to each of the above types of approximate implementation relations. Since our notion of similarity of traces is based on a metric on trace distributions, we do not require the state spaces nor the space of external actions of the automata to be metric spaces. We discuss applications of approximate implementations to verification of probabilistic safety and termination.