Sciweavers

276 search results - page 3 / 56
» Bisimulation for quantum processes
Sort
View
FSTTCS
1992
Springer
13 years 11 months ago
Branching Bisimulation for Context-free Processes
The branching bisimulation de ned by Van Glabbeek and Weijland takes care of preserving the branching structure of processes even though silent actions are taken. Branching bisimu...
Didier Caucal
IANDC
2006
103views more  IANDC 2006»
13 years 7 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...
JUCS
2006
89views more  JUCS 2006»
13 years 7 months ago
Process Equivalences as Global Bisimulations
: Bisimulation can be defined in a simple way using coinductive methods, and has rather pleasant properties. Ready similarity was proposed by Meyer et al. as a way to weakening the...
David de Frutos-Escrig, Carlos Gregorio-Rodr&iacut...
WIA
2007
Springer
14 years 1 months ago
Backward and Forward Bisimulation Minimisation of Tree Automata
We improve an existing bisimulation minimisation algorithm for tree automata by introducing backward and forward bisimulations and developing minimisation algorithms for them. Mini...
Johanna Högberg, Andreas Maletti, Jonathan Ma...
FUIN
2002
107views more  FUIN 2002»
13 years 7 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