Computer Science – Logic in Computer Science
Scientific paper
2010-11-15
Computer Science
Logic in Computer Science
Scientific paper
We extend the theory of labeled Markov processes with internal nondeterminism, a fundamental concept for the further development of a process theory with abstraction on nondeterministic continuous probabilistic systems. We define nondeterministic labeled Markov processes (NLMP) and provide three definition of bisimulations: a bisimulation following a traditional characterization, a state based bisimulation tailored to our "measurable" non-determinism, and an event based bisimulation. We show the relation between them, including that the largest state bisimulation is also an event bisimulation. We also introduce a variation of the Hennessy-Milner logic that characterizes event bisimulation and that is sound w.r.t. the other bisimulations for arbitrary NLMP. This logic, however, is infinitary as it contains a denumerable $\lor$. We then introduce a finitary sublogic that characterize all bisimulations for image finite NLMP whose underlying measure space is also analytic. Hence, in this setting, all notions of bisimulation we deal with turn out to be equal. Finally, we show that all notions of bisimulations are different in the general case. The counterexamples that separate them turn to be non-probabilistic NLMP.
D'Argenio Pedro
Terraf Pedro Sánchez
Wolovick Nicolás
No associations
LandOfFree
Bisimulations for Nondeterministic Labeled Markov Processes 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 Bisimulations for Nondeterministic Labeled Markov Processes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bisimulations for Nondeterministic Labeled Markov Processes will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-298690