Approximating continuous systems by timed automata

36Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work we develop a new technique for over-approximating (in the sense of timed trace inclusion) continuous dynamical systems by timed automata. This technique refines commonly-used discrete abstractions which are often too coarse to be useful. The essence of our technique is the partition of the state space into cubes and the allocation of a clock for each dimension. This allows us to get much better approximations of the behavior. We specialize this technique to multi-affine systems, a class of nonlinear systems of primary importance for the analysis of biochemical systems and demonstrate its applicability on an example taken from synthetic biology. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Maler, O., & Batt, G. (2008). Approximating continuous systems by timed automata. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5054 LNBI, pp. 77–89). https://doi.org/10.1007/978-3-540-68413-8_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free