{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:18:58Z","timestamp":1761488338208},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642050305"},{"type":"electronic","value":"9783642050312"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05031-2_3","type":"book-chapter","created":{"date-parts":[[2009,11,2]],"date-time":"2009-11-02T12:32:25Z","timestamp":1257165145000},"page":"33-48","source":"Crossref","is-referenced-by-count":5,"title":["Testing k-Safe Petri Nets"],"prefix":"10.1007","author":[{"given":"Gregor","family":"von Bochmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy-Vincent","family":"Jourdan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"3_CR1","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1109\/5.533956","volume":"84","author":"D. Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines \u2013 a survey. Proceedings of the IEEE\u00a084(8), 1089\u20131123 (1996)","journal-title":"Proceedings of the IEEE"},{"key":"3_CR2","unstructured":"Luo, G., Dssouli, R., Bochmann, G.v., Ventakaram, P., Ghedamsi, A.: Generating synchronizable test sequences based on finite state machines with distributed ports. In: IFIP Sixth International Workshop on Protocol Test Systems, Pau, France, September 1993, pp. 53\u201368 (1993)"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/11562436_17","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"J. Chen","year":"2005","unstructured":"Chen, J., Hierons, R.M., Ural, H.: Resolving observability problems in distributed test architectures. In: Wang, F. (ed.) FORTE 2005. LNCS, vol.\u00a03731, pp. 219\u2013232. Springer, Heidelberg (2005)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-68524-1_13","volume-title":"Testing of Software and Communicating Systems","author":"G. Bochmann von","year":"2008","unstructured":"von Bochmann, G., Haar, S., Jard, C., Jourdan, G.-V.: Testing Systems Specified as Partial Order Input\/Output Automata. In: Suzuki, K., Higashino, T., Ulrich, A., Hasegawa, T. (eds.) TestCom\/FATES 2008. LNCS, vol.\u00a05047, pp. 169\u2013183. Springer, Heidelberg (2008)"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"Murata, T.: Petri nets: Properties, analysis and applications. Proceedings of the IEEE\u00a077(4), 541\u2013580 (1989)","journal-title":"Proceedings of the IEEE"},{"issue":"9","key":"3_CR6","doi-asserted-by":"publisher","first-page":"1128","DOI":"10.1109\/TKDE.2004.47","volume":"16","author":"W. Aalst van der","year":"2004","unstructured":"van der Aalst, W., Weijters, T., Maruster, L.: Workflow mining: discovering process models from event logs. IEEE Transactions on Knowledge and Data Engineering\u00a016(9), 1128\u20131142 (2004)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/11901914_28","volume-title":"Automated Technology for Verification and Analysis","author":"P. Bhateja","year":"2006","unstructured":"Bhateja, P., Gastin, P., Mukund, M.: A Fresh Look at Testing for Asynchronous Communication. In: Graf, S., Zhang, W. (eds.) ATVA 2006. LNCS, vol.\u00a04218, pp. 369\u2013383. Springer, Heidelberg (2006)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-540-74240-1_8","volume-title":"Fundamentals of Computation Theory","author":"P. Bhateja","year":"2007","unstructured":"Bhateja, P., Gastin, P., Mukund, M., Kumar, K.N.: Local Testing of Message Sequence Charts Is Difficult. In: Csuhaj-Varj\u00fa, E., \u00c9sik, Z. (eds.) FCT 2007. LNCS, vol.\u00a04639, pp. 76\u201387. Springer, Heidelberg (2007)"},{"key":"3_CR9","unstructured":"Haar, S.: Law and Partial Order. Nonsequential Behaviour and Probability in Asynchronous Systems. In: Habilitation \u00e0 diriger les recherches, INRIA (2008), \n                    \n                      http:\/\/www.lsv.ens-cachan.fr\/~haar\/HDR.pdf"},{"issue":"8","key":"3_CR10","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0950-5849(02)00048-4","volume":"44","author":"H. Zhu","year":"2002","unstructured":"Zhu, H., He, X.: A methodology of testing high-level Petri nets. Information and Software Technology\u00a044(8), 473\u2013489 (2002)","journal-title":"Information and Software Technology"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Desel, J., Esparza, J.: Free choice Petri nets. Cambridge Tracts In Theoretical Computer Science\u00a040 (1995) ISBN:0-521-46519-2","DOI":"10.1017\/CBO9780511526558"},{"issue":"1-2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/0304-3975(94)00231-7","volume":"147","author":"A. Cheng","year":"1995","unstructured":"Cheng, A., Esparza, J., Palsberg, J.: Complexity results for 1-safe nets. Theoretical Computer Science\u00a0147(1-2), 117\u2013136 (1995)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/32.87284","volume":"17","author":"S. Fujiwara","year":"1991","unstructured":"Fujiwara, S., Bochmann, G.v., Khendek, F., Amalou, M., Ghedamsi, A.: Test selection based on finite state models. IEEE Transactions on Software Engineering\u00a017(6), 591\u2013603 (1991)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"3_CR14","unstructured":"Luo, G., Petrenko, A., Bochmann, G.v.: Selecting test sequences for partially-specified nondeterministic finite state machines. In: Proc. of the International Workshop on Protocol Test Systems (IWPTS 1994), Tokyo, Japan, November, 1994, pp. 95\u2013110 (1994)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Tan, Q.M., Petrenko, A., Bochmann, G.v.: Checking experiments with labeled transition systems for trace equivalence. In: Proc. IFIP 10th\u00a0 Intern. Workshop on Testing of Communication Systems (IWTCS 1997), Cheju Island, Korea (1997)","DOI":"10.1007\/978-0-387-35198-8_11"}],"container-title":["Lecture Notes in Computer Science","Testing of Software and Communication Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05031-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,10]],"date-time":"2019-03-10T10:14:50Z","timestamp":1552212890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05031-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642050305","9783642050312"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05031-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}