Transition systems, link graphs and Petri nets

Mathematical Structures in Computer Science

Volumn 16, Issue 6, 2006, Pages 989-1047

  Leifer, James J ^a   Milner, Robin ^b  

^a INRIA   (France)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33845599006     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129506005664     Document Type: Article

References (65)

1. Abramsky, S. and Ong, C.-H. L. (1993) Full abstraction in the lazy lambda calculus. Information and Computation 105 (2) 159-267.
2. Baldan, P., Corradini, A., Ehrig, H. and Heckel, R. (2001) Compositional modeling of reactive systems using open nets. Proc. CONCUR 2001, 12th International Conference on Concurrency theory. Springer-Verlag Lecture Notes in Computer Science 2154 502-518.
3. Bergstra, J. A. and Klop, J. W. (1985) Algebra for communicating processes with abstraction. Theoretical Computer Science 37 77-121.
4. Bernstein, K. (1998) A congruence theorem for structured operational semantics of higher-order languages. Proc. LICS'98, 13th Annual IEEE Symposium on Logic in Computer Science 153-164.
5. Berry, G. and Boudol, G. (1992) The chemical abstract machine. Theoretical Computer Science 96 217-248.
6. Best, E., Devillers, R. and Hall, J.G. (1999) The box algebra: a model of nets and process expressions. 20th International Conference on Application and Theory of Petri Nets. Springer-Verlag Lecture Notes in Computer Science 1639 344-363.
7. Boudol, G. (1992) Asynchrony and the π -calculus. Rapport de Recherche RR-1702, INRIA Sophia Antipolis.
8. Brookes, S.D., Hoare, C.A.R. and Roscoe, A.W. (1984) A theory of communicating sequential processes. J. ACM 31 560-599.
9. Bruni, R., Gadducci, F. and Montanari, U. (2002) Normal forms for algebras of connections. Theoretical Computer Science 286 (2) 247-292.
10. Bruni, R., Montanari, U. and Rossi, F. (2001) An interactive semantics of logic programming. Theory and Practice of Logic Programming 1 (6) 647-690.
11. Bruni, R., Montanari, U. and Sassone, V. (2005) Observational congruences for dynamically reconfigurable tile systems. Theoretical Computer Science 335 (2-3) 331-372.
12. Cardelli, L. (2004) Bioware languages. In: Computer Systems: Theory, Technology, and Applications - A Tribute to Roger Needham, Springer-Verlag 59-65.
13. Caires, L. and Cardelli, L. (2001) A spatial logic for concurrency (Part I). Proc. 4th International Symposium on Theoretical Aspects of Computer Software. Springer-Verlag Lecture Notes in Computer Science 2215 1-37.
14. Caires, L. (2004) Behavioural and spatial observations in a logic for the π -calculus. Proc. FOSSACS 2004. Springer-Verlag Lecture Notes in Computer Science 2987 72-89.
15. Cardelli, L. and Gordon, A. D. (2000) Mobile ambients. Foundations of System Specification and Computational Structures. Springer-Verlag Lecture Notes in Computer Science 1378 140-155.
16. Castellani, I. (2001) Process algebras with localities. In: Handbook of Process Algebra, Elsevier 947-1045.
17. Cattani, G. L., Leifer, J. J. and Milner, R. (2002) Contexts and embeddings for closed shallow action graphs. Formal Aspects of Computing 13 (3-5).
18. Drewes, F., Hoffmann, B. and Plump, D. (2000) Hierarchical graph transformation. In: Foundations of Software Science and Computation Structures. Springer-Verlag Lecture Notes in Computer Science 1784.
19. Ehrig, H. (1979) Introduction to the theory of graph grammars. Graph Grammars and their Application to Computer Science and Biology. Springer-Verlag Lecture Notes in Computer Science 73 1-69.
20. Ehrig, H. (2002) Bigraphs meet double pushouts. EATCS Bulletin 78 72-85.
21. Ehrig, H. and König, B. (2004) Deriving bisimulation congruences in the DPO approach to graph-rewriting. Proc. FOSSACS 2004. Springer-Verlag Lecture Notes in Computer Science 2987 151-156.
22. Fournet, C. and Gonthier, G. (1996) The reflexive Cham and the join calculus. Proc. 23rd Annual ACM Symposium on Principles of Programming Languages, Florida 372-385.
23. Gadducci, F., Heckel, R. and Llabrés Segura, M. (1999) A bi-categorical axiomatisation of concurrent graph rewriting. Proc. 8th Conference on Category Theory in Computer Science (CTCS'99). Electronic Notes in Theoretical Computer Science 29.
24. Gadducci, F. and Montanari, U. (2000) The tile model. In: Plotkin, G., Stirling, C. and Tofte, M. (eds.) Proof, Language and Interaction: Essays in Honour of Robin Milner, MIT Press 133-166. (Also Technical Report TR-27/96, Dipartimento di Informatica, Università di Pisa, 1996).
25. Gardner, P.A. (2000) From process calculi to process frameworks. Proc. CONCUR 2000, 11th International Conference on Concurrency Theory 69-88.
26. Gardner, P.A. and Wischik, L. (2000) Explicit fusions. Proc. MFCS 2000. Springer-Verlag Lecture Notes in Computer Science 1893 373-383.
27. Groote, J. F. and Vaandrager, F. W. (1992) Structural operational semantics and bisimulation as a congruence. Information and Computation 100 (2) 202-260.
28. Hasegawa, M. (1999) Models of sharing graphs (a categorical semantics of let and letrec), Ph.D. Dissertation, Division of Informatics, Edinburgh University. (Also available as Technical Report ECS-LFCS-97-360, and in Springer Series of Distinguished Dissertations in Computer Science.)
29. Hirsch, D. and Montanari, U. (2001) Synchronised hyperedge replacement with name mobility. Proc. 12th International Conference on Concurrency Theory (CONCUR 2001). Springer-Verlag Lecture Notes in Computer Science 2154 121-136.
30. Hoare, C. A. R. (1985) Communicating Sequential Processes, Prentice Hall.
31. Honda, K. and Tokoro, M. (1991) An object calculus for asynchronous communications. ECOOP'91, Workshop on Object-based Concurrent Programming. Springer-Verlag Lecture Notes in Computer Science 512.
32. Jeffrey, A. and Rathke, J. (1999) Towards a theory of bisimulation for local names. Proc. LICS 1999, IEEE Press 56-66.
33. Jensen, O.H. (2006) Forthcoming Ph.D. Dissertation.
34. Jensen, O.H. and Milner, R. (2003) Bigraphs and transitions. Proc. 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages.
35. Jensen, O. H. and Milner, R. (2004) Bigraphs and mobile processes (revised). Technical Report 580, University of Cambridge Computer Laboratory. Available from http://www.cl.cam.ac.uk/users/rm135.
36. Lafont, Y. (1990) Interaction nets. Proc. 17th ACM Symposium on Principles of Programming Languages (POPL'90) 95-108.
37. Lawvere, F. W. (1963) Functorial semantics of algebraic theories, Ph.D. Dissertation, Columbia University. (Announcement in Proc. Nat. Acad. Sci. 50 869-873.)
38. Leifer, J.J. (2001) Operational congruences for reactive systems, Ph.D. Dissertation, University of Cambridge Computer Laboratory. (Distributed in revised form as Technical Report 521, University of Cambridge. Available from http://pauillac.inria.fr/~leifer.)
39. Leifer, J.J. and Milner, R. (2000) Deriving bisimulation congruences for reactive systems. Proc. CONCUR 2000, 11th International Conference on Concurrency theory 243-258. (Available at http://pauillac.inria.fr/~leifer.)
40. Merro, M. and Hennessy, M. (2002) Bisimulation congruences in safe ambients. Proc. 29th International Symposium on Principles of Programming Languages, Oregon 71-80.
41. Milner, R. (1980) A Calculus of Communicating Systems. Springer-Verlag Lecture Notes in Computer Science 92.
42. Milner, R. (1996) Calculi for interaction. Acta Informatica 33 707-737.
43. Milner, R. (2001a) Computational flux. Proc. 28th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages 220-221.
44. Milner, R. (2001b) Bigraphical reactive systems: basic theory. Technical Report 503, University of Cambridge Computer Laboratory. (Available from http://www.cl.cam.ac.uk/users/rm135.)
45. Milner, R. (2001c) Bigraphical reactive systems. Proc. 12th International Conference on Concurrency Theory. Springer-Verlag Lecture Notes in Computer Science 2154 16-35.
46. Milner, R. (2004a) Bigraphs for Petri nets. Proc. Advanced Course on Petri Nets, Eichstätt 2003. Springer-Verlag Lecture Notes in Computer Science 3098.
47. Milner, R. (2004b) Axioms for bigraphical structure. Technical Report 581, University of Cambridge Computer Laboratory. (To appear in Mathematical Structures in Computer Science.)
48. Milner, R. (2005) Pure bigraphs. Technical Report 614, University of Cambridge Computer Laboratory.
49. Milner, R., Parrow, J. and Walker, D. (1992) A calculus of mobile processes, Parts I and II. Information and Computation 100 1-77.
50. Montanari, U. and Sassone, V. (1992) Dynamic congruence vs. progressing bisimulation for CCS. Fundamenta Informaticae 16 171-196.
51. Nielsen, M., Priese, L. and Sassone, V. (1995) Characterizing behavioural congruences for Petri nets. Proc. CONCUR'95. Springer-Verlag Lecture Notes in Computer Science 962 175-189.
52. Park, D. M.R. (1980) Concurrency and automata on infinite sequences. Springer-Verlag Lecture Notes in Computer Science 104.
53. Pomello, L., Rozenberg, G. and Simone, C. (1992) A survey of equivalence notions for net-based systems. In: Advances in Petri Nets '92. Springer-Verlag Lecture Notes in Computer Science 609 410-472.
54. Priese, L. and Wimmel, H. (1998) A uniform approach to true-concurrency and interleaving semantics for Petri nets. Theoretical Computer Science 206 219-206.
55. Parrow, J. and Victor, B. (1998) The fusion calculus: expressiveness and symmetry in mobile processes. Proc. LICS'98, IEEE Computer Society Press.
56. Priami, C. (1995) Stochastic π-calculus. Computer Journal 38 (7) 578-589.
57. Priami, C., Regev, A., Silverman, W. and Shapiro, E. (2001) Application of stochastic process algebras to bioinformatics of molecular processes. Information Processing Letters 80 25-31.
58. Rounds, W.H. and Song, H. (2003) The Φ-calculus - a language for distributed control of reconfigurable embedded systems. In: Hybrid Systems: Computation and control. Springer-Verlag Lecture Notes in Computer Science 2263 435-449.
59. Sassone, V. and Sobocinski, P. (2002) Deriving bisimulation congruences : a 2-categorical approach. Electronic Notes in Theoretical Computer Science 68 (2).
60. Sassone, V. and Sobocinski, P. (2004) Congruences for contextual graph-rewriting. BRICS Technical Report RS-04-11.
61. Sewell, P. (1998) From rewrite rules to bisimulation congruences. Proc CONCUR'98. Springer-Verlag Lecture Notes in Computer Science 1466 269-284.
62. (Full version in Theoretical Computer Science 272 (1-2).)
63. Regev, A., Silverman, W. and Shapiro, E. (2001) Representation and simulation of biochemical processes using the π-calculus process algebra. Proc. Pacific Symposium of Biocomputing 2001 (PSB2001)6 459-470.
64. Smith, H. and Fingar, P. (2002) Business Process Management: the third wave, Meghan-Kiffer Press.
65. Wojciechowski, P.T. and Sewell, P. (1999) Nomadic Pict: language and infrastructure design for mobile agents. Proc. ASA/MA '99, Palm Springs, California.