Skip to main content
×
Home
    • Aa
    • Aa

Bisimulations for non-deterministic labelled Markov processes

  • PEDRO R. D'ARGENIO (a1), PEDRO SÁNCHEZ TERRAF (a2) and NICOLÁS WOLOVICK (a3)
Abstract

We extend the theory of labelled Markov processes to include internal non-determinism, which is a fundamental concept for the further development of a process theory with abstraction on non-deterministic continuous probabilistic systems. We define non-deterministic labelled Markov processes (NLMP) and provide three definitions of bisimulations: a bisimulation following a traditional characterisation; a state-based bisimulation tailored to our ‘measurable’ non-determinism; and an event-based bisimulation. We show the relations between them, including the fact that the largest state bisimulation is also an event bisimulation. We also introduce a variation of the Hennessy–Milner logic that characterises event bisimulation and is sound with respect to the other bisimulations for an arbitrary NLMP. This logic, however, is infinitary as it contains a denumerable . We then introduce a finitary sublogic that characterises all bisimulations for an image finite NLMP whose underlying measure space is also analytic. Hence, in this setting, all the notions of bisimulation we consider turn out to be equal. Finally, we show that all these bisimulation notions are different in the general case. The counterexamples that separate them turn out to be non-probabilistic NLMPs.

Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

H. Bohnenkamp , P. R. D'Argenio , H. Hermanns and J.-P. Katoen (2006) MoDeST: A compositional modeling formalism for real-time and stochastic systems. IEEE Trans. Softw. Eng. 32 812830.

M. Bravetti and P. R. D'Argenio (2004) Tutte le algebre insieme: Concepts, discussions and relations of stochastic process algebras with general distributions. In: Validation of Stochastic Systems. Springer-Verlag Lecture Notes in Computer Science 2925 4488.

S. Cattani , R. Segala , M. Z. Kwiatkowska and G. Norman (2005) Stochastic transition systems for continuous state spaces and non-determinism. In: Proceedings FoSSaCS 2005. Springer-Verlag Lecture Notes in Computer Science 3441 125139.

V. Danos , J. Desharnais , F. Laviolette and P. Panangaden (2006) Bisimulation and cocongruence for probabilistic systems. Information and Computation 204 503523.

P. R. D'Argenio and J.-P. Katoen (2005) A theory of stochastic systems, Part I: Stochastic automata, and Part II: Process algebra. Information and Computation 203 1–38, 3974.

J. Desharnais and P. Panangaden (2003) Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes. J. Log. Algebr. Program. 56 (1-2) 99115.

J. Desharnais , A. Edalat and P. Panangaden Bisimulation for labelled Markov processes. Information and Computation 179 (2) 163193.

M. Giry (1981) A categorical approach to probability theory. In: Categorical Aspects of Topology and Analysis. Springer-Verlag Lecture Notes in Mathematics 915 6885.

R. J. van Glabeek (2001) The linear time–branching time spectrum I. The semantics of concrete, sequential processes. In: J. A. Bergstra , A. Ponse and S. A. Smolka (eds.) Handbook of Process Algebra, North-Holland399.

A. S. Kechris (1995) Classical Descriptive Set Theory, Graduate Texts in Mathematics 156Springer-Verlag.

K. G. Larsen and A. Skou (1991) Bisimulation through probabilistic testing. Information and Computation 94 (1) 128.

A. Parma and R. Segala (2007) Logical characterizations of bisimulations for discrete probabilistic systems. In: Proceedings FoSSaCS 07. Springer-Verlag Lecture Notes in Computer Science 4423 287301.

M. L. Puterman (1994) Markov Decision Processes: Discrete Stochastic Dynamic Programming, Wiley-Interscience.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Mathematical Structures in Computer Science
  • ISSN: 0960-1295
  • EISSN: 1469-8072
  • URL: /core/journals/mathematical-structures-in-computer-science
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 8 *
Loading metrics...

Abstract views

Total abstract views: 121 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 23rd September 2017. This data will be updated every 24 hours.