Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems

We present a sound and complete axiomatization of finite complete trace semantics for generative probabilistic transition systems. Our approach is coalgebraic, which opens the door to axiomatize other types of systems. In order to prove soundness and completeness, we employ determinization and show that coalgebraic traces can be recovered via determinization, a result interesting in itself. The approach is also applicable to labelled transition systems, for which we can recover the known axiomatization of trace semantics (work of Rabinovich).

[1]  Moshe Y. Vardi,et al.  Trace Semantics is Fully Abstract , 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

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

[3]  Stefan Milius.  A Sound and Complete Calculus for Finite Stream Circuits , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[4]  J. Adámek,et al.  Locally Presentable and Accessible Categories: Bibliography , 1994 .

[5]  F. Bartels.  On generalised coinduction and probabilistic specification formats : Distributive laws in coalgebraic modelling , 2004 .

[6]  Ana Sokolova,et al.  Generic Trace Semantics via Coinduction , 2007, Log. Methods Comput. Sci..

[7]  Ernst-Erich Doberkat,et al.  Eilenberg-Moore algebras for stochastic relations , 2006, Inf. Comput..

[8]  Alexandra Silva,et al.  Generalizing the powerset construction, coalgebraically , 2010, FSTTCS.

[9]  Alexandra Silva,et al.  Sound and Complete Axiomatizations of Coalgebraic Language Equivalence , 2011, TOCL.

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

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

[12]  Alexander Moshe Rabinovich.  A Complete Axiomatisation for Trace Congruence of Finite State Behaviors , 1993, MFPS.

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

[14]  J. Adamek,et al.  Locally Presentable and Accessible Categories: Locally Presentable Categories , 1994 .

[15]  Alexandra Silva,et al.  Quantitative Kleene coalgebras , 2011, Inf. Comput..

[16]  Ernst-Erich Doberkat.  Erratum and Addendum: Eilenberg-Moore algebras for stochastic relations , 2008, Inf. Comput..

[17]  P. T. Johnstone,et al.  Adjoint Lifting Theorems for Categories of Algebras , 1975 .

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