Recursive nets in the box algebra

Proceedings - International Conference on Application of Concurrency to System Design, ACSD

Volumn 1998-March, Issue , 1998, Pages 239-249

  Devillers, Raymond ^a   Koutny, Maciej ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

PETRI NETS; SYSTEMS ANALYSIS;

BOX ALGEBRA; CONCURRENT COMPUTATION; INFINITE NUMBERS; ORDERED DOMAINS; PROCESS ALGEBRAS; RECURSIVE EQUATIONS; SUCCESSIVE APPROXIMATIONS; SYSTEM OF EQUATIONS;

ALGEBRA;

EID: 84957711312     PISSN: 15504808     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CSD.1998.657555     Document Type: Conference Paper

References (23)

1. J.Baeten, W.P.Weijland: Process Algebra. Cambridge Tracts in Theoret. Comp. Sci. 18 (1990).
2. E.Best, R.Devillers: Sequential and Concurrent Behaviour in Petri Net Theory. Theoretical Computer Science 55/1, 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. Advances in Petri Nets 1992, G.Rozenberg (ed.), Springer-Verlag, LNCS 609, 21-69 (1992).
5. E.Best, R.Devillers, M.Koutny: Petri Net Algebra (Working Title). Manuscript (1997).
6. E.Best, M.Koutny: Solving Recursive Net Equations. Springer-Verlag, LNCS 944, 605-623 (1995).
7. G.Boudol, I.Castellani: Flow Models of Distributed Computations: Event Structures and Nets. Rapport de Recherche, INRIA, Sophia Antipolis (1991).
8. B.A.Davey, H.A.Priestley: Introduction to Lat- tices and Order. Cambridge Mathematical Textbook (1990).
9. P.Degano, R.De Nicola, U.Montanari: A Distributed Operational Semantics for CCS Based on C/E Systems. Acta Informatica 26, 59-91 (1988).
10. R.Devillers: S-invariant Analysis of Recursive Petri Boxes. Acta Informatica 32, 313-345 (1995).
11. R.Devillers, M.Koutny: A Box Algebra with In- finite Operators (1997).
12. U.Goltz: On Representing CCS Programs by Finite Petri Nets. Springer-Verlag, LNCS 324, 339-350 (1988).
13. U.Goltz, R.Loogen: A Non-interleaving Semantic Model for Nondeterministic Concurrent Processes. Fundamenta Inf. 14/1, 39-73 (1991).
14. C.A.R.Hoare: Communicating Sequential Pro- cesses. Prentice Hall (1985).
15. R.Janicki, P.E.Lauer: Specification and Analy- sis of Concurrent Systems - The COSY Approach. Springer-Verlag, EATCS Monographs on Theoretical Computer Science (1992).
16. M.Koutny, E.Best: Operational and Denotational Semantics for the Box Algebra. To appear in Theoretical Computer Science (1998). Also: Hildesheimer Informatikbericht Nr.33/95 (October 1995).
17. A.Mazurkiewicz: Trace Theory. Advances in Petri Nets 1986, Part II, W.Brauer, W.Reisig, G.Rozenberg (eds.), 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/4, 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 Arhus (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).