Decidable Integration Graphs

Y. Kesten, A. Pnueli, J. Sifakis, S. Yovine

Research output: Contribution to journalArticlepeer-review

34 Scopus citations


Integration graphs are a computational model developed in the attempt to identify simple hybrid systems with decidable analysis problems. We start with the class of constant slope hybrid systems (CSHS), in which the right-hand side of all differential equations is an integer constant. We refer to continuous variables whose right-hand side constants are always 1 as timers. All other continuous variables are called integrators. The first result shown in the paper is that simple questions such as reachability of a given state are undecidable for even this simple class of systems. To restrict the model even further, we impose the requirement that no test that refers to integrators may appear within a loop in the graph. This restricted class of CSHS is called integration graphs. The main results of the paper are that the reachability problem of integration graphs is decidable for two special cases: the case of a single timer and the case of a single test involving integrators. The expressive power of the integration-graphs formalism is demonstrated by showing that some typical problems studied within the context of the calculus of durations and timed statecharts can be formulated as reachability problems for restricted integration graphs, and a high fraction of these fall into the subclasses of a single timer or a single test involving integrators.

Original languageEnglish
Pages (from-to)209-243
Number of pages35
JournalInformation and Computation
Issue number2
StatePublished - 1 May 1999

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics


Dive into the research topics of 'Decidable Integration Graphs'. Together they form a unique fingerprint.

Cite this