{"date_created":"2018-12-11T12:00:26Z","abstract":[{"text":"The notion of delays arises naturally in many computational models, such as, in the design of circuits, control systems, and dataflow languages. In this work, we introduce automata with delay blocks (ADBs), extending finite state automata with variable time delay blocks, for deferring individual transition output symbols, in a discrete-time setting. We show that the ADB languages strictly subsume the regular languages, and are incomparable in expressive power to the context-free languages. We show that ADBs are closed under union, concatenation and Kleene star, and under intersection with regular languages, but not closed under complementation and intersection with other ADB languages. We show that the emptiness and the membership problems are decidable in polynomial time for ADBs, whereas the universality problem is undecidable. Finally we consider the linear-time model checking problem, i.e., whether the language of an ADB is contained in a regular language, and show that the model checking problem is PSPACE-complete. Copyright 2012 ACM.","lang":"eng"}],"date_published":"2012-10-01T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23"},{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"267989","name":"Quantitative Reactive Modeling"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications"}],"year":"2012","doi":"10.1145/2380356.2380370","publisher":"ACM","publication":"roceedings of the tenth ACM international conference on Embedded software","oa_version":"Preprint","month":"10","day":"01","publist_id":"3799","title":"Finite automata with time delay blocks","language":[{"iso":"eng"}],"acknowledgement":"This work has been financially supported in part by the European Commission FP7-ICT Cognitive Systems, Interaction, and Robotics under the contract # 270180 (NOPTILUS); by Fundacao para Ciencia e Tecnologia under project PTDC/EEA-CRO/104901/2008 (Modeling and control of Networked vehicle systems in persistent autonomous operations); by Austrian Science Fund (FWF) Grant No P 23499-N23 on Modern Graph Algorithmic Techniques in Formal Verification; FWF NFN Grant No S11407-N23 (RiSE); ERC Start grant (279307: Graph Games); Microsoft faculty fellows award; ERC Advanced grant QUAREM; and FWF Grant No S11403-N23 (RiSE).","quality_controlled":"1","main_file_link":[{"url":"http://arxiv.org/abs/1207.7019","open_access":"1"}],"conference":{"end_date":"2012-10-12","location":"Tampere, Finland","start_date":"2012-10-07","name":"EMSOFT: Embedded Software "},"status":"public","publication_status":"published","author":[{"last_name":"Chatterjee","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"},{"full_name":"Prabhu, Vinayak","last_name":"Prabhu","first_name":"Vinayak"}],"ec_funded":1,"page":"43 - 52","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"type":"conference","scopus_import":1,"date_updated":"2021-01-12T07:39:53Z","citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2012). Finite automata with time delay blocks. In <i>roceedings of the tenth ACM international conference on Embedded software</i> (pp. 43–52). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Finite automata with time delay blocks,” in <i>roceedings of the tenth ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 43–52.","ama":"Chatterjee K, Henzinger TA, Prabhu V. Finite automata with time delay blocks. In: <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>. ACM; 2012:43-52. doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Finite Automata with Time Delay Blocks.” In <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, 43–52. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380370\">https://doi.org/10.1145/2380356.2380370</a>.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2012. Finite automata with time delay blocks. roceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 43–52.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, in:, Roceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 43–52.","mla":"Chatterjee, Krishnendu, et al. “Finite Automata with Time Delay Blocks.” <i>Roceedings of the Tenth ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 43–52, doi:<a href=\"https://doi.org/10.1145/2380356.2380370\">10.1145/2380356.2380370</a>."},"_id":"2936","oa":1}