SAT-Based verification of safe petri nets

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

Volumn 3299, Issue , 2004, Pages 79-92

  Ogata, Shougo ^a   Tsuchiya, Tatsuhiro ^a   Kikuno, Tohru ^a  

^a OSAKA UNIVERSITY   (Japan)

Author keywords

Bounded model checking; Petri nets; SAT

Indexed keywords

DECISION THEORY; PETRI NETS;

BOUNDED MODEL CHECKING; DECISION PROBLEMS; MODEL CHECKING PROBLEM; PROPOSITIONAL SATISFIABILITY; SAT; SAT-BASED; VERIFICATION METHOD;

MODEL CHECKING;

EID: 33749552512     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30476-0_11     Document Type: Article

References (18)

1. P. A. Abdulla, S. P. Iyer, and A. Nylén. Sat-solving the coverability problem for Petri nets. Formal Methods in System Design, 24(1):25-43, 2004.
2. A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proceedings of Tools and Algorithms for the Analysis and Construction of Systems (TACAS'99), LNCS 1579, pages 193-207. Springer-Verlag, 1999.
3. A. Cheng, J. Esparza, and J. Palsberg. Complexity results for 1-safe nets. Theoretical Computer Science, 147(1-2):117-136, 1995.
4. A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NUSMV: A new symbolic model checker. International Journal on Software Tools for Technology Transfer, 2(4):410-425, 2000.
5. E. M. Clarke, Jr., O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
6. F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Y. Vardi. Benefits of bounded model checking at an industrial setting. In Proceedings of 13th International Computer Aided Verification Conference (CAV'01), LNCS 2102, pages 436-453. Springer-Verlag, 2001.
7. B. Grahlmann. The PEP Tool. In Proceedings of 9th Computer Aided Verification (CAV'97), LNCS 1254, pages 440-443. Springer-Verlag, June 1997.
8. K. Heljanko. Bounded reachability checking with process semantics. In Proceedings of the 12th International Conference on Concurrency Theory (Concur'2001), LNCS 2154, pages 218-232, Aalborg, Denmark, August 2001. Springer.
9. K. Heljanko and I. Niemelä. Bounded LTL model checking with stable models. Theory and Practice of Logic Programming, 3(4&5):519-550, 2003.
10. P.-H. Ho, A. J. Isles, and T. Kam. Formal verification of pipeline control using controlled token nets and abstract interpretation. In Proceedings of the 1998 IEEE/ACM international conference on Computer-aided design, pages 529-536. ACM Press, 1998.
11. G. J. Holzmann. The model checker SPIN. IEEE Trans. Softw. Eng., 23(5):279-295, 1997.
12. K. L. McMillan. A technique of state space search based on unfolding. Form. Methods Syst. Des., 6(1):45-65, 1995.
13. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff : Engineering an efficient sat solver. In Proceedings of 39th Design Automation Conference, pages 530-535. ACM Press, 2001.
14. E. Pastor, J. Cortadella, and O. Roig. Symbolic analysis of bounded petri. IEEE Transactions on Computers, 50(5):432-448, May 2001.
15. D. A. Plaisted and S. Greenbaum. A structure-preserving clause form translation. Journal of Symbolic Computation, 2:293-304, September 1986.
16. M. Sheeran, S. Singh, and G. Stålmarck. Checking safety properties using induction and a sat-solver. In Proc. of International Conference on Formal Methods in Computer-Aided Design (FMCAD 2000), LNCS 1954, pages 108-125. Springer-Verlag, 2000.
17. T. Tsuchiya, M. Nakamura, and T. Kikuno. Detecting Feature Interactions in Telecommunication Services with a SAT solver. In Proc. of 2002 Pacific Rim International Symposium on Dependable Computing (PRDC'02), pages 131-134. IEEE CS Press, 2002.
18. T. Yoneda, T. Kitai, and C. Myers. Automatic derivation of timing constraints by failure analysis. In Proceedings of the 14th International Conference on Computer-aided Verification (CAV 2002), LNCS vol.2404, pages 195-208. Springer-Verlag, 2002.