{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,11]],"date-time":"2024-02-11T12:03:59Z","timestamp":1707653039863},"reference-count":16,"publisher":"Open Publishing Association","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. Proc. Theor. Comput. Sci.","EPTCS"],"DOI":"10.4204\/eptcs.10.1","type":"journal-article","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T18:49:29Z","timestamp":1258483769000},"page":"3-22","source":"Crossref","is-referenced-by-count":1,"title":["Dense-choice Counter Machines revisited"],"prefix":"10.4204","volume":"10","author":[{"given":"Florent","family":"Bouchy","sequence":"first","affiliation":[]},{"given":"Alain","family":"Finkel","sequence":"additional","affiliation":[]},{"given":"Pierluigi","family":"San Pietro","sequence":"additional","affiliation":[]}],"member":"2720","published-online":{"date-parts":[[2009,11,17]]},"reference":[{"key":"LHA","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-57318-6_30","article-title":"Hybrid Automata: An Algorithmic Approach to the Specification and Verification of Hybrid Systems","volume-title":"Hybrid Systems","volume":"736","author":"Rajeev Alur","year":"1992"},{"issue":"2","key":"alur94","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","article-title":"A Theory of Timed Automata","volume":"126","author":"Rajeev Alur","year":"1994","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"BFLP-sttt08","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s10009-008-0064-3","article-title":"FAST: Acceleration from theory to practice","volume":"10","author":"S\u00e9bastien Bardin","year":"2008","journal-title":"International Journal on Software Tools for Technology Transfer"},{"key":"BFS-infinity08","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"167","article-title":"Reachability in Timed Counter Systems","volume-title":"INFINITY'08","volume":"239C","author":"Florent Bouchy","year":"2009"},{"issue":"1","key":"BHR-ietc07","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/j.ic.2007.10.004","article-title":"Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences","volume":"206","author":"Patricia Bouyer","year":"2008","journal-title":"Information and Computation"},{"key":"iosif06","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/11787006_49","article-title":"Flat Parametric Counter Automata","volume-title":"ICALP (2)","volume":"4052","author":"Marius Bozga","year":"2006"},{"key":"CJ98","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/BFb0028751","article-title":"Multiple Counters Automata, Safety Analysis and Presburger Arithmetic","volume-title":"CAV","volume":"1427","author":"Hubert Comon","year":"1998"},{"key":"Dang03","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0304-3975(02)00743-0","article-title":"Pushdown Timed Automata: a Binary Reachability Characterization and Safety Verification","volume":"302","author":"Zhe Dang","year":"2003","journal-title":"Theoretical Computer Science"},{"key":"RealCounter","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/978-3-540-30538-5_17","article-title":"Real-Counter Automata and their Decision Problems","volume-title":"FSTTCS","volume":"3328","author":"Zhe Dang","year":"2004"},{"key":"DDFG-atva06","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/11901914_36","article-title":"Towards a Model-Checker for Counter Systems","volume-title":"ATVA'06","volume":"4218","author":"St\u00e9phane Demri","year":"2006"},{"issue":"2","key":"dotoli08","first-page":"408","article-title":"First-Order Hybrid Petri Nets. An application to distributed manufacturing systems","volume":"2","author":"Mariagrazia Dotoli","year":"2008","journal-title":"Nonlinear Analysis: Hybrid Sys."},{"issue":"1","key":"ibarra-reversal-78","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/322047.322058","article-title":"Reversal-Bounded Multicounter Machines and their Decision Problems","volume":"25","author":"Oscar H. Ibarra","year":"1978","journal-title":"J. ACM"},{"key":"Minsky67","volume-title":"Computation: Finite and Infinite Machines","author":"Marvin L. Minsky","year":"1967"},{"key":"RHS-atva07","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1007\/978-3-540-75596-8_26","article-title":"Continuous Petri Nets: Expressive Power and Decidability Issues","volume-title":"ATVA'07","volume":"4762","author":"Laura Recalde","year":"2007"},{"key":"Weispfenning99","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1145\/309831.309888","article-title":"Mixed Real-Integer Linear Quantifier Elimination.","volume-title":"ISSAC","author":"Volker Weispfenning","year":"1999"},{"key":"DenseCounter","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-3-540-45069-6_8","article-title":"Dense Counter Machines and Verification Problems","volume-title":"CAV","volume":"2725","author":"Gaoyan Xie","year":"2003"}],"container-title":["Electronic Proceedings in Theoretical Computer Science"],"original-title":[],"language":"en","deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T11:44:00Z","timestamp":1551008640000},"score":1,"resource":{"primary":{"URL":"http:\/\/arxiv.org\/abs\/0911.3405v1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11,17]]},"references-count":16,"URL":"https:\/\/doi.org\/10.4204\/eptcs.10.1","relation":{},"ISSN":["2075-2180"],"issn-type":[{"value":"2075-2180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,11,17]]}}}