Trace-Based Semantics for Probabilistic Timed I/O Automata

We describe the main features of the Probabilistic Timed I/O Automata (PTIOA)--a framework for modeling and analyzing discretely communicating probabilistic hybrid systems. A PTIOA can choose the post-state of a discrete transition either nondeterministically or according to (possibly continuous) probability distributions. The framework supports modeling of large systems as compositions of concurrently executing PTIOAs, which interact through shared transition labels. We develop a trace-based semantics for PTIOAs and show that PTIOAs are compositional with respect a new notion of external behavior.

[1]  Andrew Hinton,et al.  PRISM: A Tool for Automatic Verification of Probabilistic Systems , 2006, TACAS.

[2]  J. Lygeros,et al.  General stochastic hybrid systems: modelling and optimal control , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[3]  Matthew Hennessy,et al.  A Process Algebra for Timed Systems , 1995, Inf. Comput..

[4]  Ling Cheung,et al.  Reconciling nondeterministic and probabilistic choices , 2006 .

[5]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[6]  Joël Ouaknine,et al.  Axioms for Probability and Nondeterminism , 2004, EXPRESS.

[7]  Marta Z. Kwiatkowska,et al.  Stochastic Transition Systems for Continuous State Spaces and Non-determinism , 2005, FoSSaCS.

[8]  Nancy A. Lynch,et al.  The Theory of Timed I/o Automata , 2003 .

[9]  Joël Ouaknine,et al.  Domain theory, testing and simulation for labelled Markov processes , 2005, Theor. Comput. Sci..

[10]  Debasish Chatterjee,et al.  Stability analysis of deterministic and stochastic switched systems via a comparison principle and multiple Lyapunov functions , 2006, SIAM J. Control. Optim..

[11]  Ran Canetti,et al.  Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols , 2006, DISC.

[12]  Eugene W. Stark,et al.  On Behaviour Equivalence for Probabilistic I/O Automata and its Relationship to Probabilistic Bisimulation , 2003, J. Autom. Lang. Comb..

[13]  Zohar Manna,et al.  Formal verification of probabilistic systems , 1997 .

[14]  Ian Stark,et al.  Free-Algebra Models for the pi-Calculus , 2005, FoSSaCS.

[15]  João Pedro Hespanha,et al.  Stochastic Hybrid Systems: Application to Communication Networks , 2004, HSCC.

[16]  Cnrs Fre,et al.  Model Checking a Path (Preliminary Report) , 2003 .

[17]  Dudley,et al.  Real Analysis and Probability: Measurability: Borel Isomorphism and Analytic Sets , 2002 .

[18]  Michael Ben-Or,et al.  Another advantage of free choice (Extended Abstract): Completely asynchronous agreement protocols , 1983, PODC '83.

[19]  Roberto Segala,et al.  Modeling and verification of randomized distributed real-time systems , 1996 .

[20]  Marta Z. Kwiatkowska,et al.  Symbolic model checking for probabilistic timed automata , 2007, Inf. Comput..

[21]  Holger Hermanns,et al.  Interactive Markov Chains , 2002, Lecture Notes in Computer Science.

[22]  Mark H. Davis.  Markov Models and Optimization , 1995 .

[23]  Vincent Danos,et al.  Bisimulation and cocongruence for probabilistic systems , 2006, Inf. Comput..

[24]  Nancy A. Lynch,et al.  Approximate Simulations for Task-Structured Probabilistic I/O Automata , 2006 .

[25]  Rance Cleaveland,et al.  A Process-Algebraic Language for Probabilistic I/O Automata , 2003, CONCUR.

[26]  Nancy A. Lynch,et al.  The Theory of Timed I/O Automata (Synthesis Lectures in Computer Science) , 2006 .