Encoding Asynchronous Interactions Using Open Petri Nets

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

Volumn 5710 LNCS, Issue , 2009, Pages 99-114

  Baldan, Paolo ^a   Bonchi, Filippo ^b,c   Gadducci, Fabio ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b CWI   (Netherlands)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

Asynchronous calculi; Bisimilarity; Decidability; Open Petri nets

Indexed keywords

BIOMINERALIZATION; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTABILITY AND DECIDABILITY; ENCODING (SYMBOLS); GAME THEORY; GRAPH THEORY; PATHOLOGY; TECHNOLOGICAL FORECASTING; TECHNOLOGY TRANSFER;

ASYNCHRONOUS CALCULI; ASYNCHRONOUS INTERACTION; BISIMILARITY; DECIDABILITY; OPEN PETRI NETS; ORDINARY PETRI NET; REDUCTION SEMANTICS;

PETRI NETS;

EID: 70349873543     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-04081-8_8     Document Type: Conference Paper

References (40)

1. Honda, K., Tokoro, M.: An object calculus for asynchronous communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol.512, pp. 133-147. Springer, Heidelberg (1991)
2. Boudol, G.: Asynchrony and the d-calculus. Technical Report 1702, INRIA, Sophia Antipolis (1992)
3. De Nicola, R., Ferrari, G., Pugliese, R.: KLAIM: A kernel language for agents interaction and mobility. IEEE Trans. Software Eng. 24(5), 315-330 (1998)
4. Castellani, I., Hennessy, M.: Testing theories for asynchronous languages. In: Arvind, V., Sarukkai, S. (eds.) FST TCS 1998. LNCS, vol.1530, pp. 90-102. Springer, Heidelberg (1998)
5. Ferrari, G., Guanciale, R., Strollo, D.: Event based service coordination over dynamic and heterogeneous networks. In: Dan, A., Lamersdorf, W. (eds.) ICSOC 2006. LNCS, vol.4294, pp. 453-458. Springer, Heidelberg (2006)
6. Amadio, R., Castellani, I., Sangiorgi, D.: On bisimulations for the asynchronous pi-calculus. TCS 195(2), 291-324 (1998)
7. Boreale, M., De Nicola, R., Pugliese, R.: Asynchronous observations of processes. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol.1378, pp. 95-109. Springer, Heidelberg (1998)
8. Boreale, M., De Nicola, R., Pugliese, R.: A theory of "may" testing for asynchronous languages. In: Thomas, W. (ed.) FOSSACS 1999. LNCS, vol.1578, pp. 165-179. Springer, Heidelberg (1999)
9. Rathke, J., Sobocinski, P.: Making the unobservable, unobservable. In: ICE 2008. ENTCS. Elsevier, Amsterdam (2009) (to appear)
10. Reisig, W.: Petri Nets: An Introduction. EATCS Monographs on Theoretical Computer Science. Springer, Heidelberg (1985)
11. van der Aalst, W.: Pi calculus versus Petri nets: Let us eat "humble pie" rather than further in.ate the "Pi hype". BPTrends 3(5), 1-11 (2005)
12. Goltz, U.: CCS and Petri nets. In: Guessarian, I. (ed.) LITP 1990. LNCS, vol.469, pp. 334-357. Springer, Heidelberg (1990)
13. Gorrieri, R., Montanari, U.: SCONE: A simple calculus of nets. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.458, pp. 2-31. Springer, Heidelberg (1990)
14. Busi, N., Gorrieri, R.: A Petri net semantics for pi-calculus. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.962, pp. 145-159. Springer, Heidelberg (1995)
15. Devillers, R., Klaudel, H., Koutny, M.: A compositional Petri net translation of general pi-calculus terms. Formal Asp. Comput. 20(4-5), 429-450 (2008)
16. Aranda, J., Valencia, F., Versari, C.: On the expressive power of restriction and priorities in CCS with replication. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.5504, pp. 242-256. Springer, Heidelberg (2009)
17. Olderog, E.: Nets, terms and formulas. Cambridge University Press, Cambridge (1991)
18. Busi, N., Gorrieri, R.: Distributed semantics for the d-calculus based on Petri nets with inhibitor arcs. Journal of Logic and Algebraic Programming 78, 138-162 (2009)
19. Berry, G., Boudol, G.: The chemical abstract machine. TCS 96, 217-248 (1992)
20. Milner, R., Sangiorgi, D.: Barbed bisimulation. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.623, pp. 685-695. Springer, Heidelberg (1992)
21. Baldan, P., Corradini, A., Ehrig, H., Heckel, R.: Compositional semantics for open Petri nets based on deterministic processes. Mathematical Structures in Computer Science 15(1), 1-35 (2004) (Pubitemid 44707043)
22. Milner, R.: Bigraphs for Petri nets. In: Desel, J., Reisig, W., Rozenberg, G. (eds.) Lectures on Concurrency and Petri Nets. LNCS, vol.3098, pp. 686-701. Springer, Heidelberg (2004)
23. Sassone, V., Sobocinski, P.: A congruence for Petri nets. In: Ehrig, H., Padberg, J., Rozenberg, G. (eds.) PNGT 2004. ENTCS, vol.127, pp. 107-120. Elsevier, Amsterdam (2005)
24. Vogler, W.: Modular Construction and Partial Order Semantics of Petri Nets. LNCS, vol.625. Springer, Heidelberg (1992)
25. Nielsen, M., Priese, L., Sassone, V.: Characterizing behavioural congruences for Petri nets. In: Lee, I., Smolka, S.A. (eds.) CONCUR 1995. LNCS, vol.962, pp. 175-189. Springer, Heidelberg (1995)
26. Koutny, M., Esparza, J., Best, E.: Operational semantics for the Petri box calculus. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol.836, pp. 210-225. Springer, Heidelberg (1994)
27. Kindler, E.: A compositional partial order semantics for Petri net components. In: Azema, P., Balbo, G. (eds.) ICATPN 1997. LNCS, vol.1248, pp. 235-252. Springer, Heidelberg (1997)
28. Busi, N., Gabbrielli, M., Zavattaro, G.: Comparing recursion, replication, and iteration in process calculi. In: Dýaz, J., Karhumaki, J., Lepisto, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.3142, pp. 307-319. Springer, Heidelberg (2004)
29. Jancar, P.: Undecidability of bisimilarity for Petri nets and some related problems. TCS 148(2), 281-301 (1995)
30. Buscemi, M., Sassone, V.: High-level Petri nets as type theories in the join calculus. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol.2030, pp. 104-120. Springer, Heidelberg (2001)
31. Busi, N., Zavattaro, G.: A process algebraic view of shared dataspace coordination. J. Log. Algebr. Program. 75(1), 52-85 (2008)
32. Devillers, R., Klaudel, H., Koutny, M.: A Petri net semantics of a simple process algebra for mobility. In: Baeten, J., Phillips, I. (eds.) EXPRESS 2005. ENTCS, vol.154, pp. 71-94. Elsevier, Amsterdam (2006)
33. Meyer, R., Khomenko, V., Strazny, T.: A practical approach to verification of mobile systems using net unfoldings. In: Van Hee, K.M., Valk, R. (eds.) PETRI NETS 2008. LNCS, vol.5062, pp. 327-347. Springer, Heidelberg (2008)
34. Milner, R.: A Calculus of Communication Systems. LNCS, vol.92. Springer, Heidelberg (1980)
35. Sangiorgi, D.: On the bisimulation proof method. Mathematical Structures in Computer Science 8(5), 447-479 (1998)
36. Gadducci, F.: Graph rewriting and the d-calculus. Mathematical Structures in Computer Science 17, 1-31 (2007)
37. Milner, R.: Pure bigraphs: Structure and dynamics. Information and Computation 204, 60-122 (2006)
38. Esparza, J., Nielsen, M.: Decidability issues for Petri nets - a survey. Journal Inform. Process. Cybernet. EIK 30(3), 143-160 (1994)
39. Agerwala, T., Flynn, M.: Comments on capabilities, limitations and "correctness" of Petri nets. Computer Architecture News 4(2), 81-86 (1973)
40. Busi, N., Zavattaro, G.: Expired data collection in shared dataspaces. TCS 3(298), 529-556 (2003)