Forward analysis for petri nets with name creation

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

Volumn 6128 LNCS, Issue , 2010, Pages 185-205

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

^a UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDEDNESS; COVERABILITY; FORWARD ANALYSIS; NAME CREATION; P/T NET; SIMPLE LOOP; UPPER BOUND; WEAK FORM;

COMPUTABILITY AND DECIDABILITY; GRAPH THEORY;

PETRI NETS;

EID: 77955360676     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-13675-7_12     Document Type: Conference Paper

References (20)

1. Abdulla, P.A., Cerans, K., Jonsson, B., Tsay, Y.: Algorithmic Analysis of Programs with Well Quasi-ordered Domains. Inf. and Comp. 160(1-2), 109-127 (2000)
2. Abdulla, P.A., Nylén, A.: Better is Better than Well: On Efficient Verification of Infinite-State Systems. In: 15th Annual IEEE Symp. on Logic in Computer Science, LICS 2000, pp. 132-140 (2000)
3. Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using Forward Reachability Analysis for Verification of Lossy Channel Systems. Formal Methods in System Design 25(1), 39-65 (2004)
4. Bardin, S., Finkel, A., Leroux, J., Schnoebelen, P.: Flat Acceleration in Symbolic Model Checking. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol. 3707, pp. 474-488. Springer, Heidelberg (2005)
5. Dietze, R., Kudlek, M., Kummer, O.: Decidability Problems of a Basic Class of Object Nets. In: Fundamenta Informaticae, vol. 79, pp. 295-302. IOS Press, Amsterdam (2007)
6. Decker, G., Weske, M.: Instance Isolation Analysis for Service-Oriented Architectures. In: Int. Conference on Services Computing, SCC 2008, pp. 249-256. IEEE Computer Society, Los Alamitos (2008)
7. Dufourd, C., Finkel, A., Schnoebelen, P.: Reset Nets Between Decidability and Undecidability. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol. 1443, pp. 103-115. Springer, Heidelberg (1998)
8. Finkel, A., Schnoebelen, P.: Fundamental Structures in Well-Structured Infinite Transition Systems. In: Lucchesi, C.L., Moura, A.V. (eds.) LATIN 1998. LNCS, vol. 1380, pp. 102-118. Springer, Heidelberg (1998)
9. Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256(1-2), 63-92 (2001)
10. Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, Part I: Completions. In: Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS'09, pp. 433-444 (2009)
11. Finkel, A., Goubault-Larrecq, J.: Forward analysis for WSTS, Part II: Complete WSTS. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 188-199. Springer, Heidelberg (2009)
12. Geeraerts, G., Raskin, J.-F., van Begin, L.: Expand, enlarge and check: New algorithms for the coverability problem of WSTS. J. Comp. Sys. Sci. 72(1), 180-203 (2006)
13. 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)
14. Goubault-Larrecq, J.: On Noetherian spaces. In: 22nd IEEE Symposium on Logic in Computer Science, LICS 2007, pp. 453-462. IEEE Computer Society, Los Alamitos (2007)
15. Jančar, P.: A note on well quasi-orderings for powersets. Information Processing Letters 72(5-6), 155-160 (1999)
16. Lazic, R., Newcomb, T., Ouaknine, J., Roscoe, A.W., Worrell, J.: Nets with Tokens which Carry Data. Fundamenta Informaticae 88(3), 251-274 (2008)
17. Rosa-Velardo, F., de Frutos-Escrig, D., Marroquín-Alonso, O.: On the expressiveness of Mobile Synchronizing Petri Nets. In: 3rd International Workshop on Security Issues in Concurrency, SecCo 2005. ENTCS, vol. 180(1), pp. 77-94. Elsevier, Amsterdam (2007)
18. Rosa-Velardo, F., de Frutos-Escrig, D.: Name creation vs. replication in Petri Net systems. Fundamenta Informaticae 88(3), 329-356 (2008)
19. Rosa-Velardo, F., de Frutos-Escrig, D.: Name creation vs. replication in Petri Net systems. In: Kleijn, J., Yakovlev, A. (eds.) ICATPN 2007. LNCS, vol. 4546, pp. 402-422. Springer, Heidelberg (2007)
20. Schnoebelen, P.: Verifying lossy channel systems has nonprimitive recursive complexity. Inf. Process. Lett. 83(5), 251-261 (2002)