Sigref - A symbolic bisimulation tool box

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4218 LNCS, Issue , 2006, Pages 477-492

  Wimmer, Ralf ^a   Herbstritt, Marc ^a   Hermanns, Holger ^b   Strampp, Kelley ^a   Becker, Bernd ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL METHODS; COMPUTER SIMULATION;

BISIMULATIONS; REAL WORLD INSTANCES; SIGREF; STATE SPACE DESCRIPTION;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 33845211246     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11901914_35     Document Type: Conference Paper

References (41)

1. Wimmer, R., Herbstritt, M., Becker, B.: Minimization of Large State Spaces using Symbolic Branching Bisimulation. In: Proc. of IEEE Workshop on Design & Diagnostics of Electronic Circuits & Systems (DDECS). (2006) 9-14
2. Chehaibar, G., et al.: Specification and Verification of the PowerScale™ Bus Arbitration Protocol: An Industrial Experiment with LOTOS. In: Proc. of FORTE. Volume 69. (1996) 435-450
3. Giannakopoulou, D.: Model Checking for Concurrent Software Architectures. PhD thesis, Imperial College, University of London (1999)
4. Graf, S., Steffen, B., Luttgen, G.: Compositional minimisation of finite state systems using interface specifications. Formal Asp. of Comp. 8(5) (1996) 607-616
5. Kanellakis, P., Smolka, S.: CCS expressions, finite state processes, and three problems of equivalence. Information and Computation 86(1) (1990) 43-68
6. Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM Jour. on Computing 16(6) (1987) 973-989
7. 20 States and Beyond. Information and Computation 98(2) (1992) 142-170
8. Bouajjani, A., Fernandez, J.C., Halbwachs, N.: Minimal model generation. In: Proc. of CAV. Volume 531 of LNCS., Springer (1991) 197-203
9. Bouajjani, A., Fernandez, J.C., Halbwachs, N., Ratel, C., Raymond, P.: Minimal state graph generation. Science of Computer Programming 18 (1992) 247-269
10. Bouali, A., de Simone, R.: Symbolic Bisimulation Minimisation. In: Proc. of CAV. Volume 663 of LNCS., Springer (1992) 96-108
11. Blom, S., Orzan, S.: Distributed Branching Bisimulation Reduction of State Spaces. ENTCS 89(1) (2003) 990-113
12. Milner, R.: Communication and Concurrency. Prentice Hall (1989)
13. Milner, R.: A Calculus of Communicating Systems. Volume 92 of LNCS. (1980)
14. Milner, R.: Lectures on a Calculus for Communicating Systems. In: Proc. Seminar on Concurrency. Volume 197 of LNCS., Springer (1984) 197-220
15. van Glabbeek, R., Weijland, W.: Branching Time and Abstraction in Bisimulation Semantics. Journal of the ACM 43(3) (1996) 555-600
16. Baeten, J., van Glabbeek, R.: Another Look at Abstraction in Process Algebra. In: Proc. of ICALP. Volume 267 of LNCS., Springer (1987) 84-94
17. Bergstra, J.A., Ponse, A., van der Zwaag, M.B.: Branching time and orthogonal bisimulation equivalence. Theor. Comp. Sci. 309 (2003) 313-355
18. Milner, R.: A Modal Characterization of Observable Machine-Behaviour. In: Proc. of CAAP. Volume 112 of LNCS., Springer (1981) 25-34
19. Montanari, U., Sassone, V.: Dynamic congruence vs. progressing bisimulation for CCS. Fundam. Inform. 16(1) (1992) 171-199
20. Bouajjani, A., et al.: Safety for Branching Time Semantics. In: Proc. of ICALP. Volume 510 of LNCS., Springer (1991) 76-92
21. van Glabbeek, R.J.: The linear time - branching time spectrum II. In: Proc. of CONCUR. Volume 715 of LNCS., Springer (1993) 66-81
22. Hermanns, H., Lohrey, M.: Priority and maximal progress are completely axiomatisable. In: Proc. of CONCUR. Volume 1466 of LNCS., Springer (1998) 237-252 (Extended Abstract).
23. Park, D.: Concurrency and automata on infinite sequences. In: GI Conf. on Theor. Comp. Sci. Volume 104 of LNCS., Springer (1981) 167-183
24. Dovier, A., Gentilini, R., Piazza, C., Policriti, A.: Rank-based symbolic bisimulation (and model checking). ENTCS 67 (2002)
25. Klarlund, N.: An n log n algorithm for online BDD refinement. In: Proc. of CAV. Volume 1254 of LNCS., Springer (1997) 107-118
26. Somenzi, F.: CUDD: CU Decision Diagram Package Release 2.4.1. University of Colorado at Boulder (2005)
27. Groote, J.F., Vaandrager, F.W.: An Efficient Algorithm for Branching Bisimulation and Stuttering Equivalence. In Paterson, M., ed.: Proc. of ICALP. Volume 443 of LNCS., Springer (1990) 626-638
28. Bryant, R.: Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. on Comp. 35(8) (1986) 677-691
29. Wegener, I.: Branching programs and binary decision diagrams. SIAM Monographs on Discrete Mathematics and Applications. SIAM (2000)
30. Strampp, K.: Symbolische Berechnung von Bisimulationen. Diploma thesis, Albert-Ludwigs-University Freiburg, Germany (2006)
31. Matsunaga, Y., McGeer, P.C., Brayton, R.K.: On computing the transitive closure of a state transition relation. In: Proc. of DAC, ACM Press (1993) 260-265
32. Burch, J.R., et al.: Sequential circuit verification using symbolic model checking. In: Proc. of DAC, ACM Press (1990) 46-51
33. Garavel, H., Hermanns, H.: On Combining Functional Verification and Performance Evaluation using CADP. In: Proc. of FME. Volume 2391 of LNCS. (2002)
34. Fernandez, J.C., et al.: CADP: A Protocol Validation and Verification Toolbox. In: Proc. of CAV. Volume 1102 of LNCS. (1996) 437-440
35. Herbstritt, M., Wimmer, R., Peikenkamp, T., Böde, E., Adelaide, M., Johr, S., Hermanns, H., Becker, B.: Analysis of Large Safety-Critical Systems: A quantitative Approach. Reports of SFB/TR 14 AVACS 8 (2006) ISSN: 1860-9821.
36. Ciardo, G., Tilgner, M.: On the use of Kronecker operators for the solution of generalized stochastic Petri nets. Technical Report 96-35, ICASE (1996)
37. Kuntz, M., Siegle, M., Werner, E.: Symbolic Performance and Dependability Evaluation with the Tool CASPA. In: FORTE Workshops. Volume 3236 of LNCS., Springer (2004) 293-307
38. Harel, D., Politi, M.: Modelling Reactive Systems with Statecharts: The STATE-MATE Approach. McGraw-Hill (1998)
39. ERTMS: Project Website (May 16, 2006) http://ertms.uic.asso.fr/etcs.html.
40. ARP 4761: Guidelines and Methods for Conducting the Safety Assessment Process on Civil Airborne Systems and Equipment. Aerospace Recommended Practice, Society of Automotive Engineers, Detroit, USA (1996)
41. Hermanns, H.: Interactive Markov Chains: The Quest for Quantified Quality. Volume 2428 of LNCS. Springer (2002)