|
Blom, S.C.C. and van de Pol, J.C.
(2009)
Distributed Branching Bisimulation Minimization by Inductive Signatures.
Technical Report TR-CTIT-09-37,
Centre for Telematics and Information Technology University of Twente, Enschede.
ISSN 1381-3625
Full text available as:  AbstractWe present a new distributed algorithm for state space minimization modulo branching bisimulation. Like its predecessor it uses signatures for refinement, but the refinement process and the signatures have been optimized to exploit the fact that the input graph contains no  -loops.
The optimization in the refinement process is meant to reduce both the number of iterations needed
and the memory requirements. In the former case we cannot prove that there is an improvement, but
our experiments show that in many cases the number of iterations is smaller.
In the latter case, we can prove that the worst case memory use of the new algorithm is linear in the size of the state space, whereas the old algorithm has a quadratic upper bound.
The paper includes a proof of correctness of the new algorithm and the results of a number of experiments that compare the performance of the old and the new algorithms.
| Item Type: | Internal Report (Technical Report) |
|---|
| Research Group: | EWI-FMT: Formal Methods and Tools |
|---|
| Research Program: | CTIT-DSN: Dependable Systems and Networks |
|---|
| Research Project: | EC-MOAN: Scalable Modelling and Analysis Techniques to study Emergent Cell Behaviour – understanding the E. coli stress response |
|---|
| ID Code: | 11506 |
|---|
| Deposited On: | 13 October 2009 |
|---|
| More Information: | statisticsmetis |
|---|
Export this item as: To correct this item please ask your editor Repository Staff Only: edit this item
|
Nederlands
Contact
Sitemap
Search
Organisation
