Structure and behavior preservation by Petri-net-based refinements in system design

Theoretical Computer Science

Volumn 328, Issue 3, 2004, Pages 245-269

  Huang, Hejiao ^a,b   Cheung, To Yat ^b   Mak, Wai Ming ^b  

^a SHAANXI NORMAL UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Design; Petri net; Preservation; Property; Refinement; Specification; Verification

Indexed keywords

BOUNDARY CONDITIONS; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; FUNCTIONS; SPECIFICATIONS; SYSTEMS ANALYSIS; THEOREM PROVING;

PRESERVATION; PROPERTY; REFINEMENT; SPECIFICATION; VERIFICATION;

PETRI NETS;

EID: 9544230696     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.07.016     Document Type: Article

References (17)

1. W. Brauer, R. Gold, W. Vogler, A survey of behavior and equivalence preserving refinement of Petri nets, Lecture Notes in Computer Science 483 (1990) 1-46.
2. T.Y. Cheung, Y. Lu, Detecting and resolving the interaction between telephone features Terminating Call Screening and Call Forwarding by colored Petri nets, Proc. IEEE Internat. Conf. on Systems, Man and Cybernetics, 1995, pp. 2245-2250.
3. T.Y. Cheung, W. Zeng, Invariant-preserving transformations for the verification of place/transition systems, IEEE Trans. Systems Man Cybernet. - Part A: Systems Hum. 28 (1) (1998) 114-121.
4. T.Y. Cheung, X. Zhu, A formal-method approach for cyclomatic complexity of distributed software, Transaction of K.C. Wong Education Foundation Supported Lectures, K.C. Wong Education Foundation, 1994, pp. 99-118.
5. J. Desel, Place/transition Petri nets, Lecture Notes in Computer Science 1491 (1998) 122-173.
6. J. Desel, J. Esparza, Free Choice Petri Nets, Cambridge University Press, Cambridge, 1995.
7. J. Esparza, Reduction and synthesis of live and bounded free choice Petri nets, Inform. Comput. 114 (1) (1994) 50-87.
8. K.X. He, M.D. Lemmon, Liveness verification of discrete event systems modeled by n-safe ordinary Petri nets, Lecture Notes in Computer Science 1825 (2000) 227-243.
9. M.D. Jeng, F. DeCesare, A review of synthesis techniques for Petri nets with application to automated manufacturing systems, IEEE Trans. System Man Cybernet. 23 (1) (1993) 301-312.
10. M.D. Jeng, F. DeCesare, Synthesis using resource control nets for modeling shared-resource systems, IEEE Trans. Robotics Automat. 11 (3) (1995) 317-327.
11. W.M. Mak, Verifying property preservation for component-based software systems (a Petri-net based methodology), Ph.D. Thesis, Department of Computer Science, City University of Hong Kong, June 2001.
12. T. Murata, Petri nets: properties, analysis and applications, Proc. IEEE 77 (4) (1989) 541-580.
13. T. Murata, J.Y. Koh, Reduction and expansion of live and safe marked graphs, IEEE Trans. Circuits Systems 27 (1) (1980) 68-70.
14. R.S. Pressman, Software Engineering, a Practitioner's Approach, 4th ed., McGraw-Hill Book Co., New York, 1997.
15. M. Silva, E. Teruel, J.M. Colom, Linear algebraic and linear programming techniques for the analysis of place/transition net systems, Lecture Notes in Computer Science 1491 (1998) 309-373.
16. I. Suzuki, T. Murata, A method for stepwise refinement and abstraction of Petri nets, J. Comput. System Sci. 27 (1983) 51-76.
17. R. Valette, Analysis of Petri nets by stepwise refinements, J. Comput. System Sci. 18 (1979) 35-46.