An algorithm for the approximative analysis of rectangular automata
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.
Download
No fulltext has been uploaded. References only!
Conference Paper
| Published
| English
Scopus indexed
Author
Preußig, Jörg;
Kowalewski, Stefan;
Wong Toi, Howard;
Henzinger, Thomas AISTA 
Series Title
LNCS
Abstract
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.
Supported by the German Research Council (DFG) under grant Ko1430/3 in the special program KONDISK (‘Continuous-discrete dynamics of technical systems’).
Publishing Year
Date Published
1998-01-01
Proceedings Title
Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
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.
Volume
1486
Page
228 - 240
Conference
FTRTFT: Formal Techniques in Real-Time and Fault-Tolerant Systems
Conference Location
Lyngby, Denmark
Conference Date
1998-09-14 – 1998-09-18
ISBN
IST-REx-ID
Cite this
Preußig J, Kowalewski S, Wong Toi H, Henzinger TA. An algorithm for the approximative analysis of rectangular automata. In: Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems. Vol 1486. Springer; 1998:228-240. doi:10.1007/BFb0055350
Preußig, J., Kowalewski, S., Wong Toi, H., & Henzinger, T. A. (1998). An algorithm for the approximative analysis of rectangular automata. In Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems (Vol. 1486, pp. 228–240). Lyngby, Denmark: Springer. https://doi.org/10.1007/BFb0055350
Preußig, Jörg, Stefan Kowalewski, Howard Wong Toi, and Thomas A Henzinger. “An Algorithm for the Approximative Analysis of Rectangular Automata.” In Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, 1486:228–40. Springer, 1998. https://doi.org/10.1007/BFb0055350.
J. Preußig, S. Kowalewski, H. Wong Toi, and T. A. Henzinger, “An algorithm for the approximative analysis of rectangular automata,” in Proceedings of the 5th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems, Lyngby, Denmark, 1998, vol. 1486, pp. 228–240.
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.
Preußig, Jörg, et al. “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, vol. 1486, Springer, 1998, pp. 228–40, doi:10.1007/BFb0055350.
Google Scholar
ISBN Search