Model checking LTL properties of high-level petri nets with fairness constraints

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

Volumn 2075, Issue , 2001, Pages 242-262

  Latvala, Timo ^a  

^a AALTO UNIVERSITY   (Finland)

Author keywords

Fairness; High level petri nets; LTL; Model checking

Indexed keywords

PETRI NETS; TEMPORAL LOGIC;

COLOURED PETRI NETS; FAIRNESS; FAIRNESS CONSTRAINTS; HIGH-LEVEL PETRI NETS; LINEAR TEMPORAL LOGIC; LIVENESS PROPERTIES; LTL PROPERTY; SLIDING WINDOW PROTOCOL;

MODEL CHECKING;

EID: 84947257677     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45740-2_15     Document Type: Conference Paper

References (38)

1. CCITT. Specification and description language (SDL). Technical Report Z.100, ITU-T, 1996.
2. E.M. Clarke and E.A. Emerson. Design and synthesis of syncronization of skeletons using branching time temporal logic. In Proceedings of the IBM Workshop on Logics of Programs, pages 52-71. Springer-Verlag, 1981. LNCS 131.
3. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory efficient algorithms for the verification of temporal properties. Formal Methods in System Design, 1: 275-288, 1992.
4. J.-M. Couvreur. On-the-fly verification of linear temporal logic. In Proceeding of the World Congress on Formal Methods in the Development of Computing Systems (FM'99), volume 1, pages 253-271, Berlin, 1999. Springer-Verlag. LNCS 1708.
5. M. Daniele, F. Giunchiglia, and M.Y. Vardi. Improved automata generation for linear temporal logic. In Proceedings of the International Conference on Computer Aided Verification (CAV'99), pages 249-260, Berlin, 1999. Springer-Verlag. LNCS 1633.
6. E.A. Emerson and C-L. Lei. Modalities for model checking: Branching time logic strikes back. Science of Computer Programming, 8(3): 275-306, 1987.
7. N. Francez. Fairness. Springer-Verlag, New York, 1986.
8. R. Gerth, D. Peled, M.Y. Vardi, and P. Wolper. Simple on-the-fly automatic verification of linear temporal logic. In Proceedings of the 15th Workshop Protocol Specification, Testing, and Verification, Warsaw, June 1995. North-Holland.
9. P. Godefroid and D.E. Long. Symbolic protocol verification with Queue BDDs. Formal Methods in System Design, 14(13): 257-271, May 1999.
10. R. Hojati, V. Singhal, and R.K. Brayton. Edge-Streett / edge-Rabin automata environment for formal verification using language containment. Memorandum UCB/ERL M94/12, Electronics Research Laboratory, University of California, Cory Hall, Berkley, 1994.
11. G.J. Holzmann. The model checker Spin. IEEE Transactions on Software Engineering, 23(5): 279-295, May 1997.
12. K. Jensen. Coloured Petri Nets, volume 1. Springer-Verlag, Berlin, 1997.
13. R. Kaivola. Using compositional preorders in the verification of sliding window protocol. In Proceedings of the 9th International Conference on Computer Aided Verification (CAV'97), pages 48-59. Springer-Verlag, 1997. LNCS 1254.
14. Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal properties. In Proceedings of the 25th International Colloquium on Automata, Languages and Programming (ICALP 1998), pages 1-16. Springer-Verlag, 1998. LNCS 1443.
15. E. Kindler and W. Reisig. Algebraic system nets for modeling distributed algorithms. Petri Net Newsletter, 51: 16-31, 1996.
16. E. Kindler and H. Völzer. Flexibility in algebraic nets. In Proceedings of the International Coneference on Application and Theory of Petri Nets 1998 (ICAPTN'98), pages 345-364. Springer-Verlag, 1998. LNCS 1420.
17. R.P. Kurshan. Computer-Aided Verfication of Coordinating Processes: The Automata-Theoretic Approach. Princeon University Press, Princeton, New Jersey, 1994.
18. T. Latvala. Model checking linear temporal logic properties of Petri nets with fairness constraints. Research Report A67, Helsinki University of Technology, Jan 2001.
19. T. Latvala and K. Heljanko. Coping with strong fairness. Fundamenta Informaticae, 43(1-4): 175-193, 2000.
20. O. Lichtenstein and A. Pnueli. Checking that finite state programs satisfy their linear specification. In Proceedings of the 12th ACM Symposium on Principles of Programming Languages, pages 97-107, 1985.
21. M. Mäkelä. Maria: Modular reachability analyzer for algebraic system nets. On-line documentation, 1999. http://www.tcs.hut.fi/maria.
22. A. Pnueli. The temporal logic of programs. In Proceedings of 18th IEEE Symposium on Foundation of Computer Science, pages 46-57, 1977.
23. J.P. Quielle and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proceedings of the 5th International Symposium on Programming, pages 337-350, 1981.
24. M. Rauch Henzinger and J.A. Telle. Faster algorithms for the nonemptiness of Streett automata and for communication protocol pruning. In Proceedings of the 5th Scandinavian Workshop on Algorithm Theory(SWAT'96), 1997.
25. W. Reisig. Petri nets and algebraic specifications. Theoretical Computer Science, 80: 1-34, March 1991.
26. M. Rönkkö. A distributed object oriented implementation of an algorithm converting a LTL formula to a generalised Büchi automaton. On-line documentation, 1998. http://www.abo.fi/%7Emronkko/PROJECT/LTL2BUCHI/abstract.html.
27. K. Sabnani. An algorithmic technique for protocol verification. IEEE Transactions on Communications, 36(8): 235-248, 1988.
28. S. Safra. On the complexity of omega-automata. In 29th Annual Symposium on Foundations of Computer Science, pages 319-327. IEEE, 1988.
29. K. Schmidt. LoLA: A low level analyser. In Proceedings of the 21st International Conference on Application and Theory of Petri Nets (ICATPN 2000), pages 465-474. Springer-Verlag, 2000. LNCS 1825.
30. A.P. Sistla and E.M. Clarke. The complexity of propositional linear temporal logic. Journal of the Association for Computing Machinery, 32(3): 733-749, July 1985.
31. M.A. Smith and N. Klarlund. Verification of a sliding window protocol using IOA and MONA. In Proceeding of the 20th Joint International Conference on Formal Methods for Distributed Systems and Communication Protocols (FORTE/PSTV 2000), pages 19-34. Kluwer Academic Publishers, 2000.
32. F. Somenzio and R. Bloem. Efficient büchi automata from LTL formulae. In Proceedings of the International Conference on Computer Aided Verification (CAV2000), pages 248-263. Springer-Verlag, 2000. LNCS 1855.
33. N.V. Stenning. A data transfer protocol. In Computer Networks, volume 11, pages 99-110, 1976.
34. W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, volume B, pages 133-191. Elsevier, 1990.
35. W. Thomas. Languages, automata and logic. In G Rozenberg and A Salomaa, editors, Handbook of Formal Languages, volume 3, pages 385-455. Springer-Verlag, New York, 1997.
36. A. Valmari. The state explosion problem. In Lectures on Petri Nets I: Basic Models, pages 429-528. Springer-Verlag, 1998. LNCS 1491.
37. K. Varpaaniemi, J. Halme, K. Hiekkanen, and T. Pyssysalo. PROD reference manual. Technical Report 13, Helsinki University of Technology, 1995.
38. P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proceedings of the 13th ACM Symposium on Principles of Programming Languages, pages 184-194, 1986.