Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states

This paper develops a decision algorithm for weak bisimulation on Markov Automata (MA). For this purpose, different notions of vanishing states (a concept originating from the area of Generalised Stochastic Petri Nets) are defined. In particular, non-naively vanishing states are shown to be essential for relating the concepts of (state-based) naive weak bisimulation and (distribution-based) weak bisimulation. The bisimulation algorithm presented here follows the partition-refinement scheme and has exponential time complexity.

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

[2]  Nancy A. Lynch,et al.  Observing Branching Structure through Probabilistic Contexts , 2007, SIAM J. Comput..

[3]  Lijun Zhang,et al.  On Probabilistic Automata in Continuous Time , 2010, 2010 25th Annual IEEE Symposium on Logic in Computer Science.

[4]  Johann Schuster Towards faster numerical solution of Continuous Time Markov Chains stored by symbolic data structures , 2012 .

[5]  Marco Ajmone Marsan,et al.  Modelling with Generalized Stochastic Petri Nets , 1995, PERV.

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

[7]  Lijun Zhang,et al.  The Quest for Minimal Quotients for Probabilistic Automata , 2013, TACAS.

[8]  Gianfranco Ciardo,et al.  Well-defined stochastic Petri nets , 1996, Proceedings of MASCOTS '96 - 4th International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[9]  Ivan Damgård,et al.  Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II , 2008 .

[10]  Lijun Zhang,et al.  Concurrency and Composition in a Stochastic World , 2010, CONCUR.

[11]  Lijun Zhang,et al.  Deciding Bisimilarities on Distributions , 2013, QEST.

[12]  Holger Hermanns,et al.  Model Checking Algorithms for Markov Automata , 2012, Electron. Commun. Eur. Assoc. Softw. Sci. Technol..

[13]  Holger Hermanns,et al.  Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time , 2012, FSTTCS.

[14]  Matthew Hennessy,et al.  On the semantics of Markov automata , 2013, Inf. Comput..

[15]  Marco Ajmone Marsan,et al.  GSPN Models of Markovian Multiserver Multiqueue Systems , 1990, Perform. Evaluation.

[16]  Markus Siegle,et al.  Proceedings of the 10th international conference on Quantitative Evaluation of Systems , 2013 .

[17]  Roberto Segala,et al.  Decision Algorithms for Probabilistic Bisimulation , 2002, CONCUR.