Constraint Markov Chains

Notions of specification, implementation, satisfaction, and refinement, together with operators supporting stepwise design, constitute a specification theory. We construct such a theory for Markov Chains (MCs) employing a new abstraction of a Constraint MC. Constraint MCs permit rich constraints on probability distributions and thus generalize prior abstractions such as Interval MCs. Linear (polynomial) constraints suffice for closure under conjunction (respectively parallel composition). This is the first specification theory for MCs with such closure properties. We discuss its relation to simpler operators for known languages such as probabilistic process algebra. Despite the generality, all operators and relations are computable.

[1]  Frank Ciesinski,et al.  On Probabilistic Computation Tree Logic , 2004, Validation of Stochastic Systems.

[2]  Kim Guldstrand Larsen,et al.  Specification and refinement of probabilistic processes , 1991, [1991] Proceedings Sixth Annual IEEE Symposium on Logic in Computer Science.

[3]  Anna Philippou,et al.  Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.

[4]  Axel Legay,et al.  Ticc: A Tool for Interface Compatibility and Composition , 2006, CAV.

[5]  Joost-Pieter Katoen,et al.  Three-Valued Abstraction for Continuous-Time Markov Chains , 2007, CAV.

[6]  Thomas A. Henzinger,et al.  Compositional Methods for Probabilistic Systems , 2001, CONCUR.

[7]  J. Cheney,et al.  A sequent calculus for nominal logic , 2004, LICS 2004.

[8]  Thomas A. Henzinger,et al.  Synchronous and Bidirectional Component Interfaces , 2002, CAV.

[9]  Kim G. Larsen,et al.  On Modal Refinement and Consistency , 2007, CONCUR.

[10]  Kim G. Larsen,et al.  Timed I/O automata: a complete specification theory for real-time systems , 2010, HSCC '10.

[11]  Nathalie Bertrand,et al.  A Compositional Approach on Modal Specifications for Timed Systems , 2009, ICFEM.

[12]  Axel Legay,et al.  Probabilistic Contracts: A Compositional Reasoning Methodology for the Design of Stochastic Systems , 2010, 2010 10th International Conference on Application of Concurrency to System Design.

[13]  Thomas A. Henzinger,et al.  Interface theories with component reuse , 2008, EMSOFT '08.

[14]  Jean-Baptiste Raclet.  Quotient de spécifications pour la réutilisation de composants , 2007 .

[15]  Thomas A. Henzinger,et al.  INTERFACE-BASED DESIGN , 2005 .

[16]  Kim G. Larsen,et al.  Modal I/O Automata for Interface and Product Line Theories , 2007, ESOP.

[17]  Martin Leucker,et al.  Don't Know in Probabilistic Systems , 2006, SPIN.

[18]  Darald J. Hartfiel,et al.  Markov Set-Chains , 1998 .

[19]  Thomas A. Henzinger,et al.  Hybrid Systems: Computation and Control , 1998, Lecture Notes in Computer Science.

[20]  Thomas A. Henzinger,et al.  The Embedded Systems Design Challenge , 2006, FM.

[21]  Kim G. Larsen,et al.  Decision Problems for Interval Markov Chains , 2011, LATA.

[22]  Krishnendu Chatterjee,et al.  Model-Checking omega-Regular Properties of Interval Markov Chains , 2008, FoSSaCS.

[23]  Kim G. Larsen,et al.  Compositional Verification of Probabilistic Processes , 1992, CONCUR.

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

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

[26]  C. A. Petri,et al.  Concurrency Theory , 1986, Advances in Petri Nets.

[27]  Lijun Zhang,et al.  Probabilistic CEGAR , 2008, CAV.

[28]  Suzana Andova,et al.  Process Algebra with Probabilistic Choice , 1999, ARTS.

[29]  Serge Haddad,et al.  Using Stochastic Comparison for Efficient Model Checking of Uncertain Markov Chains , 2009, 2009 Sixth International Conference on the Quantitative Evaluation of Systems.

[30]  Jean-Baptiste Raclet,et al.  Residual for Component Specifications , 2008, Electron. Notes Theor. Comput. Sci..

[31]  Manuel Núñez,et al.  An Overview of Probabilistic Process Algebras and their Equivalences , 2004, Validation of Stochastic Systems.

[32]  James H. Davenport,et al.  The complexity of quantifier elimination and cylindrical algebraic decomposition , 2007, ISSAC '07.

[33]  Saugata Basu,et al.  New results on quantifier elimination over real closed fields and applications to constraint databases , 1999, JACM.

[34]  Thomas A. Henzinger,et al.  Interface automata , 2001, ESEC/FSE-9.

[35]  Mahesh Viswanathan,et al.  Model-Checking Markov Chains in the Presence of Uncertainties , 2006, TACAS.

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

[37]  J. Bergstra,et al.  Handbook of Process Algebra , 2001 .

[38]  Roberto Passerone,et al.  Why Are Modalities Good for Interface Theories? , 2009, 2009 Ninth International Conference on Application of Concurrency to System Design.

[39]  Bengt Jonsson,et al.  A calculus for communicating systems with time and probabilities , 1990, [1990] Proceedings 11th Real-Time Systems Symposium.

[40]  S. Shankar Sastry,et al.  Markov Set-Chains as Abstractions of Stochastic Hybrid Systems , 2008, HSCC.

[41]  Christopher W. Brown.  Simple CAD Construction and its Applications , 2001, J. Symb. Comput..

[42]  Jan Kretínský,et al.  The Satisfiability Problem for Probabilistic CTL , 2008, 2008 23rd Annual IEEE Symposium on Logic in Computer Science.

[43]  Kim G. Larsen,et al.  Methodologies for Specification of Real-Time Systems Using Timed I/O Automata , 2009, FMCO.

[44]  J. van Leeuwen,et al.  Theoretical Computer Science , 2003, Lecture Notes in Computer Science.

[45]  Joost-Pieter Katoen,et al.  Process algebra for performance evaluation , 2002, Theor. Comput. Sci..

[46]  Hirokazu Anai,et al.  SyNRAC: a maple toolbox for solving real algebraic constraints , 2007, ACCA.

[47]  Nathalie Bertrand,et al.  Refinement and Consistency of Timed Modal Specifications , 2009, LATA.

[48]  Joost-Pieter Katoen,et al.  Compositional Abstraction for Stochastic Systems , 2009, FORMATS.

[49]  E. Altman.  Constrained Markov Decision Processes , 1999 .

[50]  Kim G. Larsen,et al.  On determinism in modal transition systems , 2009, Theor. Comput. Sci..

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

[52]  Wang Yi,et al.  Probabilistic Extensions of Process Algebras , 2001, Handbook of Process Algebra.

[53]  Purandar Bhaduri,et al.  Synthesis of Interface Automata , 2005, ATVA.

[54]  Axel Legay,et al.  Modal interfaces: unifying interface automata and modal specifications , 2009, EMSOFT '09.

[55]  Kim G. Larsen,et al.  Modal Specifications , 1989, Automatic Verification Methods for Finite State Systems.