The box algebra — A model of nets and process expressions

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

Volumn 1639, Issue , 1999, Pages 344-363

  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; Recursion; Refinement; Relationships between net theory and other approaches; SOS semantics

Indexed keywords

COMPUTATION THEORY; PETRI NETS; SEMANTICS; SYSTEMS ENGINEERING;

BOX ALGEBRA; NET-BASED ALGEBRAIC CALCULI; PROCESS ALGEBRAS; RECURSIONS; REFINEMENT; RELATIONSHIPS BETWEEN NET THEORY AND OTHER APPROACHES; SOS SEMANTICS;

ALGEBRA;

EID: 84958962757     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48745-X_21     Document Type: Conference Paper

References (23)

1. J. Baeten, W.P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18 (1990).
2. E. Best, R. Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science 55:87-136 (1988).
3. E. Best, R. Devillers, J. Esparza: General Refinement and Recursion Operators for the Petri Box Calculus. Springer-Verlag, LNCS 665:130-140 (1993).
4. E. Best, R. Devillers, J.G. Hall: The Petri Box Calculus: a New Causal Algebra with Multilabel Communication. Springer-Verlag, LNCS 609:21-69 (1992).
5. E. Best, R. Devillers, M. Koutny: Petri Nets, Process Algebras and Concurrent Programming Languages. Lectures on Petri Nets II: Applications, Advances in Petri Nets. Springer-Verlag, LNCS 1492:1-84 (1998).
6. E. Best, R. Devillers, M. Koutny: Petri Net Algebra. Book Manuscript (1999).
7. G. Boudol, I. Castellani: Flow Models of Distributed Computations: Event Structures and Nets. Rapport de Recherche, INRIA, Sophia Antipolis (1991).
8. P. Degano, R. De Nicola, U. Montanari: A Distributed Operational Semantics for CCS Based on C/E Systems. Acta Informatica 26:59-91 (1988).
9. R. Devillers: S-invariant Analysis of Recursive Petri Boxes. Acta Informatica 32:313-345 (1995).
10. R. Devillers, M. Koutny: Recursive Nets in the Box Algebra. Proc. of CSD’98 Conference, Fukushima, Japan, IEEE CS, 239-249 (1998).
11. U. Goltz: On Representing CCS Programs by Finite Petri Nets. Springer-Verlag, LNCS 324:339-350 (1988).
12. U. Goltz, R. Loogen: A Non-interleaving Semantic Model for Nondeterministic Concurrent Processes. Fundamenta Informaticae 14:39-73 (1991).
13. M. Hesketh, M. Koutny: An Axiomatisation of Duplication Equivalence in the Petri Box Calculus. Springer-Verlag, LNCS 1420:165-184 (1998).
14. C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall (1985).
15. R. Janicki, P.E. Lauer: Specification and Analysis of Concurrent Systems - the COSY Approach. Springer-Verlag, EATCS Monographs on Theoretical Computer Science (1992).
16. M. Koutny, E. Best: Fundamental Study: Operational and Denotational Semantics for the Box Algebra. Theoretical Computer Science 211:1-83 (1999).
17. A. Mazurkiewicz: Trace Theory. Springer-Verlag, LNCS 255:279-324 (1987).
18. R. Milner: Communication and Concurrency. Prentice Hall (1989).
19. T. Murata: Petri Nets: Properties, Analysis and Applications. Proc. IEEE 77:541-580 (1989).
20. E.-R. Olderog: Nets, Terms and Formulas. Cambridge Tracts in Th. Comp. Sci. 23 (1991).
21. G. Plotkin: A Structural Approach to Operational Semantics. DAIMI Technical Report FN-19, Computer Science Department, University of Aarhus (1981).
22. W. Reisig: Petri Nets. An Introduction. Springer-Verlag, EATCS Monographs on Theoretical Computer Science (1985).
23. D. Taubner: Finite Representation of CCS and TCSP Programs by Automata and Petri Nets. Springer-Verlag, LNCS 369 (1989).