Validation of Stochastic Systems

We survey various notions of probabilistic automata and probabilistic bisimulation, accumulating in an expressiveness hierarchy of probabilistic system types. The aim of this paper is twofold: On the one hand it provides an overview of existing types of probabilistic systems and, on the other hand, it explains the relationship between these models. We overview probabilistic systems with discrete probabilities only. The expressiveness order used to built the hierarchy is defined via the existence of mappings between the corresponding system types that preserve and reflect bisimilarity. Additionally, we discuss parallel composition for the presented types of systems, augmenting the map of probabilistic automata with closedness under this compositional operator.

[1]  Marta Z. Kwiatkowska,et al.  Probabilistic Model Checking of the IEEE 802.11 Wireless Local Area Network Protocol , 2002, PAPM-PROBMIV.

[2]  Peter Kemper,et al.  Model Checking Based on Kronecker Algebra , 1998 .

[3]  Frits W. Vaandrager,et al.  Root Contention in IEEE 1394 , 1999, ARTS.

[4]  Scott A. Smolka,et al.  Compositional analysis of expected delays in networks of probabilistic I/O automata , 1998, Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226).

[5]  Joseph F. Traub,et al.  Algorithms and Complexity: New Directions and Recent Results , 1976 .

[6]  Marta Z. Kwiatkowska,et al.  PRISM: Probabilistic Symbolic Model Checker , 2002, Computer Performance Evaluation / TOOLS.

[7]  Arnaldo V. Moura,et al.  A note on the verification of automata specifications of probabilistic real-time systems , 2002, Inf. Process. Lett..

[8]  Amir Pnueli,et al.  Verification of multiprocess probabilistic protocols , 1984, PODC '84.

[9]  Stavros Tripakis,et al.  Verifying Progress in Timed Systems , 1999, ARTS.

[10]  Rajeev Alur,et al.  A Theory of Timed Automata , 1994, Theor. Comput. Sci..

[11]  Andrea Bianco,et al.  Model Checking of Probabalistic and Nondeterministic Systems , 1995, FSTTCS.

[12]  Wang Yi,et al.  Automatic verification of real-time communicating systems by constraint-solving , 1994, FORTE.

[13]  Peter A. Beerel,et al.  Symbolic techniques for performance analysis of timed systems based on average time separation of events , 1997, Proceedings Third International Symposium on Advanced Research in Asynchronous Circuits and Systems.

[14]  Danièle Beauquier.  On probabilistic timed automata , 2003, Theor. Comput. Sci..

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

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

[17]  Peter Kemper.  Parallel randomization for large structured Markov chains , 2002, Proceedings International Conference on Dependable Systems and Networks.

[18]  Stavros Tripakis,et al.  Efficient Verification of Timed Automata Using Dense and Discrete Time Semantics , 1999, CHARME.

[19]  Christel Baier,et al.  Model-Checking Algorithms for Continuous-Time Markov Chains , 2002, IEEE Trans. Software Eng..

[20]  Andrew S. Miner.  Efficient solution of GSPNs using canonical matrix diagrams , 2001, Proceedings 9th International Workshop on Petri Nets and Performance Models.

[21]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

[22]  Mihalis Yannakakis,et al.  The complexity of probabilistic verification , 1995, JACM.

[23]  S. Levine,et al.  Probabilistic risk assessment in the US , 1983 .

[24]  Rajeev Alur,et al.  Model-Checking in Dense Real-time , 1993, Inf. Comput..

[25]  Ward Whitt,et al.  Continuity of Generalized Semi-Markov Processes , 1980, Math. Oper. Res..

[26]  Joseph Sifakis,et al.  Specification and verification of concurrent systems in CESAR , 1982, Symposium on Programming.

[27]  Wang Yi,et al.  UPPAAL - Now, Next, and Future , 2000, MOVEP.

[28]  Marta Z. Kwiatkowska,et al.  Probabilistic Model Checking of Deadline Properties in the IEEE 1394 FireWire Root Contention Protocol , 2003, Formal Aspects of Computing.

[29]  Thomas A. Henzinger,et al.  Symbolic Model Checking for Real-Time Systems , 1994, Inf. Comput..

[30]  Wang Yi,et al.  Testing Probabilistic and Nondeterministic Processes , 1992, PSTV.

[31]  R. Segala,et al.  Automatic Verification of Real-Time Systems with Discrete Probability Distributions , 1999, ARTS.

[32]  Michael O. Rabin,et al.  N-Process Mutual Exclusion with Bounded Waiting by 4 Log_2 N-Valued Shared Variable , 1982, J. Comput. Syst. Sci..

[33]  Marta Z. Kwiatkowska,et al.  Symbolic Computation of Maximal Probabilistic Reachability , 2001, CONCUR.

[34]  Howard Bowman,et al.  Model checking stochastic automata , 2003, TOCL.

