Process algebra: A Petri-net-oriented tutorial

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

Volumn 3098, Issue , 2004, Pages 180-209

  Best, Eike ^a   Koutny, Maciej ^b  

^a UNIVERSITY OF OLDENBURG   (Germany)

^b NEWCASTLE UNIVERSITY   (United Kingdom)

Author keywords

Petri nets; Process algebras

Indexed keywords

PETRI NETS;

CONCURRENT PROCESS; PROCESS ALGEBRAS;

ALGEBRA;

EID: 34548481877     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27755-2_5     Document Type: Article

References (33)

1. L. Aceto, W.J. Fokkink, C. Verhoef: Structured operational semantics. In [4], 197-292.
2. J.C.M. Baeten, C.A. Middelburg: Process algebra with timing: Real time and discrete time. In [4], 627-684.
3. J.C.M. Baeten, W.P. Weijland: Process Algebra. Cambridge Tracts in Theoretical Computer Science 18, Cambridge University Press, 1990.
4. J.A. Bergstra, A. Ponse, S.A. Smolka (eds): Handbook of Process Algebra. Elsevier Science B.V., Amsterdam, 2001.
5. E. Best: Semantics of Sequential and Parallel Programs. Prentice Hall, 1996.
6. E. Best, R. Devillers, M. Koutny: Petri Net Algebra. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 2001.
7. G. Boudol, I. Castellani: Flow models of distributed computations: Three equivalent semantics for CCS. Information and Computation 114(2), 247-314, 1994.
8. R.H. Campbell, A.N. Habermann: The specification of process synchronization by path expressions. Symposium on Operating Systems, 89-102, 1974.
9. I. Castellani: Process algebras with localities. In [4], 945-1045.
10. S. Christensen, Y. Hirshfeld, F. Moller: Bisimulation is decidable for basic parallel processes. Proc. of CONCUR'93, Lecture Notes in Computer Science 715, Springer-Verlag, 143-157, 1993.
11. P. Degano, R. De Nicola, U. Montanari: A partial ordering semantics for CCS. Theoretical Computer Science 75(3), 223-262, 1990.
12. E.W. Dijkstra: A Discipline of Programming. Prentice Hall, 1976.
13. J. Esparza: Model checking using net unfoldings. Science of Computer Programming 23, 151-195, 1994.
14. R. van Clabbeek: The linear time - branching time spectrum I. In [4], 3-99.
15. R. van Glabbeek, U. Goltz: Refinement of actions in causality based models. REX Workshop on Stepwise Refinement of Distributed Systems: Models, Formalism, Correctness. Lecture Notes in Computer Science 430, Springer-Verlag, 267-300, 1990.
16. R. van Glabbeek, F.W. Vaandrager: Petri net models for algebraic theories of concurrency. Proc. of PARLE, Parallel Architectures and Languages, Vol. II, Lecture Notes in Computer Science 259, Springer-Verlag, 224-242, 1987.
17. U. Goltz: Über die Darstellung von CCS-Programmen durch Petrinetze. Dissertation, Gesellschaft für Mathematik und Datenverarbeitung, 1988.
18. G.A.R. Hoare: Communicating sequential processes. Comm. of the ACM 21, 666-677, 1978.
19. C.A.R. Hoare: Communicating Sequential Processes. Prentice Hall, 1985.
20. R. Janicki and P.E. Lauer: Specification and Analysis of Concurrent Systems - the COSY Approach. EATCS Monographs on Theoretical Computer Science, Springer-Verlag, 1992.
21. R. Keller: Formal verification of parallel programs. Comm. of the ACM 19, 371-384, 1976.
22. V. Khomenko, M. Koutny, W. Vogler: Canonical prefixes of Petri net unfoldings. Acta Informatica 40, 95-118, 2003.
23. H. Klaudel, F. Pommereau. M-nets: a survey. Manuscript, 2003 (submitted).
24. R. Milner: A Calculus of Communicating Systems. Lecture Notes in Computer Science 92, Springer-Verlag, 1980.
25. R. Milner: Communication and Concurrency. Prentice Hall, 1989.
26. E.R. Olderog: Nets, Terms and Formulas. Cambridge Tracts in Theoretical Computer Science 23, Cambridge University Press, 1991.
27. D. Park: Concurrency and automata on infinite sequences. Proc. 5th GI Conference, Karlsruhe, Lecture Notes in Computer Science 104, Springer-Verlag, 167-183, 1981.
28. G.D. Plotkin: A structural approach to operational semantics. Report FN-19, Computer Science Department, University of Aarhus, 1981.
29. L. Priese, H. Wimmel: Petri-Netze. Springer-Verlag, Theoretische Informatik, 2003.
30. P. Sewell: Nonaxiomatisability of equivalences over finite state processes. Annals of Pure and Applied Logic, 90(1-3), 163-191, 1997.
31. Ch. Stehno: Real-time systems design with PEP. Proc. TACAS'02, Lecture Notes in Computer Science 2280, Springer-Verlag, 476-480, 2002.
32. D. Taubner: Finite Representation of CCS and TCSP Programs by Automata and Petri Nets. Lecture Notes in Computer Science 369, Springer-Verlag, 1989.
33. G. Winskel: Petri nets, algebras, morphisms and compositionality. Information and Control 72, 197-238, 1987.