Late Weak Bisimulation for Markov Automata

Details Late Weak Bisimulation for Markov Automata Late Weak Bisimulation for Markov Automata

2012-02-18

arxiv.org/abs/1202.4116v1

Computer Science

Formal Languages and Automata Theory

Scientific paper

Markov automata (MA) and weak bisimulation have been proposed by Eisentraut, Hermanns and Zhang. In this paper we propose early and late semantics of Markovian automata, and then introduce early and late weak bisimulations correspondingly. We show that early weak bisimulation coincides with the weak bisimulation proposed by Eisentraut, Hermanns and Zhang, and late weak bisimulation is strictly coarser. Further, we extend our results to simulations.

Affiliated with

Also associated with

No associations

Rating

Late Weak Bisimulation for Markov Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Late Weak Bisimulation for Markov Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Late Weak Bisimulation for Markov Automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-419113