{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T00:25:25Z","timestamp":1790641525194,"version":"4.1.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,9,23]],"date-time":"2005-09-23T00:00:00Z","timestamp":1127433600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s10009-005-0201-1","type":"journal-article","created":{"date-parts":[[2005,9,22]],"date-time":"2005-09-22T23:37:06Z","timestamp":1127432226000},"page":"195-203","source":"Crossref","is-referenced-by-count":7,"title":["Automated generation of a progress measure for the sweep-line method"],"prefix":"10.1007","volume":"8","author":[{"given":"Karsten","family":"Schmidt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,9,23]]},"reference":[{"key":"201_CR1","unstructured":"Mailund, T.: Sweeping the state space. Ph.D. thesis, University of Aarhus (2003)"},{"key":"201_CR2","doi-asserted-by":"crossref","unstructured":"Christensen, S., Kristensen, L.M., Mailund, T.: A sweep-line method for state space exploration. In: Proceedings of TACAS 2001, LNCS, vol. 2031, pp. 450\u2013464 (2001)","DOI":"10.1007\/3-540-45319-9_31"},{"key":"201_CR3","doi-asserted-by":"crossref","unstructured":"Kristensen, L.M., Mailund, T.: A generalized sweep-line method for safety properties. In: Proceedings of the FME 2002, LNCS vol. 2391, pp. 549\u2013567 (2002)","DOI":"10.1007\/3-540-45614-7_31"},{"key":"201_CR4","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Wolper, P.: A partial approach to model checking. In: Proceedings of the 6th IEEE Symp. on Logic in Computer Science. pp. 406\u2013415 Amsterdam (1991)","DOI":"10.1109\/LICS.1991.151664"},{"key":"201_CR5","doi-asserted-by":"crossref","unstructured":"Peled, D.: All from one, one for all: On model-checking using representitives. In: Proceedings of the 5th Interantional Conference on Computer Aided Verification, LNCS, vol. 697, pp. 409\u2013423. Elounda, Greece (1993)","DOI":"10.1007\/3-540-56922-7_34"},{"key":"201_CR6","unstructured":"Valmari, A.: Error detection by reduced reachability graph generation. In: Proceedings of the 9th European Workshop on Application and Theory of Petri Nets (1988)"},{"key":"201_CR7","doi-asserted-by":"crossref","unstructured":"Schmidt, K.: Stubborn sets for standard properties. In: Proceedings of the 20th International Conference on Application and Theory of Petri nets, LNCS, vol. 1639, pp. 46\u201365 (1999)","DOI":"10.1007\/3-540-48745-X_4"},{"key":"201_CR8","doi-asserted-by":"crossref","unstructured":"Valmari, A.: Stubborn sets for reduced state space generation. In: Advances of Petri Nets 1990, LNCS, vol. 483, pp. 491\u2013511 (1991)","DOI":"10.1007\/3-540-53863-1_36"},{"key":"201_CR9","doi-asserted-by":"crossref","unstructured":"Valmari, A.: On-the-fly verification with stubborn sets. In: 5th International Conference on Computer Aided Verification, LNCS, vol. 697, pp. 397\u2013408 (1993)","DOI":"10.1007\/3-540-56922-7_33"},{"key":"201_CR10","doi-asserted-by":"crossref","unstructured":"Kristensen, L.M., Valmari, A.: Improved question-guided stubborn set methods for state properties. In: Proceedings of the 21th International Conference on Application and Theory of Petri nets, LNCS, vol. 1835, pp. 282\u2013302 (2000)","DOI":"10.1007\/3-540-44988-4_17"},{"key":"201_CR11","unstructured":"Valmari, A.: Stubborn set methods for process algebras. In: Workshop on Partial Order Methods in Verification. pp. 192\u2013210. Princeton (1996)"},{"key":"201_CR12","doi-asserted-by":"crossref","unstructured":"Valmari, A.: The state explosion problem. In: Lectures on Petri nets I: Basic Models, LNCS, vol. 1491, pp. 429\u2013528 (1998)","DOI":"10.1007\/3-540-65306-6_21"},{"key":"201_CR13","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth first search and linear graph algorithms. SIAM J. Comput. 1, 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"key":"201_CR14","doi-asserted-by":"crossref","unstructured":"Huber, P., Jensen, A., Jepsen, L.O., Jensen, K.: Towards reachability trees for high-level Petri nets. In: Advances in Petri Nets 1984, LNCS, vol. 188, pp. 215\u2013233 (1984)","DOI":"10.1007\/3-540-15204-0_13"},{"key":"201_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/BF00625969","volume":"9","author":"E.M. Clarke","year":"1996","unstructured":"Clarke, E.M., Enders, R., Filkorn, T., Jha, S.: Exploiting symmetry in temporal logic model checking. Formal Methods Syst. Design 9, 77\u2013104 (1996)","journal-title":"Formal Methods Syst. Design."},{"key":"201_CR16","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF00625970","volume":"9","author":"E.A. Emerson","year":"1996","unstructured":"Emerson, E.A., Sistla, A.P.: Symmetry and model checking. Formal Methods Syst. Design. 9, 105\u2013131 (1996)","journal-title":"Formal Methods Syst. Design."},{"key":"201_CR17","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00625968","volume":"9","author":"C.N. Ip","year":"1996","unstructured":"Ip, C.N., Dill, D.L.: Better verification through symmetry. Formal Methods Syst. Design 9, 41\u201375 (1996)","journal-title":"Formal Methods Syst. Design."},{"issue":"1\/2","key":"201_CR18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0304-3975(96)00010-2","volume":"176","author":"G. Chiola","year":"1997","unstructured":"Chiola, G., Dutheillet, C., Franceschinis, G., Haddad, S.: A symbolic reachability graph for Coloured Petri nets. Theor. Computer Sci. B 176(1\/2), 39\u201365 (1997)","journal-title":"Theor. Computer Sci. B."},{"key":"201_CR19","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s002360050002","volume":"36","author":"K. Schmidt","year":"2000","unstructured":"Schmidt, K.: How to calculate symmetries of Petri nets. Acta Inform. 36, 545\u2013590 (2000)","journal-title":"Acta Inform."},{"key":"201_CR20","doi-asserted-by":"crossref","unstructured":"Schmidt, K.: Integrating low level symmetries into reachability analysis. In: Proceedings of the TACAS 2000, LNCS, vol. 1785, pp. 315\u2013331 (2000)","DOI":"10.1007\/3-540-46419-0_22"},{"key":"201_CR21","doi-asserted-by":"crossref","unstructured":"Schmidt, K.: LoLA: A low level analyser. In: Proceedings of the 20th Intrenational Conference on Application and Theory of Petri net, LNCS, vol. 1825, pp. 465\u2013474 (1999)","DOI":"10.1007\/3-540-44988-4_27"},{"key":"201_CR22","doi-asserted-by":"crossref","unstructured":"Krsti\u0107, M., Grass, E.: GALSification of IEEE 802.11a Baseband Processor. In: Proceedings of PATMOS, LNCS, vol. 3254, pp. 258\u2013267 (2004)","DOI":"10.1007\/978-3-540-30205-6_28"},{"key":"201_CR23","unstructured":"Curbera, F., Goland, Y., Klein, J., Leymann, F., Roller, D., Thatte, S., Weerawarana, S.: Business process execution language for web services, Version 1.1. Technical Report, BEA Systems, IBM Corporation, Microsoft Corporation (2003)"},{"key":"201_CR24","unstructured":"Stahl, C.: Transformation von BPEL4WS in Petrinetze. Diploma thesis, Humboldt-Universit\u00e4t zu Berlin (2004)"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-005-0201-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-005-0201-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-005-0201-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T21:05:29Z","timestamp":1586466329000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-005-0201-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,9,23]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["201"],"URL":"https:\/\/doi.org\/10.1007\/s10009-005-0201-1","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,9,23]]}}}