Adding Symmetry Reduction to UPPAAL

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

Volumn 2791, Issue , 2004, Pages 46-59

  Hendriks, Martijn ^a   Behrmann, Gerd ^b   Larsen, Kim ^a   Niebert, Peter ^c   Vaandrager, Frits ^b  

^a RADBOUD UNIVERSITY NIJMEGEN   (Netherlands)

^b AALBORG UNIVERSITY   (Denmark)

^c UNIVERSITÉ DE PROVENCE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

TIME SHARING SYSTEMS;

COMPUTATION TIME; MEMORY CONSUMPTION; MODEL CHECKER; PROTOTYPE TOOLS; REAL TIME MODELING; REDUCTION STRATEGY; STATIC DETECTIONS; SYMMETRY REDUCTION;

MODEL CHECKING;

EID: 35048888926     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-40903-8_5     Document Type: Article

References (28)

1. M. Abadi and L. Lamport. An old-fashioned recipe for real time. ACM Transactions on Programming Languages and Systems, 16(5):1543-1571, September 1994.
2. R. Alur, C. Courcoubetis, and D.L. Dill. Model checking in dense real time. Information and Computation, 104:2-34, 1993.
3. R. Alur and D.L. Dill. Automata for modeling real-time systems. In 17th International Colloquium on Automata, Languages, and Programming, pages 322-335, 1990.
4. H. Attiya, C. Dwork, N. Lynch, and L. Stockmeyer. Bounds on the time to reach agreement in the presence of timing uncertainty. Journal of the ACM, 41(1):122-152, 1994.
5. R. Bellman. Dynamic Programming. Princeton University Press, 1957.
6. D. Bosnacki, D. Dams, and L. Holenderski. A heuristic for symmetry reductions with scalarsets. In J.N. Oliveira and P. Zave, editors, FME 2001, number 2021 in LNCS, pages 518-533. Springer-Verlag, 2001.
7. E. M. Clarke, S. Jha, R. Enders, and T. Filkorn. Exploiting symmetry in temporal logic model checking. Formal Methods in System Design, 9(1/2):77-104, 1996.
8. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. The MIT Press, 2000.
9. D. Dill. Timing assumptions and verification of finite-state concurrent systems. In J. Sifakis, editor, Proc. of Automatic Verification Methods for Finite State Systems, number 407 in LNCS, pages 197-212. Springer-Verlag, 1989.
10. D. L. Dill, A. J. Drexler, A. J. Hu, and C. Han Yang. Protocol verification as a hardware design aid. In IEEE International Conference on Computer Design: VLSI in Computers and Processors, pages 522-525. IEEE Computer Society, 1992.
11. L. Elgaard. The Symmetry Method for Coloured Petri Nets - Theory, Tools, and Practical Use. PhD thesis, Department of Computing Science, University of Aarhus, Denmark, July 2002.
12. E.A. Emerson and A.P. Sistla. Symmetry and model checking. In CAV'93, number 697 in LNCS. Springer-Verlag, 1993.
13. K. Havelund, A. Skou, K.G. Larsen, and K. Lund. Formal modelling and analysis of an audio/video protocol: An industrial case study using UPPAAL. In 18th IEEE Real-Time Systems Symposium, pages 2-13, 1997.
14. M. Hendriks. Enhancing UPPAAL by exploiting symmetry. Technical Report NIII-R0208, NIII, University of Nijmegen, October 2002.
15. M. Hendriks, G. Behrmann, K. G. Larsen, P. Niebert, and F. W. Vaandrager. Adding symmetry reduction to UPPAAL. Technical Report NIII-R03xx, NIII, University of Nijmegen, 2003. To appear.
16. T. A. Henzinger, P. Ho, and H. Wong-Toi. HYTECH: A model checker for hybrid systems. Software Tools for Technology Transfer, 1:110-122, 1997.
17. G. J. Holzmann. The SPIN model checker. IEEE Transactions on Software Engineering, 23(5):279-295, 1997.
18. P. Huber, A. M. Jensen, L. O. Jepsen, and K. Jensen. Reachability trees for high-level petri nets. Theoretical Computer Science, 45(3):261-292, 1986.
19. C.N. Ip and D.L. Dill. Better verification through symmetry. In D. Agnew, L. Claesen, and R. Camposano, editors, Computer Hardware Description Languages and their Applications, pages 87-100, Ottawa, Canada, 1993. Elsevier Science Publishers B.V., Amsterdam, The Netherlands.
20. Journal version appeared in Formal Methods in System Design, 9(1/2):41-75, 1996.
21. K. Jensen. Condensed state spaces for symmetrical Coloured Petri Nets. Formal Methods in System Design, 9(l/2):7-40, 1996.
22. K. G. Larsen, P. Pettersson, and W. Yi. UPPAAL in a nutshell. International Journal on Software Tools for Technology Transfer, pages 134-152, 1998.
23. K. L. McMillan. Symbolic Model Checking. PhD thesis, Carnegie Mellon University, Pittsburgh, May 1992.
24. P.H. Starke. Reachability analysis of petri nets using symmetries. Syst. Anal. Model. Simul./5, 8(4):293-303, 1991.
25. A. S. Tanenbaum. Computer Networks. Prentice-Hall, 1996.
26. F. Wang. Efficient data structure for fully symbolic verification of real-time software systems. In S. Graf and M. Schwartzbach, editors, TACAS'00, number 1785 in LNCS, pages 157-171. Springer-Verlag, 2000.
27. F. Wang and K. Schmidt. Symmetric symbolic safety-analysis of concurrent software with pointer data structures. In D.A. Peled and M.Y. Vardi, editors, FORTE'02, number 2529 in LNCS, pages 50-64. Springer-Verlag, 2002.
28. S. Yovine. KRONOS: a verification tool for real-time systems. International Journal on Software Tools for Technology Transfer, 1(2), 1997.