Sciweavers

19 search results - page 2 / 4
» Branching Bisimulation for Context-free Processes
Sort
View
FSTTCS
1992
Springer
13 years 12 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
DDECS
2006
IEEE
88views Hardware» more  DDECS 2006»
14 years 1 months ago
Minimization of Large State Spaces using Symbolic Branching Bisimulation
Abstract: Bisimulations in general are a powerful concept to minimize large finite state systems regarding some well-defined observational behavior. In contrast to strong bisimul...
Ralf Wimmer, Marc Herbstritt, Bernd Becker
QEST
2007
IEEE
14 years 2 months ago
Symbolic Bisimulations for Probabilistic Systems
The paper introduces symbolic bisimulations for a simple probabilistic π-calculus to overcome the infinite branching problem that still exists in checking ground bisimulations b...
Peng Wu 0002, Catuscia Palamidessi, Huimin Lin
CONCUR
2007
Springer
13 years 11 months ago
Equivalence Checking for Infinite Systems Using Parameterized Boolean Equation Systems
Abstract. In this paper, we provide a transformation from the branching bisimulation problem for infinite, concurrent, data-intensive systems in linear process format, into solving...
Taolue Chen, Bas Ploeger, Jaco van de Pol, Tim A. ...
FMCO
2005
Springer
14 years 1 months ago
Divide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
We present a method for decomposing modal formulas for processes with the internal action τ. To decide whether a process algebra term satisfies a modal formula, one can check whe...
Wan Fokkink, Rob J. van Glabbeek, Paulien de Wind