Language representability of finite place/transition Petri nets

Aranda, J., Valencia, F., Versari, C.: On the expressive power of restriction and priorities in CCS with replication. In: Proceedings of the FOSSACS 2009. LNCS, vol. 5504, pp. 242–256. Springer, New York (2009)

Baeten, J.C.M., Basten, T., Reniers, M.A.: Process algebra: equational theories of communicating processes. In: Cambridge Tracts in Theoretical Computer Science, vol. 50. Cambridge University Press, Cambridge (2010)

Baldan, P., Bonchi, F., Gadducci, F., Monreale, G.: Encoding synchronous interactions using labelled Petri nets. In: Proceedings of the Coordination’14. LNCS, vol. 8459, pp. 1–16. Springer, New York (2014)

Best, E., Devillers, R., Koutny, M.: The box algebra $$=$$ = Petri nets $$+$$ + process expressions. Inf. Comput. 178(1), 44–100 (2002)

Busi, N., Gorrieri, R.: Distributed semantics for the $$\pi $$ π -calculus based on Petri nets with inhibitor arcs. J. Logic Algebraic Program. 78(3), 138–162 (2009)

Courtois, P., Heymans, F., Parnas, D.: Concurrent control with readers and writers. Commun. ACM 14(10), 667–668 (1971)

Desel, J., Reisig, W.: Place/Transition Petri Nets. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. LectureNotes in Computer Science, vol. 1491, pp. 122–173. Springer, New York (1998)

Degano, P., De Nicola, R., Montanari, U.: A distributed operational semantics for CCS based on C/E systems. Acta Inform. 26(1–2), 59–91 (1988)

Degano, P., De Nicola, R., Montanari, U.: Partial ordering descriptions and observations of nondeterministic concurrent systems. In: Lecture Notes in Computer Science, vol. 354, pp. 438–466. Springer, New York (1989)

Degano, P., Gorrieri, R., Marchetti, S.: An exercise in concurrency: a CSP process as a condition/event system. Adv. Petri Nets (LNCS, Springer) 340, 85–105 (1988)

Degano, P., Meseguer, J., Montanari, U.: Axiomatizing the algebra of net computations and processes. Acta Inform. 33(7), 641–667 (1996)

Esparza, J.: Decidability and complexity of Petri net problems: an introduction. In: Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. LectureNotes in Computer Science, vol. 1491, pp. 374–428. Springer, New York (1998)

Goltz, U.: On representing CCS programs by finite Petri nets. In: Proceedings of the MFCS’88. LNCS, vol. 324, pp. 339–350. Springer, New York (1988)

Gorrieri, R.: Language representability of finite P/T nets. In:Programming Languages with Applications to Biology and Security—Colloquium in Honour of Pierpaolo Degano for His 65th Birthday, (PLABS 2015). LNCS, vol. 9465. Springer, New York (2015) (being printed)

Gorrieri, R., Montanari, U.: SCONE: a simple calculus of nets. In: Proceedings of the CONCUR’90. LNCS, vol. 458, pp. 2–30. Springer, New York (1990)

Gorrieri, R., Montanari, U.: Towards hierarchical specification of systems: a proof system for strong prefixing. Int. J. Found. Comput. Sci. 1(3), 277–293 (1990)

Gorrieri, R., Marchetti, S., Montanari, U.: A $$^2$$ 2 CCS: atomic actions for CCS. Theor. Comput. Sci. 72(2–3), 203–223 (1990)

Gorrieri, R., Versari, C.: A process calculus for expressing finite place/transition Petri nets. In: Proceedings of the EXPRESS’10, EPTCS, 2010. doi: 10.4204/EPTCS.41.6 . arXiv:1011.6433v1

Gorrieri, R., Versari, C.: EATCS Text in Computer Science. Introduction to concurrency theory: transition systems and CCS. Springer, New York (2015)

Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, New York (1985)

Janc̆ar, P.: Undecidability of bisimilarity for Petri nets and some related problems. Theor. Comput. Sci. 148(2), 281–301 (1995)

Mayr, R.: Process rewrite systems. Inf. Comput. 156(1–2), 264–286 (2000)

Meyer, R.: A theory of structural stationarity in the $$\pi $$ π -calculus. Acta Inform. 46(2), 87–137 (2009)

Meyer, R., Gorrieri, R.: On the relationship between pi-calculus and finite place/transition Petri nets. In: Proceedings of the CONCUR 2009. LNCS, vol. 5710, pp. 463–480. Springer, New York (2009)

Milner, R.: Communication and Concurrency. Prentice-Hall, New York (1989)

Milner, R.: Communicating and Mobile Systems: The $$\pi $$ π -Calculus. Cambridge University Press, Cambridge (1999)

Nielsen, M., Thiagarajan, P.S.: Degrees of non-determinism and concurrency: a Petri net view. In: Proceedings of the Fourth Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS’84). LNCS, vol. 181, pp. 89–117. Springer, New York (1984)

Olderog, E.R.: Nets, terms and formulas. In: Cambridge Tracts in Theoretical Computer Science, vol. 23. Cambridge University Press, Cambridge (1991)

Pomello, L., Rozenberg, G., Simone, C.: A survey of equivalence notions for net based systems. Lect. Notes Comput. Sci. 609, 410–472 (1992)

Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice-Hall, New York (1981)

Reisig, W.: EATCS Monographs on TCS. Petri Nets: An Introduction. Springer, New York (1985)

Reisig, W., Rozenberg, G. (eds.) Lectures on Petri Nets I: Basic Models. Lecture Notes in Computer Science, vol. 1491. Springer, New York (1998)

Taubner, D.: Finite representations of CCS and TCSP programs by automata and Petri nets. In: Lecture notes in computer science, vol. 369. Springer, New York (1989)