[35]  Moshe Y. Vardi.  Automatic verification of probabilistic concurrent finite state programs , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[36]  Bengt Jonsson,et al.  A logic for reasoning about time and reliability , 1990, Formal Aspects of Computing.

[37]  Roberto Segala,et al.  Formal verification of timed properties of randomized distributed algorithms , 1995, PODC '95.

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

[39]  Joost-Pieter Katoen,et al.  Beyond Memoryless Distributions: Model Checking Semi-Markov Chains , 2001, PAPM-PROBMIV.

[40]  Håkan L. S. Younes,et al.  Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling , 2002, CAV.

[41]  Joost-Pieter Katoen,et al.  An algebraic approach to the specification of stochastic systems , 1998, PROCOMET.

[42]  Brigitte Plateau.  On the stochastic structure of parallelism and synchronization models for distributed algorithms , 1985, SIGMETRICS 1985.

[43]  Roberto Segala,et al.  Verification of Randomized Distributed Algorithms , 2002, European Educational Forum: School on Formal Methods and Performance Analysis.

[44]  Conrado Daws,et al.  Automatic verification of the IEEE 1394 root contention protocol with KRONOS and PRISM , 2002, International Journal on Software Tools for Technology Transfer.

[45]  Victor Shoup,et al.  Practical Threshold Signatures , 2000, EUROCRYPT.

[46]  Cyrus Derman,et al.  Finite State Markovian Decision Processes , 1970 .

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

[48]  Sergio Yovine,et al.  KRONOS: a verification tool for real-time systems , 1997, International Journal on Software Tools for Technology Transfer.

[49]  Roberto Segala,et al.  Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study , 2000, Distributed Computing.

[50]  Stavros Tripakis,et al.  Probabilistic Model Checking: Formalisms and Algorithms for Discrete and Real-time Systems , 2000 .

[51]  Christel Baier,et al.  Model checking for a probabilistic branching time logic with fairness , 1998, Distributed Computing.

[52]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[53]  William J. Stewart,et al.  Introduction to the numerical solution of Markov Chains , 1994 .

[54]  Annabelle McIver,et al.  Refinement-oriented probability for CSP , 1996, Formal Aspects of Computing.

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

[56]  Markus Siegle.  Compositional Representation and Reduction of Stochastic Labelled Transition Systems based on Decision Node BDDs , 1999, MMB.

[57]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[58]  Edmund M. Clarke,et al.  Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic , 1981, Logic of Programs.

[59]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[60]  Amir Pnueli,et al.  Probabilistic Verification , 1993, Information and Computation.

[61]  Marta Z. Kwiatkowska,et al.  Performance analysis of probabilistic timed automata using digital clocks , 2003, Formal Methods Syst. Des..

[62]  Wang Yi,et al.  Compositional and Symbolic Model-Checking of Real-Time Systems , 1996 .

[63]  Annabelle McIver,et al.  Probabilistic predicate transformers , 1996, TOPL.

[64]  Stavros Tripakis,et al.  On-the-fly symbolic model checking for real-time systems , 1997, Proceedings Real-Time Systems Symposium.

[65]  W. Stewart,et al.  The numerical solution of stochastic automata networks , 1995 .

[66]  Alain Isaac Saias.  Randomness versus non-determinism in distributed computing , 1994 .

[67]  Amir Pnueli,et al.  On Discretization of Delays in Timed Automata and Digital Circuits , 1998, CONCUR.

[68]  Rob Pooley,et al.  The unified modelling language , 1999, IEE Proc. Softw..

[69]  Marta Z. Kwiatkowska,et al.  Out-of-Core Solution of Large Linear Systems of Equations Arising from Stochastic Modelling , 2002, PAPM-PROBMIV.

[70]  Kenneth L. McMillan,et al.  A methodology for hardware verification using compositional model checking , 2000, Sci. Comput. Program..

[71]  Vitaly Shmatikov,et al.  Probabilistic analysis of anonymity , 2002, Proceedings 15th IEEE Computer Security Foundations Workshop. CSFW-15.

[72]  Tugrul Dayar,et al.  Iterative methods based on splittings for stochastic automata networks , 1998, Eur. J. Oper. Res..

[73]  Rajeev Alur,et al.  Model-Checking for Probabilistic Real-Time Systems (Extended Abstract) , 1991, ICALP.

[74]  Pedro R. D'Argenio,et al.  A compositional Translation of Stochastic Automata into Timed Automata , 2000 .

[75]  Henrik Ejersbo Jensen.  Model Checking Probabilistic Real Time Systems , 1996 .

[76]  Holger Hermanns,et al.  A Markov Chain Model Checker , 2000, TACAS.

[77]  Rajeev Alur,et al.  Verifying Automata Specifications of Probabilistic Real-time Systems , 1991, REX Workshop.

[78]  P. Glynn.  A GSMP formalism for discrete event systems , 1989, Proc. IEEE.

[79]  Thomas A. Henzinger,et al.  What Good Are Digital Clocks? , 1992, ICALP.

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