The box algebra = petri nets + process expressions

Information and Computation

Volumn 178, Issue 1, 2002, Pages 44-100

  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

Box algebra; Net based algebraic calculi; Process algebras; Relationships between net theory and other approaches; SOS semantics

Indexed keywords

ALGEBRA; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; SEMANTICS; THEOREM PROVING;

BOX ALGEBRA; PETRI BOX CALCULUS; PROCESS ALGEBRAS; PROCESS EXPRESSIONS;

PETRI NETS;

EID: 0037057829     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)93117-2     Document Type: Article

References (36)

1. Baeten, J., and Weijland, W. P. (1990), "Process Algebra," Cambridge Tracts in Theoretical Computer Science, Vol. 18, Cambridge University Press, Cambridge, UK.
2. Best, E., and Devillers, R. (1988), Sequential and concurrent behaviour in petri net theory, Theoret. Comput. Sci. 55, 87-136.
3. Best, E., Devillers, R., and Esparza, J. (1993), General refinement and recursion operators for the petri box calculus, in "Proc. of STACS'93" (P. Enjalbert, A. Finkel, and K. W. Wagner, Eds.), Lecture Notes in Computer Science, Vol. 665, pp. 130-140, Springer-Verlag, Berlin.
4. Best, E., Devillers, R., and Hall, J. (1992), The petri box calculus: A new causal algebra with multilabel communication, in "Advances in Petri Nets 1992" (G. Rozenberg, Ed.), Lecture Notes in Computer Science, Vol. 609, pp. 21-69, Springer-Verlag, Berlin.
5. Best, E., Devillers, R., and Koutny, M. (1998), Petri nets, process algebras and concurrent programming languages, in "Advances in Petri Nets. Lectures on Petri Nets II: Applications" (W. Reisig and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 1492, pp. 1-84, Springer-Verlag, Berlin.
6. Best, E., Devillers, R., and Koutny, M. (1999), The box algebra-A model of nets and process expressions, in "Proc. of ICATPN'99" (S. Donatelli and J. Kleijn, Eds.), Lecture Notes in Computer Science, Vol. 1639, pp. 344-363, Springer-Verlag, Berlin.
7. Best, E., Devillers, R., and Koutny, M. (2001), "Petri Net Algebra," EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin.
8. Best, E., Devillers, R., and Koutny, M. (2001), Recursion and petri nets, Acta Inform. 37, 781-829.
9. Boudol, G., and Castellani, I. (1994), Flow models of distributed computations: Three equivalent semantics for CCS, Inform. and Comput. 114, 247-314.
10. Brinksma, E. Ed. (1988), "LOTOS-A Formal Description Technique Based on the Temporal Ordering of Observational Behaviour," International Standard ISO 8807-Information Processing Systems-Open Systems Interconnection, Geneva, Switzerland.
11. Degano, P., De Nicola, R., and Montanari, U. (1988), A distributed operational semantics for CCS based on C/E systems, Acta Inform. 26, 59-91.
12. Devillers, R. (1992), Maximality preservation and the ST-idea for action refinements, in "Advances in Petri Nets 1992" (R. Rozenberg, Ed.), Lecture Notes in Computer Science, Vol. 609, pp. 108-151, Springer-Verlag, Berlin.
13. Devillers, R. (1995), S-invariant analysis of general recursive petri boxes, Acta Inform. 32, 313-345.
14. Devillers, R., and Koutny, M. (1998), Recursive nets in the box algebra, in "Proc. of CSD'98," pp. 239-249, IEEE Press, New York.
15. Devillers, R. (2001), A box algebra with mixed unfactorisable operators, in "Proc. of High Performance Computing Symposium HPC 2001, Seattle, WA-Special Track on Petri Nets" (A. Tentner, Ed.), pp. 236-241, The Society for Modelling and Simulation International, San Diego, CA.
16. van Glabbeek, R. J., and Goltz, U. (1989), Refinement of actions in causality based models, in "Proc. of REX School: Workshop on Stepwise Refinement of Distributed Systems" (J. W. de Bakker, W. P. de Roever, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 430, pp. 267-300, Springer-Verlag, Berlin.
17. van Glabbeek, R. J., and Vaandrager, F. V. (1987), Petri net models for algebraic theories of concurrency, in "Proc. of PARLE'87" (J. W. de Bakker, A. J. Nijman, and P. C. Treleaven, Eds.), Lecture Notes in Computer Science, Vol. 259, pp. 224-242, Springer-Verlag, Berlin.
18. Goltz, U. (1988), On representing CCS programs by finite petri nets, in "Proc. of MFCS'88" (M.P. Chytil, L. Janiga, and V. Koubek, Eds.), Lecture Notes in Computer Science, Vol. 324, pp. 339-350, Springer-Verlag, Berlin.
19. Goltz, U., and Loogen, R. (1991), A non-interleaving semantic model for nondeterministic concurrent processes, Fund. menta Inform. 14, 39-73.
20. Gorrieri, R., and Montanari, U. (1995), On the implementation of concurrent calculi in net calculi: Two case studies, Theoret. Comput. Sci. 141 (1/2), 195-252.
21. Hesketh, M., and Koutny, M. (1998), An axiomatisation of duplication equivalence in the petri box calculus, in "Proc. of ICATPN'98" (J. Desel and M. Silva, Eds.), Lecture Notes in Computer Science, Vol. 1420, pp. 165-184, Springer-Verlag, Berlin.
22. Hoare, C. A. R. (1985), "Communicating Sequential Processes," Prentice Hall, New York.
23. Janicki, R., and Lauer, P. E. (1992), "Specification and Analysis of Concurrent Systems-the COSY Approach," EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin.
24. Koutny, M., and Best, E. (1999). Fundamental study: Operational and denotational semantics for the box algebra, Theoret. Comput. Sci. 211, 1-83.
25. Kotov, V. E. (1978), An algebra for parallelism based on petri nets, in "Proc. of MFCS'78" (J. Winkowski, Ed.), Lecture Notes in Computer Science, Vol. 64, pp. 39-54, Springer-Verlag, Berlin.
26. Mazurkiewicz, A. (1987), Trace theory, in "Advances in Petri Nets 1986, Petri Nets: Applications and Relationships to Other Models of Concurrency, Part II" (W. Brauer, W. Reisig, and G. Rozenberg, Eds.), Lecture Notes in Computer Science, Vol. 255, pp. 279-324, Springer-Verlag, Berlin.
27. Milner, R. (1989), "Communication and Concurrency," Prentice Hall, New York.
28. Montanari, U., and Yankelevich, D. (1994), Combining CCS and petri nets via structural axioms, Fund. Inform. 20(1/3), 193-229.
29. Murata, T. (1989), Petri nets: Properties, analysis and applications, Proc. IEEE 77, 541-580.
30. Olderog, E. R. (1991), "Nets, Terms and Formulas," Cambridge Tracts in Theoretical Computer Science, Vol. 23, Cambridge University Press, Cambridge, UK.
31. Plotkin, G. D. (1981), "A Structural Approach to Operational Semantics," Technical Report FN-19, Computer Science Department, University of Aarhus.
32. Reisig, W. (1985), "Petri Nets. An Introduction," EATCS Monographs on Theoretical Computer Science, Springer-Verlag, Berlin.
33. Taubner, D. (1989), "Finite Representation of CCS and TCSP Programs by Automata and Petri Nets," Lecture Notes in Computer Science, Vol. 369, Springer-Verlag, Berlin.
34. Valette, R. (1979), Analysis of petri nets by stepwise refinement, J. Comput. System Sci. 18, 35-46.
35. Vogler, W. (1991), Failures semantics based on interval semiwords is a congruence for refinement, Distrib. Comput. 4, 139-162.
36. Vogler, W. (1991), Bisimulation and action refinement, in "Proc. of STACS'91" (C. Choffrut and M. Jantzen, Eds.), Lecture Notes in Computer Science, Vol. 480, pp. 309-321, Springer-Verlag, Berlin.