Decidability results for restricted models of petri nets with name creation and replication

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

Volumn 5606 LNCS, Issue , 2009, Pages 63-82

  Rosa Velardo, Fernando ^a   De Frutos Escrig, David ^a  

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

COVERABILITY; FINITE SET; MULTISET REWRITING; NAME CREATION; NEW COMPONENTS; P/T NET; REACHABILITY;

COMMUNICATION CHANNELS (INFORMATION THEORY); GRAPH THEORY; PETRI NETS; SET THEORY;

COMPUTABILITY AND DECIDABILITY;

EID: 70350306728     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02424-5_6     Document Type: Conference Paper

References (20)

1. Abadi, M., Gordon, A.D.: A Calculus for Cryptographic Protocols: The Spi Calculus. In: Fourth ACM Conference on Computer and Communications Security, pp. 36-47. ACM Press, New York (1997)
2. Abdulla, P.A., Jonsson, B.: Verifying Programs with Unreliable Channels. Information and Computation 127(2), 91-101 (1996)
3. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic analysis of programs with well quasi-ordered domains. Information and Computation 160, 109-127 (2000)
4. Abdulla, P.A., Delzanno, G., Van Begin, L.: Comparing the Expressive Power of Well-Structured Transition Systems. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 99-114. Springer, Heidelberg (2007)
5. Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) FOSSACS 1998. LNCS, vol. 1378, pp. 140-155. Springer, Heidelberg (1998)
6. Decker, G., Puhlmann, F.: Extending BPMN for Modelling Complex Choreographies. In: Meersman, R., Tari, Z. (eds.) OTM 2007, Part I. LNCS, vol. 4803, pp. 24-40. Springer, Heidelberg (2007)
7. Decker, G., Weske, M.: Instance Isolation Analysis for Service-Oriented Architectures. In: Proceedings of the 2008 IEEE International Conference on Services (SCC 2008), pp. 249-256. IEEE Computer Society, Los Alamitos (2008)
8. Delzanno, G.: An overview of MSR(C): A CLP-based Framework for the Symbolic Verification of Parameterized Concurrent Systems. In: 11th Int. Workshop on Functional and Logic Programming, WFLP 2002. Electronic Notes in Theoretical Computer Science, vol. 76. Elsevier, Amsterdam (2002)
9. Esparza, J., Nielsen, M.: Decidability issues for Petri Nets - a survey. Bulletin of the EATCS 52, 244-262 (1994)
10. Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256(1-2), 63-92 (2001)
11. Gordon, A.: Notes on Nominal Calculi for Security and Mobility. In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol. 2171, pp. 262-330. Springer, Heidelberg (2001)
12. Haddad, S., Poitrenaud, D.: Recursive Petri Nets. Acta Informatica 44(7-8), 463-508 (2007)
13. Kummer, O.: Undecidability in object-oriented Petri nets. Petri Net Newsletter 59, 18-23 (2000)
14. Lazic, R., Newcomb, T.C., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with Tokens Which Carry Data. Fundamenta Informaticae 88(3), 251-274 (2008)
15. Lomazova, I.: Nested Petri nets - a formalism for specification and verification of multi-agent distributed systems. Fundamenta Informaticae 43(1-4), 195-214 (2000)
16. Milner, R., Parrow, J., Walker, D.: A Calculus of Mobile Processes, I. Information and Computation 100(1), 1-40 (1992)
17. Needham, R.M.: Names. Distributed Systems, pp. 89-101. Addison-Wesley, Reading (1989)
18. Rosa-Velardo, F., de Frutos-Escrig, D., Marroqum-Alonso, O.: On the expressiveness of Mobile Synchronizing Petri Nets. In: 3rd Int. Workshop on Security Issues in Concurrency, SecCo 2005. ENTCS, vol. 180(1), pp. 77-94. Elsevier, Amsterdam (2007)
19. Rosa-Velardo, F., de Frutos-Escrig, D.: Name Creation vs. Replication in Petri Net Systems. Fundamenta Informaticae 88(3), 329-356 (2008);
20. special issue on Selected Papers from ATPN 2007. IOS Press (2008)