Paper Info
Title
Sound and Complete Axiomatization of Trace Semantics for Probabilistic Systems
Abstract
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).
Year
DOI
Venue
2011
10.1016/j.entcs.2011.09.027
Electr. Notes Theor. Comput. Sci.
Keywords
Field
DocType
trace semantics,generative probabilistic transition system,probabilistic systems,complete axiomatization,finite complete trace semantics,labelled transition system,coalgebraic trace,known axiomatization
Discrete mathematics,Computer science,Coalgebra,Theoretical computer science,Generative grammar,Soundness,Probabilistic logic,Completeness (statistics),Semantics
Journal
Volume
ISSN
Citations 
276,
1571-0661
4
PageRank 
References 
Authors
0.43
12
2
Name
Order
Citations
PageRank
Alexandra Silva140.43
Ana Sokolova225418.88