{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:45Z","timestamp":1725664965971},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631392"},{"type":"electronic","value":"9783540691877"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63139-9_45","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:08:21Z","timestamp":1330297701000},"page":"348-366","source":"Crossref","is-referenced-by-count":2,"title":["Modeling and solving constraint satisfaction problems through Petri nets"],"prefix":"10.1007","author":[{"given":"Luigi","family":"Portinale","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,5]]},"reference":[{"key":"20_CR1","unstructured":"H. Anton and C. Rorres. Elementary Linear Algebra. John Wiley, 1991."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"L. Bernardinello and F. De Cindio. A survey of basic net models and modular net classes. In G. Rozenberg, editor, Advances in Petri Nets 1992, LNCS 609, pages 304\u2013351. Springer Verlag, 1992.","DOI":"10.1007\/3-540-55610-9_177"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"J.M. Colom and M. Silva. Convex geometry and semiflows in P-T nets: a comparative study of algorithms for computation of minimal semiflows. In Advances in Petri Nets 1990, LNCS 483, pages 79\u2013112. Springer Verlag, 1990.","DOI":"10.1007\/3-540-53863-1_22"},{"issue":"1","key":"20_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90002-6","volume":"34","author":"R. Dechter","year":"1988","unstructured":"R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34(1):1\u201338, 1988.","journal-title":"Artificial Intelligence"},{"key":"20_CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1002\/cta.4490080206","volume":"8","author":"J. deKleer","year":"1980","unstructured":"J. deKleer and G.J. Sussman. Propagation of constraints applied to circuit synthesis. Circuit Theory and Applications, 8:127\u2013144, 1980.","journal-title":"Circuit Theory and Applications"},{"key":"20_CR6","unstructured":"M.S. Fox, B. Allen, and G. Strohm. Job-shop scheduling: an investigation in constraint-directed reasoning. In Proc. 2nd AAAI 82, pages 155\u2013158, Pittsburgh, PA, 1982."},{"key":"20_CR7","unstructured":"H. Geffner and J. Pearl. An improved constraint propagation algorithm for diagnosis. In Proc 10th IJCAI, pages 1105\u20131111, Milano, 1987."},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(81)90113-4","volume":"13","author":"H.J. Genrich","year":"1981","unstructured":"H.J. Genrich and K. Lautenbach. System modeling with high level petri nets. Theoretical Computer Science, 13:109\u2013136, 1981.","journal-title":"Theoretical Computer Science"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(81)90049-9","volume":"14","author":"K. Jensen","year":"1981","unstructured":"K. Jensen. Coloured Petri Nets and the invariant method. Theoretical Computer Science, 14:317\u2013336, 1981.","journal-title":"Theoretical Computer Science"},{"key":"20_CR10","first-page":"32","volume":"1992","author":"V. Kumar","year":"1992","unstructured":"V. Kumar. Algorithms for constraint satisfaction problems: a survey. AI Magazine, Spring 1992:32\u201344, 1992.","journal-title":"AI Magazine, Spring"},{"issue":"1","key":"20_CR11","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A.K. Mackworth","year":"1977","unstructured":"A.K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8(1):99\u2013118, 1977.","journal-title":"Artificial Intelligence"},{"key":"20_CR12","unstructured":"A.K. Mackworth. On seeing things, again. In Proc. 8th IJCAI 83, pages 1187\u20131191, Karslruhe, GE, 1983."},{"key":"20_CR13","unstructured":"A.K. Mackworth. Constraint satisfaction. In S.C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 205\u2013211. John Wiley, 1990."},{"issue":"1","key":"20_CR14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","volume":"25","author":"A.K. Mackworth","year":"1984","unstructured":"A.K. Mackworth and E.C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfactions problems. Artificial Intelligence, 25(1):65\u201374, 1984.","journal-title":"Artificial Intelligence"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"J. Martinez and M. Silva. A simple and fast algorithm to obtain all invariants of a generalized Petri net. In W. Reisig C. Girault, editor, Informatik-Fachberichte, Applications and Theory of Petri Nets, pages 301\u2013310. Springer Verlag, 1982.","DOI":"10.1007\/978-3-642-68353-4_47"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"G. Memmi and G. Roucairol. Linear algebra in net theory. In Lecture Notes in Computer Science, volume 84, pages 213\u2013223. Springer Verlag, 1980.","DOI":"10.1007\/3-540-10001-6_24"},{"key":"20_CR17","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","volume":"7","author":"U. Montanari","year":"1974","unstructured":"U. Montanari. Networks of constraints: fundamental properties and applications to picture processing. Information Science, 7:95\u2013132, 1974.","journal-title":"Information Science"},{"issue":"4","key":"20_CR18","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/5.24143","volume":"77","author":"T. Murata","year":"1989","unstructured":"T. Murata. Petri nets: Properties, analysis and applications. Proceedings of the IEEE, 77(4):541\u2013580, 1989.","journal-title":"Proceedings of the IEEE"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"B. Nadel. Tree search and arc consistency in constraint satisfaction algorithms. In L Kanal and V. Kumar, editors, Search in Artificial Intelligence, pages 287\u2013342. Springer Verlag, 1988.","DOI":"10.1007\/978-1-4613-8788-6_9"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"B. Nadel and J. Lin. Automobile transmission design as a constraint satisfaction problem. In Artificial Intelligence for Engineering Design, Analysis and Manufactirung. 1991.","DOI":"10.1016\/B978-0-12-660561-7.50011-9"},{"key":"20_CR21","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(81)90007-2","volume":"16","author":"M. Stefik","year":"1981","unstructured":"M. Stefik. Planning with constraints. Artificial Intelligence, 16:111\u2013140, 1981.","journal-title":"Artificial Intelligence"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"N. Treves. A comparative study of different techniques for semi-flows computation in Place\/Transition nets. In Advances in Petri Nets 1989, pages 433\u2013452. LNCS 424, Springer Verlag, 1988.","DOI":"10.1007\/3-540-52494-0_40"}],"container-title":["Lecture Notes in Computer Science","Application and Theory of Petri Nets 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63139-9_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:16:03Z","timestamp":1605647763000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63139-9_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631392","9783540691877"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-63139-9_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}