{"citation":{"mla":"Preußig, Jörg, et al. “An Algorithm for the Approximative Analysis of Rectangular Automata.” <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i>, vol. 1486, Springer, 1998, pp. 228–40, doi:<a href=\"https://doi.org/10.1007/BFb0055350\">10.1007/BFb0055350</a>.","ista":"Preußig J, Kowalewski S, Wong Toi H, Henzinger TA. 1998. An algorithm for the approximative analysis of rectangular automata. Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. FTRTFT: Formal Techniques in Real-Time and Fault-Tolerant Systems, LNCS, vol. 1486, 228–240.","ieee":"J. Preußig, S. Kowalewski, H. Wong Toi, and T. A. Henzinger, “An algorithm for the approximative analysis of rectangular automata,” in <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i>, Lyngby, Denmark, 1998, vol. 1486, pp. 228–240.","short":"J. Preußig, S. Kowalewski, H. Wong Toi, T.A. Henzinger, in:, Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Springer, 1998, pp. 228–240.","chicago":"Preußig, Jörg, Stefan Kowalewski, Howard Wong Toi, and Thomas A Henzinger. “An Algorithm for the Approximative Analysis of Rectangular Automata.” In <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i>, 1486:228–40. Springer, 1998. <a href=\"https://doi.org/10.1007/BFb0055350\">https://doi.org/10.1007/BFb0055350</a>.","ama":"Preußig J, Kowalewski S, Wong Toi H, Henzinger TA. An algorithm for the approximative analysis of rectangular automata. In: <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i>. Vol 1486. Springer; 1998:228-240. doi:<a href=\"https://doi.org/10.1007/BFb0055350\">10.1007/BFb0055350</a>","apa":"Preußig, J., Kowalewski, S., Wong Toi, H., &#38; Henzinger, T. A. (1998). An algorithm for the approximative analysis of rectangular automata. In <i>Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems</i> (Vol. 1486, pp. 228–240). Lyngby, Denmark: Springer. <a href=\"https://doi.org/10.1007/BFb0055350\">https://doi.org/10.1007/BFb0055350</a>"},"month":"01","publication":"Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems","scopus_import":"1","volume":1486,"extern":"1","publication_status":"published","acknowledgement":"This research was supported in part by the ONR YIP award N00014-95-1-0520, by the NSF CAREER award CCR-9501708, by the NSF grant CCR-9504469, by the DARPA/NASA grant NAG2-1214, by the ARO MURI grant DAAH-04-96-1-0341, and by the SRC contract 97-DC-324.041.","status":"public","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-08-24T12:01:57Z","author":[{"last_name":"Preußig","first_name":"Jörg","full_name":"Preußig, Jörg"},{"full_name":"Kowalewski, Stefan","first_name":"Stefan","last_name":"Kowalewski"},{"full_name":"Wong Toi, Howard","first_name":"Howard","last_name":"Wong Toi"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"}],"alternative_title":["LNCS"],"quality_controlled":"1","doi":"10.1007/BFb0055350","_id":"4410","year":"1998","publisher":"Springer","publist_id":"320","type":"conference","oa_version":"None","date_published":"1998-01-01T00:00:00Z","conference":{"name":"FTRTFT: Formal Techniques in Real-Time and Fault-Tolerant Systems","location":"Lyngby, Denmark","end_date":"1998-09-18","start_date":"1998-09-14"},"abstract":[{"text":"Rectangular automata are well suited for approximate modeling of continuous-discrete systems. The exact analysis of these automata is feasible for small examples but can encounter severe numerical problems for even medium-sized systems. This paper presents an analysis algorithm that uses conservative overapproximation to avoid these numerical problems. The algorithm is demonstrated on a simple benchmark system consisting of two connected tanks.\r\nSupported by the German Research Council (DFG) under grant Ko1430/3 in the special program KONDISK (‘Continuous-discrete dynamics of technical systems’).","lang":"eng"}],"title":"An algorithm for the approximative analysis of rectangular automata","article_processing_charge":"No","language":[{"iso":"eng"}],"date_created":"2018-12-11T12:08:43Z","publication_identifier":{"isbn":["9783540650034"]},"intvolume":"      1486","day":"01","page":"228 - 240"}