Modeling and formal verification of embedded systems based on a Petri net representation

Journal of Systems Architecture

Volumn 49, Issue 12-15, 2003, Pages 571-598

  Cortés, Luis Alejandro ^a   Eles, Petru ^a   Peng, Zebo ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

Embedded systems; Formal verification; Model checking; Modeling; Petri nets

Indexed keywords

AUTOMATA THEORY; FORMAL LOGIC; MATHEMATICAL MODELS; PETRI NETS; SYSTEMS ANALYSIS;

DEGREE OF PARALLELISM;

EMBEDDED SYSTEMS;

EID: 0344034677     PISSN: 13837621     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1383-7621(03)00096-1     Document Type: Article

References (43)

1. R. Alur, C. Courcoubetis, D.L. Dill, Model checking for real-time systems, in: Proc. Symposium on Logic in Computer Science, 1990, pp. 414-425.
2. F. Balarin, H. Hsieh, A. Jurecska, L. Lavagno, A. Sangiovanni-Vincentelli, Formal verification of embedded systems based on CFSM networks, in: Proc. DAC, 1996, pp. 568-571.
3. Brélaz D. New methods to color the vertices of a graph. Communications of the ACM. 22(4):1979;251-256.
4. Camposano R., Wilberg J. Embedded system design. Design Automation for Embedded Systems. 1(January):1996;5-50.
5. Cheng A., Esparza J., Palsberg J. Complexity results for 1-safe nets. Theoretical Computer Science. 147(August):1995;117-136.
6. M. Chiodo, P. Giusto, H. Hsieh, A. Jurecska, L. Lavagno, A. Sangiovanni-Vincentelli, A formal specification model for hardware/software codesign, Technical Report UCB/ERL M93/48, Dept. EECS, University of California, Berkeley, June 1993.
7. Clarke E.M., Emerson E.A., Sistla A.P. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems. 8(2):1986;244-263.
8. Clarke E.M., Grumberg O., Peled D.A. Model Checking. 1999;MIT Press, Cambridge, MA.
9. L.A. Cortés, A Petri net based modeling and verification technique for real-time embedded systems, Licentiate Thesis, Dept. of Computer and Information Science, Linköping University, Linköping, 2001.
10. L.A. Cortés, P. Eles, Z. Peng, Definitions of equivalence for transformational synthesis of embedded systems, in: Proc. ICECCS, 2000, pp. 134-142.
11. L.A. Cortés, P. Eles, Z. Peng, Verification of embedded systems using a Petri net based representation, in: Proc. ISSS, 2000, pp. 149-155.
12. L.A. Cortés, P. Eles, Z. Peng, Hierarchical modeling and verification of embedded systems, in: Proc. Euromicro Symposium on Digital System Design, 2001, pp. 63-70.
13. Edwards S., Lavagno L., Lee E.A., Sangiovanni-Vicentelli A. Design of embedded systems: formal models, validation, and synthesis. Proc. IEEE. 85:1997;366-390.
14. P. Eles, K. Kuchcinski, Z. Peng, A. Doboli, P. Pop, Scheduling of conditional process graphs for the synthesis of embedded systems, in: Proc. DATE Conference, 1998, pp. 132-138.
15. Esparza J. Decidability and complexity of Petri net problems - an introduction. Wolper P., Rozenberg G. Lectures on Petri Nets: Basic Models, LNCS 1491. 1998;374-428 Springer-Verlag, Berlin.
16. Esser R., Teich J., Thiele L. CodeSign: An embedded system design environment. IEE Proc. Computers and Digital Techniques. 145(3):1998;171-180.
17. Gajski D.D., Ramachandran L. Introduction to high-level synthesis. IEEE Design & Test of Computers. 11(4):1994;44-54.
18. Gannon J.D., Purtilo J.M., Zelkowitz M.V. Software Specification: A Comparison of Formal Methods. 1994;Ablex Publishing, Norwood, NJ.
19. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman, San Francisco, CA.
20. Harel D. Statecharts: A visual formalism for complex systems. Science of Computer Programming. 8(3):1987;231-274.
21. Hopcroft J.E., Motwani R., Ullman J.D. Introduction to Automata Theory, Languages, Computation. 2001;Addison-Wesley, Boston, MA.
22. HyTech. Available from 〈http://www-cad.eecs.berkeley.edu/̃tah/HyTech〉.
23. Jensen K. Coloured Petri Nets. 1992;Springer-Verlag, Berlin.
24. Kern C., Greenstreet M.R. Formal verification in hardware design: A survey. ACM Trans. on Design Automation of Electronic Systems. 4(2):1999;123-193.
25. A. Kovalyov, J. Esparza, A polynomial algorithm to compute the concurrency relation of free-choice Signal Transition Graphs, in: Proc. Intl. Workshop on Discrete Event Systems, 1996, pp. 1-6.
26. KRONOS. Available from 〈http://www-verimag.imag.fr/TEMPORISE/kronos〉.
27. Lavagno L., Sangiovanni-Vincentelli A., Sentovich E. Models of computation for embedded system design. Jerraya A.A., Mermet J. System-Level Synthesis. 1999;45-102 Kluwer, Dordrecht.
28. Lee E.A., Parks T.M. Dataflow process networks. Proc. IEEE. 83(5):1995;773-799.
29. P. Lind, S. Kvist, Jammer model description, Technical report, Saab Bofors Dynamics AB, Linköping, April 2001.
30. Maciel P., Barros E., Rosenstiel W. A Petri net model for hardware/software codesign. Design Automation for Embedded Systems. 4(4):1999;243-310.
31. Merlin P.M., Farber D.J. Recoverability of communication protocols - implications of a theoretical study. IEEE Trans. Communications, COM. 24(9):1976;1036-1042.
32. Murata T. Petri nets: analysis and applications. Proc. IEEE. 77(4):1989;541-580.
33. Peterson J.L. Petri Net Theory and the Modeling of Systems. 1981;Prentice-Hall, Englewood Cliffs, NJ.
34. C. Ramchandani, Analysis of asynchronous concurrent systems by timed Petri nets, Technical Report Project MAC 120, Massachusetts Institute of Technology, Cambridge, February 1974.
35. M. Sgroi, L. Lavagno, Y. Watanabe, A. Sangiovanni-Vincentelli, Synthesis of embedded software using free-choice Petri nets, in: Proc. DAC, 1999, pp. 805-810.
36. Sifakis J. Performance evaluation of systems using nets. Brauer W. Net Theory and Applications, LNCS 84. 1980;307-319 Springer-Verlag, Berlin.
37. E. Stoy, A Petri net based unified representation for hardware/software co-design, Licentiate Thesis, Dept. of Computer and Information Science, Linköping University, Linköping, 1995.
38. Strehl K., Thiele L., Gries M., Ziegenbein D., Ernst R., Teich J. FunState - An internal design representation for codesign. IEEE Trans. VLSI Systems. 9(4):2001;524-544.
39. The SAVE Project. Available from 〈http://www.ida.liu.se/̃eslab/save.shtml〉.
40. UPPAAL. Available from 〈http://www.uppaal.com〉.
41. M. Varea, B. Al-Hashimi, Dual transitions Petri net based modelling technique for embedded systems specification, in: Proc. DATE Conference, 2001, pp. 566-571.
42. M. Varea, B. Al-Hashimi, L.A. Cortés, P. Eles, Z. Peng, Symbolic model checking of dual transition Petri nets, in: Proc. CODES, 2002, pp. 43-48.
43. Yen H.-C. A polynomial time algorithm to decide pairwise concurrency of transitions for 1-bounded conflict-free Petri nets. Information Processing Letters. 38:1991;71-76.