{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:09:25Z","timestamp":1750306165177,"version":"3.41.0"},"reference-count":22,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2017,1,16]],"date-time":"2017-01-16T00:00:00Z","timestamp":1484524800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2017,5,31]]},"abstract":"<jats:p>\n            We propose and extend an approach for the verification of safety properties for parameterized timed systems modeled as networks of timed automata. For this task, we introduce an incremental workflow that is based on our algorithm\n            <jats:italic>IC3 with Zones<\/jats:italic>\n            . It proceeds in a cycle in which single models of the system are verified, and the verification results are employed for the reasoning about the entire system. Starting with the smallest instances, the verification of the safety property is carried out fast and efficient. On successful verification, the algorithm produces an inductive strengthening of the safety property. We reuse this result and try to reason about the entire parameterized timed system. To this end, we extrapolate the inductive strengthening into a candidate for the next-larger model. In case this candidate is a valid inductive strengthening for the next larger model, our main theorem reasons about all models of the parameterized timed system, stating that the safety property holds true for all models. Otherwise, the main cycle starts over with the verification of the next larger model. This workflow is iterated indefinitely, until able to reason about the entire parameterized timed system, until a counterexample trace is found, or until the single models become too large to be handled in the verification. We reuse the intermediate results in a\n            <jats:italic>Feedback<\/jats:italic>\n            -loop in order to accelerate the verification runs for the single models. Furthermore, we consider an extended formalism in comparison to our previous publications.\n          <\/jats:p>","DOI":"10.1145\/2984640","type":"journal-article","created":{"date-parts":[[2017,1,17]],"date-time":"2017-01-17T13:42:08Z","timestamp":1484660528000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Incremental Inductive Verification of Parameterized Timed Systems"],"prefix":"10.1145","volume":"16","author":[{"given":"Tobias","family":"Isenberg","sequence":"first","affiliation":[{"name":"Universit\u00e4t Paderborn, Paderborn, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,1,16]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/1018438.1021871"},{"volume-title":"Timed automata","series-title":"Lecture Notes in Computer Science","author":"Alur Rajeev","key":"e_1_2_1_2_1"},{"volume-title":"Automata, Languages and Programming","author":"Alur Rajeev","key":"e_1_2_1_3_1"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)90010-8"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(86)90071-2"},{"volume-title":"Proceedings of the 13th International Conference on Computer Aided Verification (CAV \u201901)","author":"Arons Tamarah","key":"e_1_2_1_6_1"},{"volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Behrmann Gerd","key":"e_1_2_1_7_1"},{"volume-title":"Proceedings of the Workshop on Verification and Control of Hybrid Systems III(LNCS). Springer--Verlag, 232--243","year":"1995","author":"Bengtsson Johan","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1946284.1946291"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28891-3_28"},{"volume-title":"Incremental formal verification of hardware","author":"Chockler Hana","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/2157654.2157675"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00165-008-0089-0"},{"volume":"2791","volume-title":"Formal Modeling and Analysis of Timed Systems: 1st International Workshop (FORMATS\u201903)","author":"Hendriks Martijn","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSD.2015.13"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11737-9_14"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30793-5_2"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14295-6_55"},{"volume-title":"CONCUR 2002 Concurrency Theory, Lubo Brim, Mojmr Ketnsk, Antonn Kuera, and Petr Janar (Eds.)","series-title":"Lecture Notes in Computer Science","author":"Kesten Yonit","key":"e_1_2_1_21_1"},{"volume-title":"Fundamentals of Computation Theory","author":"Larsen Kim G.","key":"e_1_2_1_22_1"},{"volume-title":"Proceedings of the Real-Time Systems Symposium. 2--11","author":"Nancy","key":"e_1_2_1_23_1"},{"volume-title":"A Calculus of Communicating Systems","series-title":"Lecture Notes in Computer Science","author":"Milner Robin","key":"e_1_2_1_24_1"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2984640","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2984640","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:39:58Z","timestamp":1750217998000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2984640"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,16]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5,31]]}},"alternative-id":["10.1145\/2984640"],"URL":"https:\/\/doi.org\/10.1145\/2984640","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2017,1,16]]},"assertion":[{"value":"2016-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-01-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}