메뉴 건너뛰기




Volumn 4546 LNCS, Issue , 2007, Pages 402-422

Name creation vs. replication in Petri net systems

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; PROBLEM SOLVING; SYNCHRONIZATION;

EID: 38149030915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73094-1_24     Document Type: Conference Paper
Times cited : (11)

References (27)
  • 1
    • 33745645692 scopus 로고    scopus 로고
    • Forward Reachability Analysis of Timed Petri Nets
    • Lakhnech, Y, Yovine, S, eds, FORMATS 2004 and FTRTFT 2004, Springer, Heidelberg
    • Abdulla, P.A., Deneux, J., Mahata, P., Nylén, A.: Forward Reachability Analysis of Timed Petri Nets. In: Lakhnech, Y., Yovine, S. (eds.) FORMATS 2004 and FTRTFT 2004. LNCS, vol. 3253, pp. 343-362. Springer, Heidelberg (2004)
    • (2004) LNCS , vol.3253 , pp. 343-362
    • Abdulla, P.A.1    Deneux, J.2    Mahata, P.3    Nylén, A.4
  • 2
    • 35048857405 scopus 로고    scopus 로고
    • Parameterized Verification of Multithreaded Software Libraries
    • Margaria, T, Yi, W, eds, ETAPS 2001 and TACAS 2001, Springer, Heidelberg
    • Ball, T., Chaki, S., Rajamani, S.K.: Parameterized Verification of Multithreaded Software Libraries. In: Margaria, T., Yi, W. (eds.) ETAPS 2001 and TACAS 2001. LNCS, vol. 2031, pp. 158-173. Springer, Heidelberg (2001)
    • (2001) LNCS , vol.2031 , pp. 158-173
    • Ball, T.1    Chaki, S.2    Rajamani, S.K.3
  • 5
    • 24644462430 scopus 로고    scopus 로고
    • Deciding Reachability in Mobile Ambients
    • Sagiv, M, ed, ESTAPS'05, Springer, Heidelberg
    • Busi, N., Zavattaro, G.: Deciding Reachability in Mobile Ambients. In: Sagiv, M. (ed.) ESTAPS'05. LNCS, vol. 3444, pp. 248-262. Springer, Heidelberg (2005)
    • (2005) LNCS , vol.3444 , pp. 248-262
    • Busi, N.1    Zavattaro, G.2
  • 6
    • 84947919695 scopus 로고    scopus 로고
    • Mobile Ambients
    • Nivat, M, ed, ETAPS 1998 and FOSSACS 1998, Springer, Heidelberg
    • Cardelli, L., Gordon, A.D.: Mobile Ambients. In: Nivat, M. (ed.) ETAPS 1998 and FOSSACS 1998. LNCS, vol. 1378, pp. 140-155. Springer, Heidelberg (1998)
    • (1998) LNCS , vol.1378 , pp. 140-155
    • Cardelli, L.1    Gordon, A.D.2
  • 8
    • 18944390759 scopus 로고    scopus 로고
    • An overview of MSR(C): A CLP-based Framework for the Symbolic Verification of Parameterized Concurrent Systems
    • Elsevier, Amsterdam
    • 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'02. ENTCS, vol. 76, Elsevier, Amsterdam (2002)
    • (2002) 11th Int. Workshop on Functional and Logic Programming, WFLP'02. ENTCS , vol.76
    • Delzanno, G.1
  • 11
    • 0034911369 scopus 로고    scopus 로고
    • Well-Structured Transition Systems Everywhere!
    • Finkel, A., Schnoebelen, P.: Well-Structured Transition Systems Everywhere! Theoretical Computer Science 256(1-2), 63-92 (2001)
    • (2001) Theoretical Computer Science , vol.256 , Issue.1-2 , pp. 63-92
    • Finkel, A.1    Schnoebelen, P.2
  • 12
    • 38149108012 scopus 로고    scopus 로고
    • Frutos-Escrig, D., Marroquin-Alonso, O., Rosa-Velardo, F.: Ubiquitous Systems and Petri Nets. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds.) APWeb 2006. LNCS, 3841, Springer, Heidelberg (2005)
    • Frutos-Escrig, D., Marroquin-Alonso, O., Rosa-Velardo, F.: Ubiquitous Systems and Petri Nets. In: Zhou, X., Li, J., Shen, H.T., Kitsuregawa, M., Zhang, Y. (eds.) APWeb 2006. LNCS, vol. 3841, Springer, Heidelberg (2005)
  • 13
    • 23044531604 scopus 로고    scopus 로고
    • Notes on Nominal Calculi for Security and Mobility
    • Focardi, R, Gorrieri, R, eds, Foundations of Security Analysis and Design FOSAD'00, Springer, Heidelberg
    • Gordon, A.: Notes on Nominal Calculi for Security and Mobility. In: Focardi, R., Gorrieri, R. (eds.) Foundations of Security Analysis and Design (FOSAD'00). LNCS, vol. 2171, pp. 262-330. Springer, Heidelberg (2001)
    • (2001) LNCS , vol.2171 , pp. 262-330
    • Gordon, A.1
  • 14
    • 0005748831 scopus 로고    scopus 로고
    • Undecidability in object-oriented Petri nets
    • Kummer, O.: Undecidability in object-oriented Petri nets. Petri Net Newsletter 59, 18-23 (2000)
    • (2000) Petri Net Newsletter , vol.59 , pp. 18-23
    • Kummer, O.1
  • 15
    • 29144474436 scopus 로고    scopus 로고
    • Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification
    • Lazic, R.: Decidability of Reachability for Polymorphic Systems with Arrays: A Complete Classification. ENTCS 138(3), 3-19 (2005)
    • (2005) ENTCS , vol.138 , Issue.3 , pp. 3-19
    • Lazic, R.1
  • 17
    • 0037400699 scopus 로고    scopus 로고
    • Abstract interpretation of mobile ambients
    • Nielson, F., Hansen, R.R., Nielson, H.R.: Abstract interpretation of mobile ambients. Sei. Comput. Program 47(2-3), 145-175 (2003)
    • (2003) Sei. Comput. Program , vol.47 , Issue.2-3 , pp. 145-175
    • Nielson, F.1    Hansen, R.R.2    Nielson, H.R.3
  • 18
    • 0000422707 scopus 로고    scopus 로고
    • Context-sensitive synchronization-sensitive analysis is undecidable
    • Ramalingam, G.: Context-sensitive synchronization-sensitive analysis is undecidable. ACM Trans. Program. Lang. Syst. 22(2), 416-430 (2000)
    • (2000) ACM Trans. Program. Lang. Syst , vol.22 , Issue.2 , pp. 416-430
    • Ramalingam, G.1
  • 19
    • 11944251803 scopus 로고    scopus 로고
    • Decidability of context-explicit security protocols
    • Ramanujam, R., Suresh, S.P.: Decidability of context-explicit security protocols. Journal of Computer Security 13(1), 135-165 (2005)
    • (2005) Journal of Computer Security , vol.13 , Issue.1 , pp. 135-165
    • Ramanujam, R.1    Suresh, S.P.2
  • 20
    • 35248886574 scopus 로고    scopus 로고
    • Ramanujam, R., Suresh, S.P.: Tagging makes secrecy decidable with unbounded nonces as well. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. LNCS, 2914, pp. 363-374. Springer, Heidelberg (2003)
    • Ramanujam, R., Suresh, S.P.: Tagging makes secrecy decidable with unbounded nonces as well. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 2914, pp. 363-374. Springer, Heidelberg (2003)
  • 21
    • 64649104000 scopus 로고    scopus 로고
    • Rinard, M.: Analysis of multithreaded programs. In: Cousot, P. (ed.) SAS 2001. LNCS, 2126, pp. 1-19. Springer, Heidelberg (2001)
    • Rinard, M.: Analysis of multithreaded programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol. 2126, pp. 1-19. Springer, Heidelberg (2001)
  • 25
    • 38149083862 scopus 로고    scopus 로고
    • Coding Mobile Synchronizing Petri Nets into Rewriting Logic. 7th Int. Workshop on Rule-based Programming, RULE'06
    • to appear
    • Rosa-Velardo, F.: Coding Mobile Synchronizing Petri Nets into Rewriting Logic. 7th Int. Workshop on Rule-based Programming, RULE'06. ENTCS (to appear)
    • ENTCS
    • Rosa-Velardo, F.1
  • 26
    • 33745893798 scopus 로고    scopus 로고
    • Replicated Ubiquitous Nets
    • Gavrilova, M, Gervasi, O, Kumar, V, Tan, C.J.K, Taniar, D, Laganà, A, Mun, Y, Choo, H, eds, ICCSA 2006, Springer, Heidelberg
    • Rosa-Velardo, F., Frutos-Escrig, D., Marroquín-Alonso, O.: Replicated Ubiquitous Nets. In: Gavrilova, M., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganà, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3983, Springer, Heidelberg (2006)
    • (2006) LNCS , vol.3983
    • Rosa-Velardo, F.1    Frutos-Escrig, D.2    Marroquín-Alonso, O.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.