Petri net reactive modules

Theoretical Computer Science

Volumn 359, Issue 1-3, 2006, Pages 77-100

  Ţiplea, Ferucio Laurenţiu ^a   Ţiplea, Aurora ^b  

^a University of Central Florida   (United States)

^b ALEXANDRU IOAN CUZA UNIVERSITY OF IASI   (Romania)

Author keywords

Petri net; Process semantics; Reactive system; Replacement; Structural transformation

Indexed keywords

FUNCTIONS; INTERFACES (COMPUTER); MATHEMATICAL OPERATORS; MATHEMATICAL TRANSFORMATIONS; SEMANTICS; THEOREM PROVING;

PROCESS SEMANTICS; REACTIVE SYSTEM; REPLACEMENT; STRUCTURAL TRANSFORMATION;

PETRI NETS;

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

References (37)

1. R. Alur, Th.A. Henziger, Reactive modules, in: Proc. 11th IEEE Symp. on Logic in Computer Science, LICS, 1996, pp. 207-218.
2. S. Berezin, S. Campos, E.M. Clarke, Compositional reasoning in model checking, in: Proc. Internat. Symp. "Compositionality: The Significant Difference" COMPOS'97, Bad Malente, Germany, September 8-12, 1997, Lecture Notes in Computer Science, Vol. 1536, Springer, Berlin, 1998, pp. 81-102.
3. Best E., Devillers R., Kiehn A., and Pomelo L. Concurrent bisimulations in Petri nets. Acta Inform. 28 (1991) 231-264
4. E. Best, C. Fernandez, Nonsequential Processes. A Petri Net Point of View, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1988.
5. Brauer W., Gold R., and Vogler W. A survey of behaviour and equivalence preserving refinements of Petri nets. Advances of Petri Nets 1990, Lecture Notes in Computer Science Vol. 483 (1990), Springer, Berlin 1-46
6. Chehaibar G. Replacement of open interface subnets and stable state transformation equivalence. Advances in Petri Nets 1993, Lecture Notes in Computer Science Vol. 674 (1993), Springer, Berlin 1-25
7. Damm W., Döhmen G., and Gerstner V. Modular verification of Petri nets. The Temporal Logic Approach. In: Bakker J.W., de Roever W.-P., and Rozenberg G. (Eds). Proc. REX Workshop on Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, Lecture Notes in Computer Science Vol. 430 (1989), Springer, Berlin 180-207
8. Desel J. Validation of system models using partially ordered runs. In: van der Aalst W.M.P., Desel J., and Oberweis A. (Eds). Business Process Management-Models, Techniques and Empirical Studies, Lecture Notes in Computer Science (1999), Springer, Berlin
9. Desel J., and Reisig W. Place/Transition Petri Nets. In: Reisig W., and Rozenberg G. (Eds). Lectures on Petri Nets I: Basic Models, Lecture Notes in Computer Science Vol. 1491 (1998), Springer, Berlin 122-173
10. Glabbeck R.J.v., and Golz U. Equivalence notions for concurrent systems and action refinement. Mathematical Foundations of Computer Science 1989, Lecture Notes in Computer Science Vol. 379 (1989), Springer, Berlin 237-248
11. Grumberg O., and Long D.E. Model checking and modular verification. ACM Trans. Programming Languages Syst. 16 (1994) 843-871
12. Josko B. Verifying the correctness of AADL-modules using model checking. In: Bakker J.W., de Roever W.-P., and Rozenberg G. (Eds). Proc. REX Workshop on Stepwise Refinement of Distributed Systems, Models, Formalisms, Correctness, Lecture Notes in Computer Science Vol. 430 (1989), Springer, Berlin 386-400
13. Kersten Y., and Pnueli A. Modularization and abstraction: the keys to practical formal verification. in: Proc. 23rd Internat. Symp. on Mathematical Foundations of Computer Science MFCS'98, Lecture Notes in Computer Science Vol. 1450 (1998), Springer, Berlin 54-71
14. Kiehn A. Petri net systems and their closure properties. Advances in Petri Nets 1989, Lecture Notes in Computer Science Vol. 424 (1990), Springer, Berlin 306-328
15. Kindler E. A compositional partial order semantics for Petri net components. in: Proc. 18th Internat. Conf. on Application and Theory of Petri Nets, Toulouse, France, Lecture Notes in Computer Science Vol. 1248 (1998), Springer, Berlin 235-252
16. O. Kupferman, M.Y. Vardi, Modular model checking, in: Proc. Internat. Symp. "Compositionality: The Significant Difference" COMPOS'97, Bad Malente, Germany, September 8-12, 1997, Lecture Notes in Computer Science, Vol. 1536, Springer, Berlin, 1998, pp. 381-401.
17. Manna Z., and Pnueli A. The Temporal Logic of Reactive and Concurrent Systems, Specification (1992), Springer, Berlin
18. Müller K. Constructable Petri nets. J. Inform. Process. Cybernet. EIK 21 (1985) 171-199
19. E. Pelz, Normalization of Place/transition-systems preserves net behaviour, in: Reseaux et logique. L'etude des semantique de la concurrence dans le cadre des reseaux de Petri (These d'etat), Universite de Paris-Sud, 1990 (also in: RAIRO Informatique Theorique 26(1) (1992) 19-44).
20. Peterson J.L. Petri Net Theory and the Modelling of Systems (1981), Prentice-Hall, New Jersey
21. W. Reisig, Petri Nets. An Introduction, EATCS Monographs on Theoretical Computer Science, Springer, Berlin, 1985.
22. Reisig W. Elements of Distributed Algorithms. Modeling and Analysis with Petri Nets (1998), Springer, Berlin
23. Rozenberg G., and Verraedt R. Restricting the In-Out Structure of Graphs of Petri Nets. A Language Theoretic Point of View. Fund. Inform. VII.2 (1984) 151-189
24. Suzuki I., and Murata T. A method for stepwise refinement and abstraction of Petri nets. J. Comput. Syst. Sci. 27 (1983) 51-76
25. Ţiplea F.L., and Ene C. Hierarchies of Petri net languages and a super-normal form. in: Proc. Second Internat. Conf. "Developments in Languages Theory" (1995), Magdeburg, Germany
26. Ţiplea F.L., Katsura M., and Ito M. On replacement of Petri nets and some applications. in: Proc. Workshop on Semigroups, Formal Languages and Computer Systems, RIMS Kokyuroku Vol. 960 (1996), Kyoto, Japan 178-180
27. Ţiplea F.L., Katsura M., and Ito M. On a normal form of Petri nets. Acta Cybernetica 12 (1996) 295-308
28. F.L. Ţiplea, D.C. Marinescu, C. Lin, Model checking and abstraction for workflow net verification, in: Proc. First Internat. Workshop on Petri Nets and Coordination PNC04, Bologna, Italy, June 21, 2004.
29. F.L. Ţiplea, A. Ţiplea, On normalization of Petri nets, in: Proc. 11th Romanian Symp. on Computer Science ROSYCS'98, Iasi, Romania, 1998.
30. F.L. Ţiplea, A. Ţiplea, Petri net reactive modules, Technical Report 1999-7, Institut für Informatik, Universität Augsburg, Augsburg, Germany, December 1999, 50pp.
31. F.L. Ţiplea, A. Ţiplea, A simulation preorder for abstraction of reactive systems, in: Third Internat. Workshop VMCAI 2002, Venice, Italy, Lecture Notes in Computer Science, Vol. 2294, 2002, pp. 272-288.
32. F.L. Ţiplea, A. Ţiplea, A compositional semantics for Petri net reactive modules, in: D. Grigoras, A. Nicolau (Eds.), Proc. of the NATO Advanced Research Workshop "Concurrent Information Processing and Computing", CIPC2003, Sinaia (Romania), NATO Science Series "Computer and Systems Sciences", Vol. 195, IOS Press, March 2005.
33. Valette R. Analysis of Petri nets by stepwise refinement. J. Comput. Syst. Sci. 18 (1979) 35-46
34. Valmari A. Compositional analysis with place-bordered subnets. in: Proc. 15th Internat. Conf. on Application and Theory of Petri Nets, Lecture Notes in Computer Science Vol. 815 (1994), Springer, Berlin 531-547
35. Vogler W. Behaviour Preserving Refinements of Petri Nets. Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science Vol. 246 (1987), Springer, Berlin 82-93
36. Vogler W. Modular Construction and Partial Order Semantics of Petri Nets. Lecture Notes in Computer Science Vol. 625 (1992), Springer, Berlin
37. W. Vogler, Efficiency of asynchronous systems, read arcs, and the MUTEX-Problem, in: P. Degano, R. Gorrieri, A. Marchetti-Spaccamela (Eds.), Proc. ICALP'97, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997, pp. 538-548 (full version as Technical Report 352, Institut für Informatik, Universität Augsburg, 1996).