Deriving Syntax and Axioms for Quantitative Regular Behaviours

We present a systematic way to generate (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of quantitative systems. Our quantitative systems include weighted versions of automata and transition systems, in which transitions are assigned a value in a monoid that represents cost, duration, probability, etc. Such systems are represented as coalgebras and (1) and (2) above are derived in a modular fashion from the underlying (functor) type of these coalgebras. In previous work, we applied a similar approach to a class of systems (without weights) that generalizes both the results of Kleene (on rational languages and DFA's) and Milner (on regular behaviours and finite LTS's), and includes many other systems such as Mealy and Moore machines. In the present paper, we extend this framework to deal with quantitative systems. As a consequence, our results now include languages and axiomatizations, both existing and new ones, for many different kinds of probabilistic systems.

[1]  Vincent van Oostrom,et al.  Processes, Terms and Cycles: Steps on the Road to Infinity, Essays Dedicated to Jan Willem Klop, on the Occasion of His 60th Birthday , 2005, Processes, Terms and Cycles.

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

[3]  Joost-Pieter Katoen,et al.  On Generative Parallel Composition , 1998, PROBMIV.

[4]  Peter Buchholz,et al.  Quantifying the Dynamic Behavior of Process Algebras , 2001, PAPM-PROBMIV.

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

[6]  Amir Pnueli,et al.  Probabilistic Verification by Tableaux , 1986, Logic in Computer Science.

[7]  Arto Salomaa,et al.  Two Complete Axiom Systems for the Algebra of Regular Events , 1966, JACM.

[8]  Jan A. Bergstra,et al.  Axiomization Probabilistic Processes: ACP with Generative Probabililties (Extended Abstract) , 1992, CONCUR.

[9]  Bernhard Steffen,et al.  Reactive, Generative and Stratified Models of Probabilistic Processes , 1995, Inf. Comput..

[10]  Luca Aceto,et al.  Equational Axioms for Probabilistic Bisimilarity , 2002, AMAST.

[11]  Mads Tofte,et al.  A Complete Axiom System for Finite-State Probabilistic Processes , 2000 .

[12]  Dexter Kozen.  A Completeness Theorem for Kleene Algebras and the Algebra of Regular Events , 1994, Inf. Comput..

[13]  Bart Jacobs,et al.  A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages , 2006, Essays Dedicated to Joseph A. Goguen.

[14]  Erik P. de Vink,et al.  A hierarchy of probabilistic system types , 2003, CMCS.

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

[16]  Jan J. M. M. Rutten,et al.  Universal coalgebra: a theory of systems , 2000, Theor. Comput. Sci..

[17]  Scott A. Smolka,et al.  A complete axiom system for finite-state probabilistic processes , 2000, Proof, Language, and Interaction.

[18]  Martin Rößiger,et al.  Coalgebras and Modal Logic , 2000, CMCS.

[19]  Peter Buchholz,et al.  Bisimulation relations for weighted automata , 2008, Theor. Comput. Sci..

[20]  Scott A. Smolka,et al.  Algebraic Reasoning for Probabilistic Concurrent Systems , 1990, Programming Concepts and Methods.

[21]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[22]  Bernhard Steffen,et al.  Priority as extremal probability , 1990, Formal Aspects of Computing.

[23]  Bart Jacobs,et al.  Many-Sorted Coalgebraic Modal Logic: a Model-theoretic Study , 2001, RAIRO Theor. Informatics Appl..

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

[25]  Janusz A. Brzozowski,et al.  Derivatives of Regular Expressions , 1964, JACM.

[26]  Bengt Jonsson,et al.  CONCUR ’94: Concurrency Theory , 1994, Lecture Notes in Computer Science.

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

[28]  Jun Pang,et al.  Compositional Reasoning for Probabilistic Finite-State Behaviors , 2005, Processes, Terms and Cycles.

[29]  Yuxin Deng,et al.  Axiomatizations for Probabilistic Finite-State Behaviors , 2005, FoSSaCS.

[30]  Scott A. Smolka,et al.  Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes , 1990, CONCUR.

[31]  Roberto Segala,et al.  Axiomatizations for Probabilistic Bisimulation , 2001, ICALP.

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

[33]  S C Kleene,et al.  Representation of Events in Nerve Nets and Finite Automata , 1951 .

[34]  H. Peter Gumm,et al.  Monoid-labeled transition systems , 2001, CMCS.

[35]  Donald Sannella,et al.  Horizontal Composability Revisited , 2006, Essays Dedicated to Joseph A. Goguen.

[36]  J.C.M. Baeten,et al.  CONCUR '90 Theories of Concurrency: Unification and Extension , 1990, Lecture Notes in Computer Science.

[37]  Marcel Paul Schützenberger,et al.  On the Definition of a Family of Automata , 1961, Inf. Control..

[38]  Alexandra Silva,et al.  An Algebra for Kripke Polynomial Coalgebras , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

[39]  Robin Milner,et al.  A Complete Inference System for a Class of Regular Behaviours , 1984, J. Comput. Syst. Sci..

[40]  Azaria Paz,et al.  Probabilistic automata , 2003 .

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

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