Exploiting Equivalence Reduction and the Sweep-Line Method for Detecting Terminal States

IEEE Transactions on Systems, Man, and Cybernetics Part A:Systems and Humans.

Volumn 34, Issue 1, 2004, Pages 23-37

  Billington, Jonathan ^a   Gallasch, Guy Edward ^a   Kristensen, Lars Michael ^b   Mailund, Thomas ^b  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

Colored Petri nets; Deadlock analysis algorithms; Equivalence reduction; Reduction techniques for state space exploration; Sweep line method

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS; COMPUTER SYSTEM RECOVERY; COMPUTER TERMINALS; HEALTH CARE; INTERNET; NETWORK PROTOCOLS; PETRI NETS; TELECOMMUNICATION;

DEADLOCK ANALYSIS ALGORITHMS; EQUIVALENCE REDUCTION; REDUCTION TECHNIQUES FOR STATE SPACE EXPLORATION; SWEEP-LINE METHOD;

FINITE AUTOMATA;

EID: 0742307439     PISSN: 10834427     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCA.2003.820582     Document Type: Article

References (47)

1. B. Thomé, Systems Engineering. Chichester, U.K.: Wiley, 1993.
2. G. Holzmann, Design and Validation of Computer Protocols. London, U.K.: Prentice-Hall, 1991.
3. W. Stallings, Operating Systems - Internals and Design Principles. Englewood Cliffs, NJ: Prentice-Hall, 2001.
4. T. Murata, "Petri nets: Properties, analysis and application," Proc. IEEE, vol. 77, pp. 541-580, Apr. 1989.
5. E. Clarke, O. Grumberg, and D. Peled, Model Checking. Cambridge, MA: MIT Press, 1999.
6. G. Holzmann, "Algorithms for automated protocol validation," AT&T Tech. J., vol. 69, no. 2, pp. 32-44, 1990.
7. A. Valmari, "Error detection by reduced reachability graph generation," in Proc. Ninth Eur. Workshop Application Theory Petri Nets, 1988, pp. 95-112.
8. A. Tanenbaum, Computer Networks, 3rd ed. Englewwod Cliffs, NJ: Prentice-Hall, 1996.
9. A. Valmari, "The state explosion problem," in Lectures on Petri Nets I: Basic Models. New York: Springer-Verlag, 1998, vol. 1491, Lecture Notes in Computer Science, pp. 429-528.
10. E. Clarke, E. Emerson, S. Jha, and A. Sistla, "Symmetry reductions in model checking," in Proc. CAV, vol. 1427, Lecture Notes in Computer Science, 1998, pp. 147-159.
11. E. Clarke, R. Enders, T. Filkorn, and S. Jha, "Exploiting symmetries in temporal logic model checking," Formal Meth. Syst. Design, vol. 9, pp. 77-104, Aug 1996.
12. C. Ip and D. Dill, "Better verification through symmetry," Formal Methods Syst. Design, vol. 9, pp. 41-75, Aug. 1996.
13. E. Emerson and A. Sistla, "Symmetry and model checking," Format Methods Syst. Design, vol. 9, pp. 105-131, Aug. 1996.
14. K. Jensen, "Condensed state spaces for symmetrical coloured Petri nets," Formal Meth. Syst. Design, vol. 9, pp. 7-40, Aug. 1996.
15. _, Coloured Petri Nets. Volume 2, Analysis Methods. New York: Springer-Verlag, 1997, Monographs in Theoretical Computer Science.
16. R. Bryant, "Graph based algorithms for boolean function manipulation," IEEE Trans. Comput., vol. C-35, pp. 677-691, Aug. 1986.
17. K. McMillan, Symbolic Model Checking. Boston, MA: Kluwer, 1993.
18. A. Valmari, "Compositionality in state space verification methods," in Proc. ICATPN, vol. 1091, LNCS, 1996, pp. 29-56.
19. P. Buchholz and P. Kemper, "Efficient computation and representation of large reachability sets for composed automata," Discr. Event Dyn. Syst.: Theory Appl. vol. 12, pp. 265-286, 2002.
20. _, "Hierarchial reachability graph generation for Petri nets," Formal Meth. System Des., vol. 21, pp. 281-315, 2002.
21. A. Valmari, "A stubborn attack on state explosion," in Proc. CAV, vol. 531, Lecture Notes in Computer Science, 1990, pp. 156-165.
22. D. Peled, "All from one, one for all: On model checking using representatives," in Proc. CAV, vol. 697, Lecture Notes in Computer Science, 1993, pp. 409-423.
23. P. Wolper and P. Godefroid, "Partial order methods for temporal verification," in Proc. CONCUR, vol. 715, Lecture Notes in Computer Science, 1993.
24. G. Holzmann, "An analysis of bitstate hashing," Formal Meth. Syst. Design, vol. 13, pp. 289-307, 1998.
25. _, "An improved protocol reachability analysis technique," Soft. Practice, Exper., vol. 18, no. 2, pp. 137-161, 1988.
26. U. Stern and D. Dill, "Improved probabilistic verification by hash compaction," in Correct Hardware Design and Verification Methods. New York: Springer-Verlag, 1995, vol. 987, pp. 206-224.
27. P. Wolper and D. Leroy, "Reliable hashing without collision detection," in Proc. CAV, vol. 697, Lecture Notes in Computer Science, 1993, pp. 59-70.
28. C. Jard and T. Jeron, "Bounded-memory algorithms for verification on-the-fly," in Proc. CAV, vol. 575, Lecture Notes in Computer Science, 1991.
29. P. Godefroid, G. Holzmann, and D. Pirottin, "State-space caching revisited," Formal Methods Syst. Design, vol. 7, no. 3, pp. 227-241, 1995.
30. S. Christensen, L. Kristensen, and T. Mailund, "A sweep-line method for state space exploration," in Proc. TACAS, vol. 2031, Lecture Notes in Computer Science, 2001, pp. 450-464.
31. L. Kristensen and T. Mailund, "A generalized sweep-line method for safety properties," in Proc. FME, vol. 2391, Lecture Notes in Computer Science, 2002, pp. 549-567.
32. E. Emerson, S. Jha, and D. Peled, "Combining partial order and symmetry reduction," in Proc. TACAS, vol. 1217, Lecture Notes in Computer Science, 1997, pp. 35-49.
33. M. Tiusanen, "Symbolic, symmetry, and stubborn set searches," Lecture Notes Comput. Sci., vol. 815, pp. 511-530, 1994.
34. K. Varpaaniemi, "On combining the stubborn set method with the sleep set method," in Lecture Notes Comput. Science. New York: Springer-Verlag, 1994, vol. 815, pp. 548-567.
35. A. Valmari, "Stubborn sets of coloured Petri nets," in Proc. ICATPN, 1991, pp. 102-121.
36. L. Kristensen and T. Mailund, "A compositional sweep-line state space exploration method," in Proc. FORTE, vol. 2529, Lecture Notes in Computer Science, 2002, pp. 327-343.
37. S. Gordon, L. Kristensen, and J. Billington, "Verification of a revised wap wireless transaction protocol," in Proc. ICATPN, vol. 2360, LNCS, 2002, pp. 182-202.
38. S. Christensen and J. Jørgensen, "Analysis of Bang and Olufsen's BeoLink audio/video system using coloured Petri nets," in Proc. ICATPN, vol. 1248, LNCS, 1997, pp. 387-406.
39. K. Jensen, Coloured Petri Nets. Volume 1, Basic Concepts. New York: Springer-Verlag, Monographs in Theoretical Computer Science.
40. R. Milner, Communication and Concurrency. London, U.K.: Prentice-Hall, 1989.
41. S. Christensen, K. Jensen, T. Mailund, and L. Christensen, "State space methods for timed coloured Petri nets," in Proc. 2nd Int. Colloq. Petri Net Technol. Modeling Commun.-Based Syst., Berlin, Germany, Sept. 2001.
42. T. Mailund, "Analysing infinite-state systems by combining equivalence reduction and the sweep-line method," in Proc. ICATPN, vol. 2360, LNCS, 2002, pp. 314-333.
43. WAP Forum. Wireless Application Protocol. [Online]. Available: http://www.wapforum.org/
44. S. Gordon, "Verification of the WAP transaction layer using coloured Petri nets," Ph.D. dissertation, School Elect. Inform. Eng., Inst. Telecommun. Res. Comput. Syst. Eng. Centre, Univ. South Australia, Mawson Lakes, Australia, 2001.
45. "Internet open trading protocol - IOTP Version 1.0," The Internet Society, Reston, VA, RFC 2801, 2000.
46. "Internet Open Trading Protocol - Version 2 Requirements," The Internet Society, Reston, VA, RFC 3354, 2002.
47. C. Ouyang, L. Kristensen, and J. Billington, "A formal and executable specification of the internet open trading protocol," in Proc. EC-Web, vol. 2455, Lecture Notes in Computer Science, 2002, pp. 377-387.