Distributed branching bisimulation minimization by inductive signatures

Electronic Proceedings in Theoretical Computer Science, EPTCS

Volumn 14, Issue , 2009, Pages 32-46

  Blom, Stefan ^a   Van De Pol, Jaco ^a  

^a UNIVERSITY OF TWENTE   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS;

BRANCHING BISIMULATION; CASE MEMORY; INPUT GRAPHS; MEMORY REQUIREMENTS; NUMBER OF ITERATIONS; PROOF OF CORRECTNESS; REFINEMENT PROCESS; UPPER BOUND;

COMPUTER SCIENCE;

EID: 84964045492     PISSN: 20752180     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4204/EPTCS.14.3     Document Type: Conference Paper

References (21)

1. Bahareh Badban, Wan Fokkink, Jan Friso Groote, Jun Pang & Jaco van de Pol (2005): Verification of a sliding window protocol in mCRL and PVS. Formal Aspects of Computing 17(3), pp. 342-388. Available at http://dx.doi.org/10.1007/s00165-005-0070-0.
2. Rena Bakhshi, Wan Fokkink, Jun Pang & Jaco van de Pol (2008): Leader Election in Anonymous Rings: Franklin Goes Probabilistic. In: Giorgio Ausiello, Juhani Karhumäki, Giancarlo Mauri & C.-H. Luke Ong, editors: IFIP TCS, IFIP 273. Springer, pp. 57-72. Available at http://dx.doi.org/10.1007/ 978-0-387-09680-3-4.
3. J. Barnat, J. Chaloupka & J. Van De Pol (2009): Distributed Algorithms for SCC Decomposition. Journal of Logic and Computation Available at http://logcom.oxfordjournals.org/cgi/content/abstract/ exp003?ijkey=lCDPRRuADtjeFuo & keytype=ref.
4. Jiri Barnat, Lubos Brim, Ivana Cerná, Pavel Moravec, Petr Rockai & Pavel Simecek (2006): DiVinE - A Tool for Distributed Verification. In: Thomas Ball & Robert B. Jones, editors: CAV, Lecture Notes in Computer Science 4144. Springer, pp. 278-281. Available at http://dx.doi.org/10.1007/11817963-26.
5. Twan Basten (1996): Branching Bisimilarity is an Equivalence Indeed! Inf. Process. Lett. 58(3), pp. 141- 147. Available at http://dx.doi.org/10.1016/0020-0190(96)00034-8.
6. S. C. C. Blom & J. C. van de Pol (2009): Distributed Branching Bisimulation Minimization by Inductive Signatures. Technical Report TR-CTIT-09-37, Centre for Telematics and Information Technology, University of Twente, Enschede. Available at http://eprints.eemcs.utwente.nl/11506/.
7. Stefan Blom, Wan Fokkink, Jan Friso Groote, Izak van Langevelde, Bert Lisser & Jaco van de Pol (2001): mCRL: A Toolset for Analysing Algebraic Specifications. In: Gérard Berry, Hubert Comon & Alain Finkel, editors: CAV, Lecture Notes in Computer Science 2102. Springer, pp. 250-254. Available at http://link. springer.de/link/service/series/0558/bibs/2102/21020250.htm.
8. Stefan Blom & Simona Orzan (2003): Distributed Branching Bisimulation Reduction of State Spaces. Electr. Notes Theor. Comput. Sci. 89(1). Available at http://www.elsevier.com/gej-ng/31/29/23/141/47/ show/Products/notes/index.htt#009.
9. Stefan Blom & Simona Orzan (2005): A distributed algorithm for strong bisimulation reduction of state spaces. STTT 7(1), pp. 74-86. Available at http://www.springerlink.com/index/10.1007/ s10009-004-0159-4.
10. Stefan Blom & Simona Orzan (2005): Distributed state space minimization. STTT 7(3), pp. 280-291. Available at http://dx.doi.org/10.1007/s10009-004-0185-2.
11. Wm. Randolph Franklin (1982): On an Improved Algorithm for Decentralized Extrema Finding in Circular Configurations of Processors. Commun. ACM 25(5), pp. 336-337.
12. Hubert Garavel, Radu Mateescu, Frédéric Lang & Wendelin Serwe (2007): CADP 2006: A Toolbox for the Construction and Analysis of Distributed Processes. In: Werner Damm & Holger Hermanns, editors: CAV, Lecture Notes in Computer Science 4590. Springer, pp. 158-163. Available at http://dx.doi.org/10. 1007/978-3-540-73368-3-18.
13. R.J. van Glabbeek & W.P.Weijland (1996): Branching time and abstraction in bisimulation semantics. Journal of the ACM 43(3), pp. 555-600.
14. Jan F. Groote, Jun Pang & Arno G. Wouters (2001): A Balancing Act: Analyzing a Distributed Lift System. In: S. Gnesi & U. Ultes-Nitsche, editors: Proc. 6th Workshop on Formal Methods for Industrial Critical Systems. pp. 1-12.
15. Jan Friso Groote & Frits W. Vaandrager (1990): An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence. In: Mike Paterson, editor: ICALP, Lecture Notes in Computer Science 443. Springer, pp. 626-638.
16. William McLendon III, Bruce Hendrickson, Steven J. Plimpton & Lawrence Rauchwerger (2005): Finding strongly connected components in distributed graphs. Journal of Parallel and Distributed Computing 65(8), pp. 901 - 910. Available at http://www.sciencedirect.com/science/article/B6WKJ-4G82Y0M-2/ 2/033ea44cd96c1b754978827d4d23dbc4.
17. S.P. Luttik (1997): Description and formal specification of the link layer of P1394. Technical Report SENR9706, CWI, Amsterdam, The Netherlands.
18. Simona Orzan (2004): On distributed verification and verified distribution. Ph.D. thesis, VU Amsterdam, The Netherlands.
19. Simona Orzan & Jaco van de Pol (2005): Detecting strongly connected components in large distributed state spaces. Technical Report SEN-E0501, CWI, Amsterdam.
20. Mihaela Sighireanu & Radu Mateescu (1998): Verification of the Link Layer Protocol of the IEEE-1394 Serial Bus (FireWire): An Experiment with E-LOTOS. STTT 2(1), pp. 68-88. Available at http://link. springer.de/link/service/journals/bibs/8002001/80020068.htm.
21. Robert Endre Tarjan (1972): Depth-First Search and Linear Graph Algorithms. SIAM J. Comput. 1(2), pp. 146-160.