An axiomatisation of duplication equivalence in the petri box calculus

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

Volumn 1420, Issue , 1998, Pages 165-184

  Hesketh, Martin ^a,b   Koutny, Maciej ^a  

^a NEWCASTLE UNIVERSITY   (United Kingdom)

^b NORTEL NETWORKS   (Canada)

Author keywords

Analysis of structure of nets; Equivalence and axiomatisation; Net based algebra; Verification using nets

Indexed keywords

ALGEBRA; CALCULATIONS; PETRI NETS; SEMANTICS;

ANALYSIS OF STRUCTURE OF NETS; AXIOMATI-SATION; COMPOSITIONAL SEMANTICS; CONCURRENT SYSTEMS; EQUIVALENCE NOTIONS; SOUND AND COMPLETE; STRUCTURAL SIMILARITY; VERIFICATION USING NETS;

EQUIVALENCE CLASSES;

EID: 22044458663     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-69108-1_10     Document Type: Conference Paper

References (20)

1. J. Baeten and W.P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science (1990).
2. E. Best, R. Devillers and J. Hall: The Petri Box Calculus: a New Causal Algebra with Multilabel Communication. Advances in Petri Nets 1992, G. Rozenberg (ed.). Springer-Verlag, Lecture Notes in Computer Science 609, 21-69 (1992).
3. E. Best, R. Devillers and M. Koutny: Petri Nets, Process Algebras and Concurrent Programming Languages. To appear in Advances in Petri Nets (1998).
4. E. Best and R.P. Hopkins: B(PN)2-a Basic Petri Net Programming Notation. Proc. of PARLE'93, Springer-Verlag, Lecture Notes in Computer Science 694, 379-390 (1993).
5. E. Best and M. Koutny: A Refined View of the Box Algebra. Proc. Petri Net Conference'95, G. De Michelis, M. Diaz (eds). Springer-Verlag, Lecture Notes in Computer Science 935, 1-20 (1995).
6. E. Best and M. Koutny: Solving Recursive Net Equations. Proc. ICALP'95, Z. Fülöp and F. Gécseg (eds). Springer-Verlag, Lecture Notes in Computer Science 944, 605-623 (1995).
7. R. Devillers: S-invariant Analysis of Recursive Petri Boxes. Acta Informatica 32, 313-345 (1995).
8. Devillers, M. Koutny: Recursive Nets in the Box Algebra. To appear in Proc. International Conference on Application of Concurrency to System Design (CSD'98), Fukushima, Japan (1998).
9. U. Goltz: On Representing CCS Programs by Finite Petri Nets. Proc. MFCS'88, Springer-Verlag, Lecture Notes in Computer Science 324, 339-350 (1988).
10. M.B. Hennessy: Algebraic Theory of Processes. The MIT Press (1988).
11. M. Hesketh: On Synthesis of Box Expressions from Petri Boxes. Technical Report TR-552, Department of Computing Science, University of Newcastle upon Tyne (1996).
12. M. Hesketh and M. Koutny: An Axiomatisation of Duplication Equivalence in the Petri Box Calculus. Technical Report TR-585, Department of Computing Science, University of Newcastle upon Tyne (1997).
13. C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall (1985).
14. INMOS: Occam 2 Reference Manual. Prentice-Hall (1988).
15. M. Koutny: Partial Order Semantics of Box Expressions. Proc. Petri Net Conference' 94, R. Valette (ed.), Springer-Verlag, Lecture Notes in Computer Science 815, 318-337 (1994).
16. M. Koutny and E. Best: Operational and Denotational Semantics for the Box Algebra. To appear in Theoretical Computer Science (1998).
17. M. Koutny, J. Esparza and E. Best: Operational Semantics for the Petri Box Calculus. Proc. CONCUR'94, B. Jonsson and J.Parrow (eds), Springer-Verlag, Lecture Notes in Computer Science 836, 210-225 (1994).
18. R. Milner: Communication and Concurrency. Prentice Hall (1989).
19. E.R. Olderog: Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science (1991).
20. W. Reisig: Petri Nets. An Introduction. Springer-Verlag, EATCS Monographs on Theoretical Computer Science (1985).