Recursion and Petri nets

Acta Informatica

Volumn 37, Issue 11-12, 2001, Pages 781-829

  Best, Eike ^a   Devillers, Raymond ^b   Koutny, Maciej ^c  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035429760     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00013309     Document Type: Article

References (28)

1. 1. J. Baeten, W.P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press 1990
2. 2. E. Best, R. Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. Theor Comput Sci 55, 87-136 (1988)
3. 3. E. Best, R. Devillers, J. Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. In: P. Enjalbert, A. Finkel, K.W. Wagner (Eds.) Proc. of STACS 93, 10th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science 665, pp 130-140, Berlin Heidelberg New York: Springer 1993
4. 4. E. Best, R. Devillers, J. Hall: The Petri Box Calculus: a New Causal Algebra with Multilabel Communication. In: G. Rozenberg (Ed.) Advances in Petri Nets 1992. Lecture Notes in Computer Science 609, pp 21-69, Berlin Heidelberg New York: Springer 1992
5. 5. E. Best, R. Devillers, M. Koutny: The Box Algebra - a Model of Nets and Process Expressions. In: S. Donatelli, J. Kleijn. Lecture Notes in Computer Science 1639, pp 344-363, Berlin Heidelberg New York: Springer 1999
6. 6. E. Best, R. Devillers, M. Koutny: Petri Nets, Process Algebras and Concurrent Programming Languages. In: W. Reisig, G. Rozenberg (Eds.) Advances in Petri Nets. Lectures on Petri Nets II: Applications, Lecture Notes in Computer Science 1492, pp 1-84, Berlin Heidelberg New York: Springer 1998
7. 7. E. Best, R. Devillers, M. Koutny: Petri Net Algebra. EATCS Monographs on Theoretical Computer Science, Berlin Heidelberg New York: Springer 2001
8. 8. E. Best, R. Devillers, M. Koutny: The Box Algebra = Petri Nets + Process Expressions. To appear in Information and Computation (2001)
9. 9. E. Best, M. Koutny: Solving Recursive Net Equations. In: Z. Fulöp, F. Gecseg (Eds.) Proc. of Automata, Languages and Programming, 22nd International Colloquium, ICALP 95, Lecture Notes in Computer Science 944, pp 605-623, Berlin Heidelberg New York: Springer 1995
10. 10. G. Boudol, I. Castellani: Flow Models of Distributed Computations: Three Equivalent Semantics for CCS. Information and Computation 114, 247-314 (1994)
11. 11. S.D. Brookes: The Essence of Parallel Algol. Proc. of LICS'96, pp 164-173. IEEE Computer Society Press 1996
12. 12. P. Degano, R. De Nicola, U. Montanari: A Distributed Operational Semantics for CCS Based on C/E Systems. Acta Inf 26, 59-91 (1988)
13. 13. B.A. Davey, H.A. Priestley: Introduction to Lattices and Order. Cambridge Mathematical Textbook 1990
14. 14. R. Devillers: S-invariant Analysis of General Recursive Petri Boxes. Acta Inf 32, 313-345 (1995)
15. 15. R. Devillers, M. Koutny: Recursive Nets in the Box Algebra. Proc. of CSD'98: International Conference on Application of Concurrency to System Design, IEEE Press, pp. 239-249, 1998
16. 16. U. Goltz: On Representing CCS Programs by Finite Petri Nets. In: M.P. Chytil, L. Janiga, V. Koubek (Eds.) Proc. of MFCS'88, Lecture Notes in Computer Science 324, pp 339-350, Berlin Heidelberg New York: Springer 1988
17. 17. U. Goltz, R. Loogen: A Non-interleaving Semantic Model for Nondeterministic Concurrent Processes. Fundam Inform 14, 39-73 (1991)
18. 18. C.A.R. Hoare: Communicating Sequential Processes. Englewood Cliffs, NJ: Prentice Hall 1985
19. 19. R. Janicki, P.E. Lauer: Specification and Analysis of Concurrent Systems - the COSY Approach. EATCS Monographs on Theoretical Computer Science, Berlin Heidelberg New York: Springer 1992
20. 20. M. Koutny, E. Best: Fundamental Study: Operational and Denotational Semantics for the Box Algebra. Theor Comput Sci 211, 1-83 (1999)
21. 21. A. Levy: Basic Set Theory. Berlin Heidelberg New York: Springer 1979
22. 22. R. Milner: Communication and Concurrency. Englewood Cliffs, NJ: Prentice Hall 1989
23. 23. U. Montanari, D. Yankelevich: Combining CCS and Petri Nets via Structural Axioms. Fundam Inform 20(1 -3), 193-229 (1994)
24. 24. T. Murata: Petri Nets: Properties, Analysis and Applications. Proc. of IEEE 77, pp 541-580, 1989
25. 25. E.R. Olderog: Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science 23, Cambridge University Press 1991
26. 26. G.D. Plotkin: A Structural Approach to Operational Semantics. FN-19, Computer Science Department, University of Aarhus 1981
27. 27. W. Reisig: Petri Nets. An Introduction. EATCS Monographs on Theoretical Computer Science, Berlin Heidelberg New York: Springer 1985
28. 28. D. Taubner: Finite Representation of CCS and TCSP Programs by Automata and Petri Nets. Lecture Notes in Computer Science 369, Berlin Heidelberg New York: Springer 1989