Late Weak Bisimulation for Markov Automata

Weak bisimilarity is a distribution-based equivalence notion for Markov automata. It has gained some popularity as the coarsest reasonable behavioural equivalence on Markov automata. This paper studies a strictly coarser notion: Late weak bisimilarity enjoys valuable properties if restricting to important subclasses of schedulers: Trace distribution equivalence is implied for partial information schedulers, and compositionality is preserved by distributed schedulers. The intersection of the two scheduler classes thus spans a coarser and still reasonable compositional theory of Markov automata.

[1]  Christel Baier,et al.  Comparative branching-time semantics for Markov chains , 2005, Inf. Comput..

[2]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

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

[4]  Bernd Becker,et al.  Compositional Dependability Evaluation for STATEMATE , 2009, IEEE Transactions on Software Engineering.

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

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

[7]  Hongyang Qu,et al.  Assume-Guarantee Verification for Probabilistic Systems , 2010, TACAS.

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

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

[10]  Christel Baier,et al.  Weak Bisimulation for Fully Probabilistic Processes , 1997, FBT.

[11]  Insup Lee,et al.  Weak Bisimulation for Probabilistic Systems , 2000, CONCUR.

[12]  Radha Jagadeesan,et al.  Weak bisimulation is sound and complete for pCTL* , 2002, Inf. Comput..

[13]  Mariëlle Stoelinga,et al.  A Rigorous, Compositional, and Extensible Framework for Dynamic Fault Tree Analysis , 2010, IEEE Transactions on Dependable and Secure Computing.

[14]  Markus Siegle,et al.  Markov Automata: Deciding weak bisimulation by means of non-naïvely vanishing states , 2012, Inf. Comput..

[15]  Carroll Morgan,et al.  Testing Finitary Probabilistic Processes , 2009, CONCUR.

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

[17]  Lijun Zhang,et al.  Time-Bounded Reachability Probabilities in Continuous-Time Markov Decision Processes , 2010, 2010 Seventh International Conference on the Quantitative Evaluation of Systems.

[18]  Pedro R. D'Argenio,et al.  Quantitative Model Checking Revisited: Neither Decidable Nor Approximable , 2007, FORMATS.

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

[20]  Lu Feng,et al.  Learning-Based Compositional Verification for Synchronous Probabilistic Systems , 2011, ATVA.

[21]  Mario Tokoro,et al.  On Asynchronous Communication Semantics , 1991, Object-Based Concurrent Computing.

[22]  Sven Schewe,et al.  Finite optimal control for time-bounded reachability in CTMDPs and continuous-time Markov games , 2010, Acta Informatica.