{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,16]],"date-time":"2026-01-16T06:43:40Z","timestamp":1768545820000,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T00:00:00Z","timestamp":1455926400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Event Dyn Syst"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10626-016-0225-6","type":"journal-article","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T06:50:46Z","timestamp":1455951046000},"page":"85-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Synchronizing sequences on a class of unbounded systems using synchronized Petri nets"],"prefix":"10.1007","volume":"26","author":[{"given":"Marco","family":"Pocci","sequence":"first","affiliation":[]},{"given":"Isabel","family":"Demongodin","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Giambiasi","sequence":"additional","affiliation":[]},{"given":"Alessandro","family":"Giua","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,20]]},"reference":[{"key":"225_CR1","doi-asserted-by":"crossref","unstructured":"Ananichev D, Volkov MV (2003) Synchronizing monotonic automata. Lecture Notes in Computer Science 111\u2013121","DOI":"10.1007\/3-540-45007-6_8"},{"issue":"5","key":"225_CR2","doi-asserted-by":"crossref","first-page":"2191","DOI":"10.1073\/pnas.0535624100","volume":"100","author":"Y Benenson","year":"2003","unstructured":"Benenson Y, Adar R, Paz-Elizur T, Livneh Z, Shapiro E (2003) Dna molecule provides a computing machine with both data and fuel. Proc National Acad Sci USA 100(5):2191\u20132196. doi: 10.1073\/pnas.0535624100","journal-title":"Proc National Acad Sci USA"},{"key":"225_CR3","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1038\/35106533","volume":"414","author":"Y Benenson","year":"2001","unstructured":"Benenson Y, Paz-Elizur T, Adar R, Keinan E, Livneh Z, Shapiro E (2001) Programmable and autonomous computing machine made of biomolecules. Nature 414:430\u2013434. doi: 10.1038\/35106533","journal-title":"Nature"},{"key":"225_CR4","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1109\/12.127453","volume":"41","author":"KT Cheng","year":"1992","unstructured":"Cheng KT, Agrawal V (1992) Initializability consideration in sequential machine synthesis. IEEE Trans Comput 41:374\u2013379. doi: 10.1109\/12.127453","journal-title":"IEEE Trans Comput"},{"key":"225_CR5","doi-asserted-by":"crossref","unstructured":"Cho H, Jeong SW, Somenzi F, Pixley C (1993) Multiple observation time single reference test generation using synchronizing sequences. In: Proceedings of the 4th european conference on Design automation, 1993, with the european event in ASIC design, pp 494\u2013498. doi: 10.1109\/EDAC.1993.386426","DOI":"10.1109\/EDAC.1993.386426"},{"key":"225_CR6","unstructured":"David R, Alla H (2004) Discrete, continuous and hybrid Petri nets Springer-Verlag"},{"issue":"5","key":"225_CR7","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/j.ipl.2006.04.009","volume":"99","author":"R Devillers","year":"2006","unstructured":"Devillers R, Van Begin L (2006) Boundedness undecidability for synchronized nets. Inf Process Lett 99(5):208\u2013214. doi: 10.1016\/j.ipl.2006.04.009","journal-title":"Inf Process Lett"},{"issue":"3","key":"225_CR8","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/TSMCB.2008.917177","volume":"38","author":"Z Ding","year":"2008","unstructured":"Ding Z, Jiang C, Zhou M (2008) Deadlock checking for one-place unbounded Petri nets based on modified reachability trees. IEEE Trans Syst Man Cybern B Cybern 38(3):881\u2013883. doi: 10.1109\/TSMCB.2008.917177","journal-title":"IEEE Trans Syst Man Cybern B Cybern"},{"key":"225_CR9","first-page":"210","volume-title":"Papers from the 12th international conference on applications and theory of Petri nets: Advances in Petri nets 1993","author":"A Finkel","year":"1993","unstructured":"Finkel A (1993) The minimal coverability graph for Petri nets. In: Papers from the 12th international conference on applications and theory of Petri nets: Advances in Petri nets 1993. Springer, London, pp 210\u2013243"},{"issue":"02","key":"225_CR10","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1142\/S0129054110007180","volume":"21","author":"G Geeraerts","year":"2010","unstructured":"Geeraerts G, Raskin JF, Van Begin L (2010) On the efficient computation of the minimal coverability set for Petri nets. Int J Found Comput Sci 21(02):135\u2013165. doi: 10.1142\/S0129054110007180","journal-title":"Int J Found Comput Sci"},{"key":"225_CR11","doi-asserted-by":"crossref","first-page":"1033","DOI":"10.1016\/j.ic.2008.03.005","volume":"206","author":"H J\u00fcrgensen","year":"2008","unstructured":"J\u00fcrgensen H (2008) Synchronization. Inf Comput 206:1033\u20131044. 10.1016\/j.ic.2008.03.005 . http:\/\/dl.acm.org\/citation.cfm?id=1410483.1410835","journal-title":"Inf Comput"},{"issue":"2","key":"225_CR12","first-page":"270","volume":"8","author":"J Kari","year":"2002","unstructured":"Kari J (2002) Synchronization and stability of finite automata. J Universal Comput Sci 8(2):270\u2013277","journal-title":"J Universal Comput Sci"},{"issue":"2","key":"225_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0022-0000(69)80011-5","volume":"3","author":"RM Karp","year":"1969","unstructured":"Karp RM, Miller RE (1969) Parallel program schemata. J Comput Syst Sci 3(2):147\u2013195. doi: 10.1016\/S0022-0000(69)80011-5","journal-title":"J Comput Syst Sci"},{"issue":"8","key":"225_CR14","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D Lee","year":"1996","unstructured":"Lee D, Yannakakis M (1996) Principles and methods of testing finite state machine \u2013 a survey. Proc IEEE 84(8):1090\u20131123","journal-title":"Proc IEEE"},{"issue":"3","key":"225_CR15","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1145\/322261.322271","volume":"28","author":"EW Mayr","year":"1981","unstructured":"Mayr EW, Meyer AR (1981) The complexity of the finite containment problem for Petri nets. J ACM 28(3):561\u2013576. doi: 10.1145\/322261.322271","journal-title":"J ACM"},{"key":"225_CR16","first-page":"129","volume":"34","author":"EF Moore","year":"1956","unstructured":"Moore EF (1956) Gedanken-experiments on sequential machines. Automata Studies. Ann Math Stud 34:129\u2013153","journal-title":"Ann Math Stud"},{"issue":"4","key":"225_CR17","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T Murata","year":"1989","unstructured":"Murata T (1989) Petri nets: Properties, analysis and applications. Proc IEEE 77(4):541\u2013580. doi: 10.1109\/5.24143","journal-title":"Proc IEEE"},{"key":"225_CR18","first-page":"132","volume-title":"SFCS \u201986: Proc. of the 27th annual symposium on foundations of computer science","author":"BK Natarajan","year":"1986","unstructured":"Natarajan BK (1986) An algorithmic approach to the automated design of parts orienters. In: SFCS \u201986: Proc. of the 27th annual symposium on foundations of computer science. doi: 10.1109\/SFCS.1986.5 . IEEE Computer Society, Washington, pp 132\u2013142"},{"key":"225_CR19","unstructured":"Pocci M (2013) Test and diagnosis of discrete event systems using Petri nets. Ph.D. thesis, Aix-Marseille University & University of Cagliari. http:\/\/www.lsis.org\/poccim\/phd_thesis_marco_pocci.pdf"},{"key":"225_CR20","doi-asserted-by":"crossref","unstructured":"Pocci M, Demongodin I, Giambiasi N, Giua A (2013) A new algorithm to compute synchronizing sequences for synchronized Petri nets. In: IEEE Tencon conference for Region 10 (TENCON). Xi\u2019an, Shaanxi, China. doi: 10.1109\/TENCON.2013.6718970","DOI":"10.1109\/TENCON.2013.6718970"},{"issue":"1","key":"225_CR21","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1109\/TASE.2013.2290774","volume":"11","author":"M Pocci","year":"2014","unstructured":"Pocci M, Demongodin I, Giambiasi N, Giua A (2014a) Testing experiments on synchronized Petri nets. IEEE Trans Autom Sci Eng 11(1):125\u2013138. doi: 10.1109\/TASE.2013.2290774","journal-title":"IEEE Trans Autom Sci Eng"},{"key":"225_CR22","doi-asserted-by":"crossref","unstructured":"Pocci M, Demongodin I, Giambiasi N, Giua A (2014b) Testing experiments on unbounded systems: synchronizing sequences using Petri nets. In: WODES 14: 12th int. Workshop on discrete event systems. Cachan, France. doi: 10.3182\/20140514-3-FR-4046.00104 , pp 155\u2013161","DOI":"10.3182\/20140514-3-FR-4046.00104"},{"key":"225_CR23","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/978-3-642-21834-7_5","volume-title":"Proceedings of the 32nd international conference on applications and theory of Petri nets, Petri NETS\u201911","author":"PA Reynier","year":"2011","unstructured":"Reynier PA, Servais F (2011) Minimal coverability set for Petri nets: Karp and miller algorithm with pruning. In: Proceedings of the 32nd international conference on applications and theory of Petri nets, Petri NETS\u201911. Springer, Berlin, pp 69\u201388"},{"issue":"4","key":"225_CR24","doi-asserted-by":"crossref","first-page":"932","DOI":"10.1109\/TSMCA.2012.2226878","volume":"43","author":"S Wang","year":"2013","unstructured":"Wang S, Zhou M, Li Z, Wang C (2013) A new modified reachability tree approach and its applications to unbounded Petri nets. IEEE Trans Syst Man Cybern B Cybern 43(4):932\u2013940. doi: 10.1109\/TSMCA.2012.2226878","journal-title":"IEEE Trans Syst Man Cybern B Cybern"}],"container-title":["Discrete Event Dynamic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-016-0225-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10626-016-0225-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10626-016-0225-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:55Z","timestamp":1559246335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10626-016-0225-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,20]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["225"],"URL":"https:\/\/doi.org\/10.1007\/s10626-016-0225-6","relation":{},"ISSN":["0924-6703","1573-7594"],"issn-type":[{"value":"0924-6703","type":"print"},{"value":"1573-7594","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,20]]}}}