General refinement for high level petri nets

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

Volumn 1346, Issue , 1997, Pages 297-311

  Devillers, Raymond ^a   Klaudel, Hanna ^b   Riemann, Robert C ^c,d  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIVERSITÉ PARIS EST CRÉTEIL   (France)

^c UNIVERSITÉ PARIS SACLAY   (France)

^d UNIVERSITY OF HILDESHEIM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; PARALLEL PROGRAMMING; PETRI NETS; SOFTWARE ENGINEERING;

HIGH-LEVEL PETRI NETS; PETRI BOX; PROCEDURE CALL; REFINEMENT OPERATORS;

HIGH LEVEL LANGUAGES;

EID: 84949228380     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0058038     Document Type: Conference Paper

References (19)

1. E. Best, R. Devillers, and J. Esparza. General Refinement and Recursion for the Box Calculus. STACS’93. Springer, LNCS Vol. 665, 130-140 (1993).
2. E. Best, R. Devillers, and J.G. Hall. The Box Calculus: a New Caused Algebra with Multilabel Communication. Advances in Petri Nets 92. Springer, LNCS Vol. 609, 21-69 (1992).
3. E. Best, H. Fleischhack, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. A Class of Composable High Level Petri Nets. Application and Theory of Petri Nets 1995. Springer, LNCS Vol. 935, 103-120 (1995).
4. 2. Structures in Concurrency Theory: STRICT’95 Proceedings. Springer, 85-100 (1995).
5. E. Best, W. Fraczak, R.P. Hopkins, H. Klaudel, and E. Pelz. M-nets: an Algebra of High Level Petri Nets, with an Application to the Semantics of Concurrent Programming Languages. To appear in Acta Informatica.
6. 2 - a Basic Petri Net Programming Notation. Proceedings of PARLE’93. Springer, LNCS Vol. 694, 379-390 (1993).
7. E. Best and M. Koutny. A Refined View of the Box Algebra. Application and Theory of Petri Nets 1995. Springer, LNCS Vol. 935, 1-20 (1995).
8. E. Best and M. Koutny. Solving Recursive Net Equations. Automata, Languages and Programming 1995. Springer, LNCS Vol. 944, 605-623 (1995).
9. R. Devillers. The Synchronisation Operator Revisited for the Petri Box Calculus. Technical Report LIT-290, Université Libre de Bruxelles (1994).
10. R. Devillers. S-Invariant Analysis of General Recursive Petri Boxes. Acta Informatica, Vol. 32, 313-345 (1995).
11. R. Devillers and H. Klaudel. Refinement and Recursion in a High Level Petri Box Calculus. Structures in Concurrency Theory: STRICT’95 Proceedings. Springer, 144-159 (1995).
12. R. Devillers, H. Klaudel and R.-C. Riemann. General Refinement in the M-net Calculus. Technical Report LIT-357, Université Libre de Bruxelles (1997).
13. 2 with Procedures. Parallel and Distributed Software Engineering, Boston Ma., 1997.
14. H. Genrich. Predicate-Transition Nets. In Petri Nets: Central Models and their Properties, Advances in Petri Nets 1986 Part I. Springer, LNCS Vol. 254, 207-247 (1987).
15. R. J. van Glabbeek and U. Goltz. Refinement of Actions in Causality Based Models. Stepwise Refinement of Distributed Systems. Springer, LNCS Vol. 430, 267-300 (1989).
16. K. Jensen. Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. EATCS Monographs on Theoretical Computer Science, Vol. 1. Springer (1992).
17. H. Klaudel. Modèles algébriques, basés sur les réseaux de Petri, pour la sémantique des langages de programmation concurrents. PhD Thesis, Université Paris XI Orsay (1995).
18. H. Klaudel and E. Pelz. Communication as Unification in the Petri Box Calculus. Fundamentals of Computation Theory. Springer, LNCS Vol. 965, 303-312 (1995).
19. 2 with Procedures. In ISCIS XI, Vol. I, 365-374, Antalya, November 1996. Middle East Technical University.