Stochastic Transition Systems for Continuous State Spaces and Non-determinism

We study the interaction between non-deterministic and probabilistic behaviour in systems with continuous state spaces, arbitrary probability distributions and uncountable branching. Models of such systems have been proposed previously. Here, we introduce a model that extends probabilistic automata to the continuous setting. We identify the class of schedulers that ensures measurability properties on executions, and show that such measurability properties are preserved by parallel composition. Finally, we demonstrate how these results allow us to define an alternative notion of weak bisimulation in our model.

[1]  R. Ash,et al.  Real analysis and probability , 1975 .

[2]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[3]  B. Banaschewski,et al.  Categorical Aspects of Topology and Analysis , 1982 .

[4]  Jane Hillston,et al.  A compositional approach to performance modelling , 1996 .

[5]  Robin Milner,et al.  Communication and concurrency , 1989, PHI Series in computer science.

[6]  Bernhard Steffen,et al.  Reactive, generative, and stratified models of probabilistic processes , 1990, [1990] Proceedings. Fifth Annual IEEE Symposium on Logic in Computer Science.

[7]  Kim G. Larsen,et al.  Bisimulation through Probabilistic Testing , 1991, Inf. Comput..

[8]  Hans A. Hansson.  Time and probability in formal design of distributed systems , 1991, DoCS.

[9]  Nancy A. Lynch,et al.  Probabilistic Simulations for Probabilistic Processes , 1994, Nord. J. Comput..

[10]  Insup Lee,et al.  CONCUR '95: Concurrency Theory , 1995, Lecture Notes in Computer Science.

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

[12]  Roberto Segala,et al.  A Compositional Trace-Based Semantics for Probabilistic Automata , 1995, CONCUR.

[13]  Scott A. Smolka,et al.  Composition and Behaviors of Probabilistic I/O Automata , 1994, Theor. Comput. Sci..

[14]  Christel Baier,et al.  Weak Bisimulation for Fully Probabilistic Processes , 1997, FBT.

[15]  L. D. Alfaro.  The Verification of Probabilistic Systems Under Memoryless Partial-Information Policies is Hard , 1999 .

[16]  Pedro R. D'Argenio,et al.  Algebras and Automata for Timed and Stochastic Systems , 1999 .

[17]  Kousha Etessami,et al.  Optimizing Büchi Automata , 2000, CONCUR.

[18]  Marta Z. Kwiatkowska,et al.  Verifying Quantitative Properties of Continuous Probabilistic Timed Automata , 2000, CONCUR.

[19]  Insup Lee,et al.  Weak Bisimulation for Probabilistic Systems , 2000, CONCUR.

[20]  Marta Kwiatkowska,et al.  Verifying Quantitative Properties of Continuous Probabilistic Real-Time Graphs , 2000 .

[21]  Prakash Panangaden,et al.  Measure and probability for concurrency theorists , 2001, Theor. Comput. Sci..

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

[23]  Mario Bravetti.  An Integrated Approach for the Specification and Analysis of Stochastic Real-Time Systems , 2002, PAPM-PROBMIV.

[24]  Abbas Edalat,et al.  Bisimulation for Labelled Markov Processes , 2002, Inf. Comput..

[25]  Mariëlle Stoelinga,et al.  Alea jacta est : verification of probabilistic, real-time and parametric systems , 2002 .

[26]  Christel Baier,et al.  Validation of Stochastic Systems , 2004, Lecture Notes in Computer Science.

[27]  Mario Bravetti,et al.  Tutte le Algebre Insieme: Concepts, Discussions and Relations of Stochastic Process Algebras with General Distributions , 2004, Validation of Stochastic Systems.

[28]  Stefano Cattani,et al.  Trace-based process algebras for real-time probabilistic systems , 2005 .