{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T04:26:52Z","timestamp":1781756812095,"version":"3.54.5"},"reference-count":27,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/lics.2017.8005068","type":"proceedings-article","created":{"date-parts":[[2017,8,10]],"date-time":"2017-08-10T20:43:24Z","timestamp":1502397804000},"page":"1-12","source":"Crossref","is-referenced-by-count":12,"title":["Logics for continuous reachability in Petri nets and vector addition systems with states"],"prefix":"10.1109","author":[{"given":"Michael","family":"Blondin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Haase","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.1996.561359"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08867-9_40"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-40229-1_35"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(85)90076-6"},{"key":"ref14","author":"greenlaw","year":"1995","journal-title":"Limits to Parallel Computation P-Completeness Theory"},{"key":"ref15","first-page":"1093","article-title":"A polynomial algorithm in linear programming","volume":"244","author":"khachiyan","year":"1979","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"ref16","author":"papadimitriou","year":"1982","journal-title":"Combinatorial Optimization Algorithms and Complexity"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00031-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00177-8"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-8(4:5)2012"},{"key":"ref4","first-page":"275","article-title":"Continuous Petri nets","author":"david","year":"1987","journal-title":"Proc Application and Theory of Petri Nets"},{"key":"ref27","first-page":"50:1","article-title":"Minkowski games","volume":"66","author":"le roux","year":"2017","journal-title":"Proceedings of Symposium on Theoretical Aspects of Computer Science STACS"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-319-11439-2_9","article-title":"Integer vector addition systems with states","volume":"8762","author":"haase","year":"2014","journal-title":"Proc Reachability Problems RP ser Lect Notes Comp Sci"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2015-1168","article-title":"Complexity analysis of continuous Petri nets","volume":"137","author":"fraca","year":"2015","journal-title":"Fundam Inform"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10669-9"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90041-0"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49674-9_28"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LICS.2015.16"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45994-3_6"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/800113.803630"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/11532231_25"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2185632.2185647"},{"key":"ref21","article-title":"Structurally cyclic Petri nets","volume":"11","author":"drewes","year":"2015","journal-title":"Log Meth Comput Sci"},{"key":"ref24","first-page":"387","article-title":"Model checking timed automata with one or two clocks","volume":"3170","author":"laroussinie","year":"2004","journal-title":"Proc Concurrency Theory CONCUR ser Lect Notes Comp Sci"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.843874"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1613\/jair.3531","article-title":"Local consistency and SAT-solvers","volume":"43","author":"jeavons","year":"2012","journal-title":"J Artif Intell Res"},{"key":"ref25","author":"minsky","year":"1967","journal-title":"Computation Finite and Infinite Machines"}],"event":{"name":"2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)","location":"Reykjavik, Iceland","start":{"date-parts":[[2017,6,20]]},"end":{"date-parts":[[2017,6,23]]}},"container-title":["2017 32nd Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7999337\/8005055\/08005068.pdf?arnumber=8005068","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T21:13:54Z","timestamp":1602710034000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8005068\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/lics.2017.8005068","relation":{},"subject":[],"published":{"date-parts":[[2017,6]]}}}