{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T08:41:05Z","timestamp":1759826465555},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540346999"},{"type":"electronic","value":"9783540347002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11767589_9","type":"book-chapter","created":{"date-parts":[[2006,6,20]],"date-time":"2006-06-20T10:38:34Z","timestamp":1150799914000},"page":"146-165","source":"Crossref","is-referenced-by-count":5,"title":["On the Computation of Stubborn Sets of Colored Petri Nets"],"prefix":"10.1007","author":[{"given":"Sami","family":"Evangelista","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Pradat-Peyre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/3-540-60029-9_37","volume-title":"Application and Theory of Petri Nets 1995","author":"R. Brgan","year":"1995","unstructured":"Brgan, R., Poitrenaud, D.: An efficient algorithm for the computation of stubborn sets of well formed petri nets. In: DeMichelis, G., D\u00edaz, M. (eds.) ICATPN 1995. LNCS, vol.\u00a0935, pp. 121\u2013140. Springer, Heidelberg (1995)"},{"key":"9_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/11494744_11","volume-title":"Applications and Theory of Petri Nets 2005","author":"L. Capra","year":"2005","unstructured":"Capra, L., Franceschinis, G., De Pierro, M.: A high level language for structural relations in well-formed nets. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol.\u00a03536, pp. 168\u2013187. Springer, Heidelberg (2005)"},{"key":"9_CR3","first-page":"373","volume-title":"Application and Theory of Petri Nets","author":"G. Chiola","year":"1990","unstructured":"Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: On well-formed coloured nets and their symbolic reachability graph. In: Application and Theory of Petri Nets, pp. 373\u2013396. Springer, Heidelberg (1990)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Chiola, G., Franceschinis, G., Gaeta, R.: A symbolic simulation mechanism for well-formed coloured petri nets. In: Simulation Symposium (1992)","DOI":"10.1109\/SIMSYM.1992.227562"},{"key":"9_CR5","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. The MIT Press, Cambridge (1999)"},{"key":"9_CR6","unstructured":"Dutheillet, C., Haddad, S.: Structural analysis of coloured nets. application to the detection of confusion. Technical Report\u00a016, IBP\/MASI (1992)"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/11494744_26","volume-title":"Applications and Theory of Petri Nets 2005","author":"S. Evangelista","year":"2005","unstructured":"Evangelista, S.: High level petri nets analysis with Helena. In: Ciardo, G., Darondeau, P. (eds.) ICATPN 2005. LNCS, vol.\u00a03536, pp. 455\u2013464. Springer, Heidelberg (2005)"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/11562948_17","volume-title":"Automated Technology for Verification and Analysis","author":"S. Evangelista","year":"2005","unstructured":"Evangelista, S., Haddad, S., Pradat-Peyre, J.-F.: Syntactical colored petri nets reductions. In: Peled, D.A., Tsay, Y.-K. (eds.) ATVA 2005. LNCS, vol.\u00a03707, pp. 202\u2013216. Springer, Heidelberg (2005)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/11499909_8","volume-title":"Reliable Software Technology \u2013 Ada-Europe 2005","author":"S. Evangelista","year":"2005","unstructured":"Evangelista, S., Kaiser, C., Pajault, C., Pradat-Peyre, J.-F., Rousseau, P.: Dynamic tasks verification with Quasar. In: Vardanega, T., Wellings, A.J. (eds.) Reliable Software Technology \u2013 Ada-Europe 2005. LNCS, vol.\u00a03555, pp. 91\u2013104. Springer, Heidelberg (2005)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Holzmann, G.J., Peled, D.: An improvement in formal verification. In: Formal Description Techniques, pp. 197\u2013211 (1994)","DOI":"10.1007\/978-0-387-34878-0_13"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Petri Nets 1990","author":"K. Jensen","year":"1991","unstructured":"Jensen, K.: Coloured petri nets: A high level language for system design and analysis. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol.\u00a0483. Springer, Heidelberg (1991)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"J\u00f8rgensen, J.B., Kristensen, L.M.: Computer aided verification of lamport\u2019s fast mutual exclusion algorithm using colored petri nets and occurrence graphs with symmetries. IEEE Transactions on Parallel and Distributed Systems\u00a010(7) (1999)","DOI":"10.1109\/71.780866"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-69108-1_7","volume-title":"Application and Theory of Petri Nets 1998","author":"L.M. Kristensen","year":"1998","unstructured":"Kristensen, L.M., Valmari, A.: Finding stubborn sets of coloured petri nets without unfolding. In: Desel, J., Silva, M. (eds.) ICATPN 1998. LNCS, vol.\u00a01420, pp. 104\u2013123. Springer, Heidelberg (1998)"},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/3-540-56922-7_34","volume-title":"Computer Aided Verification","author":"D. Peled","year":"1993","unstructured":"Peled, D.: All from one, one for all: on model checking using representatives. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol.\u00a0697, pp. 409\u2013423. Springer, Heidelberg (1993)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/3-540-44988-4_22","volume-title":"Application and Theory of Petri Nets 2000","author":"D. Poitrenaud","year":"2000","unstructured":"Poitrenaud, D., Pradat-Peyre, J.-F.: Pre- and post-agglomerations for LTL model checking. In: Nielsen, M., Simpson, D. (eds.) ICATPN 2000. LNCS, vol.\u00a01825, pp. 387\u2013408. Springer, Heidelberg (2000)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Petri Nets 1989","author":"A. Valmari","year":"1990","unstructured":"Valmari, A.: Error detection by reduced reachability graph generation. In: Rozenberg, G. (ed.) APN 1989. LNCS, vol.\u00a0424. Springer, Heidelberg (1990)"},{"key":"9_CR17","unstructured":"Valmari, A.: State Space Generation: Efficiency and Practicality. PhD thesis, Tampere University of Technology (1988)"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-51285-3_35","volume-title":"PARLE \u201989 - Parallel Architectures and Languages Europe","author":"A. Valmari","year":"1989","unstructured":"Valmari, A.: Eliminating redundant interleavings during concurrent program verification. In: Odijk, E., Rem, M., Syre, J.-C. (eds.) PARLE 1989. LNCS, vol.\u00a0366, pp. 89\u2013103. Springer, Heidelberg (1989)"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/3-540-53863-1_36","volume-title":"Advances in Petri Nets 1990","author":"A. Valmari","year":"1991","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Rozenberg, G. (ed.) APN 1990. LNCS, vol.\u00a0483, pp. 491\u2013515. Springer, Heidelberg (1991)"},{"key":"9_CR20","unstructured":"Valmari, A.: Stubborn sets of coloured petri nets. In: Application and Theory of Petri Nets, pp. 102\u2013121 (1991)"},{"key":"9_CR21","unstructured":"Varpaaniemi, K.: On choosing a scapegoat in the stubborn set method. In: Workshop on Concurrency, Specification & Programming, pp. 163\u2013171 (1993)"},{"key":"9_CR22","unstructured":"Varpaaniemi, K.: On the Stubborn Set Method in Reduced State Space Generation. PhD thesis, Helsinki University of Technology (1998)"}],"container-title":["Lecture Notes in Computer Science","Petri Nets and Other Models of Concurrency - ICATPN 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11767589_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:11:32Z","timestamp":1619493092000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11767589_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540346999","9783540347002"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11767589_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}