@INPROCEEDINGS{DBLP:conf/concur/BaldanBG09,
  title = {{Encoding Asynchronous Interactions Using Open Petri Nets}},
  author = {{Paolo} {Baldan} and {Filippo} {Bonchi} and {Fabio} {Gadducci}},
  booktitle = {Concurrency Theory, 20th International Conference, CONCUR 2009, Bologna, Italy, September 1-4, 2009. Proceedings},
  editor = {Mario Bravetti and  Gianluigi Zavattaro},
  pages = {99-114},
  abstract = {We present an encoding for (bound) processes of theasynchronous CCS with replication into open Petri nets: ordinary Petrinets equipped with a distinguished set of open places. The standard token game of nets models the reduction semantics of the calculus; the exchange of tokens on open places models the interactions between processes and their environment. The encoding preserves strong and weak CCS asynchronous bisimilarities: it thus represents a relevant step in establishing a precise correspondence between asynchronous calculi and (open) Petri nets. The work is intended as fostering the technology transfer between these formalisms: as an example, we discuss how some results on expressiveness can be transferred from the calculus to nets and back.},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  volume = {5710},
  year = {2009},
  url = {http://rap.dsi.unifi.it/sensoriasite/concur09.pdf},
  ee = {http://dx.doi.org/10.1007/978-3-642-04081-8},
  institution = {University of Pisa},
  invited = {N},
  isbn = {978-3-642-04080-1},
  keywords = {aynchronous process calculi, Bisimilarity, decidability, Petri nets},
  partner = {PISA},
  school = {University of Pisa},
  status = {public},
  task = {T3.3},
}