Decidable integration graphs.
type: Item
instance of: scholarly article
title: Decidable integration graphs.
zbMATH Open document ID: 1045.68566
author: Amir Pnueli
author: Yonit Kesten
author: Joseph Sifakis
author: Sergio Yovine
published in: Information and Computation
publication date: 2003-01-14T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 68Q60
zbMATH DE Number: 1853037
zbMATH Keywords: reachability
describes a project that uses: Kronos
MaRDI profile type: Publication
OpenAlex ID: W1979561589
cites work: The algorithmic analysis of hybrid systems
cites work: A theory of timed automata
cites work: Real-time logics: Complexity and expressiveness
cites work: Reachability analysis of dynamical systems having piecewise-constant derivatives
cites work: Symbolic model checking: \(10^{20}\) states and beyond
cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications
cites work: A calculus of durations
cites work: Q4234084
cites work: What good are digital clocks?
cites work: From ATP to timed graphs and hybrid systems
cites work: On the complexity of integer programming
DOI: 10.1006/INCO.1998.2774
description: scientific article; zbMATH DE number 1853037