A General Framework for Probabilistic Characterizing Formulae

  • Joshua Sack
  • Lijun Zhang
Conference paper

DOI: 10.1007/978-3-642-27940-9_26

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7148)
Cite this paper as:
Sack J., Zhang L. (2012) A General Framework for Probabilistic Characterizing Formulae. In: Kuncak V., Rybalchenko A. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2012. Lecture Notes in Computer Science, vol 7148. Springer, Berlin, Heidelberg


Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae of many non-probabilistic behavioral relations. Our paper studies their techniques in a probabilistic setting. We provide a general method for determining characteristic formulae of behavioral relations for probabilistic automata using fixed-point probability logics. We consider such behavioral relations as simulations and bisimulations, probabilistic bisimulations, probabilistic weak simulations, and probabilistic forward simulations. This paper shows how their constructions and proofs can follow from a single common technique.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Joshua Sack
    • 1
  • Lijun Zhang
    • 2
  1. 1.Department of Mathematics and StatisticsCalifornia State University Long BeachUSA
  2. 2.DTU InformaticsTechnical University of DenmarkDenmark

Personalised recommendations