Sciweavers

143 search results - page 2 / 29
» Bisimulation for Labelled Markov Processes
Sort
View
ENTCS
2007
123views more  ENTCS 2007»
13 years 5 months ago
Labelled Markov Processes as Generalised Stochastic Relations
Labelled Markov processes (LMPs) are labelled transition systems in which each transition has an associated probability. In this paper we present a universal LMP as the spectrum o...
Michael W. Mislove, Dusko Pavlovic, James Worrell
IJFCS
2008
130views more  IJFCS 2008»
13 years 5 months ago
Equivalence of Labeled Markov Chains
We consider the equivalence problem for labeled Markov chains (LMCs), where each state is labeled with an observation. Two LMCs are equivalent if every finite sequence of observat...
Laurent Doyen, Thomas A. Henzinger, Jean-Fran&cced...
TGC
2010
Springer
13 years 3 months ago
Uniform Labeled Transition Systems for Nondeterministic, Probabilistic, and Stochastic Processes
Rate transition systems (RTS) are a special kind of transition systems introduced for defining the stochastic behavior of processes and for associating continuous-time Markov chain...
Marco Bernardo, Rocco De Nicola, Michele Loreti
QEST
2005
IEEE
13 years 11 months ago
Comparative Analysis of Bisimulation Relations on Alternating and Non-Alternating Probabilistic Models
We consider bisimulation and weak bisimulation relations in the context of the Labeled Markov Chains of Hansson and Jonsson, the Concurrent Labeled Markov Chains of Philippou, Lee...
Roberto Segala, Andrea Turrini
FUIN
2002
107views more  FUIN 2002»
13 years 5 months ago
Comparing Refinements for Failure and Bisimulation Semantics
Refinement in bisimulation semantics is defined differently from refinement in failure semantics: in bisimulation semantics refinement is based on simulations between labelled tran...
Rik Eshuis, Maarten M. Fokkinga