3 search results - page 1 / 1 » Distributed Branching Bisimulation Minimization by Inductive... |
CORR
2009
Springer
13 years 2 months ago
2009
Springer
We present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement proce...
DDECS
2006
IEEE
13 years 11 months ago
2006
IEEE
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...
CAV
2010
Springer
13 years 9 months ago
2010
Springer
ions of ODE models (MAPLE, GNA). On the algorithmic side (Sec. 3.2), it supports two main streams in high-performance model checking: reachability analysis based on BDDs (symbolic)...