Quantitative Kleene coalgebras

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]  Scott A. Smolka,et al.  Equivalences, Congruences, and Complete Axiomatizations for Probabilistic Processes , 1990, CONCUR.

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

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

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

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

[6]  Bartek Klin,et al.  Structural Operational Semantics for Weighted Transition Systems , 2009, Semantics and Algebraic Specification.

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

[8]  Christel Baier,et al.  Probabilistic ω-automata , 2012, JACM.

[9]  Carlos Gershenson,et al.  Information and Computation , 2013, Handbook of Human Computation.

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

[11]  H. Peter Gumm,et al.  Coalgebras Of Bounded Type , 2002, Math. Struct. Comput. Sci..

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

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

[14]  Mario Bravetti,et al.  CONCUR 2009 - Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings , 2009, CONCUR.

[15]  Jan J. M. M. Rutten,et al.  Coalgebraic Foundations of Linear Systems , 2007, CALCO.

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

[17]  Grigore Rosu,et al.  CIRC: A Behavioral Verification Tool Based on Circular Coinduction , 2009, CALCO.

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

[19]  Rance Cleaveland,et al.  Proceedings of the Third International Conference on Concurrency Theory , 1992 .

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

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

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

[23]  Alexandra Silva,et al.  Deriving Syntax and Axioms for Quantitative Regular Behaviours , 2009, CONCUR.

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

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

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

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

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

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

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

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

[32]  H. Peter Gumm,et al.  Products of coalgebras , 2001 .

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

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

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

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

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

[38]  V.E.Adler,et al.  Q4 , 2003, nlin/0309030.

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

[40]  Jan Rutten,et al.  On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces , 1998, Mathematical Structures in Computer Science.

[41]  Davide Sangiorgi,et al.  On the bisimulation proof method , 1998, Mathematical Structures in Computer Science.

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

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

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

[45]  James Worrell,et al.  Approximating and computing behavioural distances in probabilistic transition systems , 2006, Theor. Comput. Sci..

[46]  Michele Boreale,et al.  Weighted Bisimulation in Linear Algebraic Form , 2009, CONCUR.

[47]  Alexandra Silva,et al.  Coalgebraic Logic and Synthesis of Mealy Machines , 2008, FoSSaCS.

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

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