What's decidable about hybrid automata?
type: Item
instance of: scholarly article
title: What's decidable about hybrid automata?
zbMATH Open document ID: 0920.68091
author: Thomas A. Henzinger
author: Peter W. Kopke
author: Anuj Puri
author: Pravin Varaiya
published in: Journal of Computer and System Sciences
publication date: 1999-01-06T00:00:00Z
full work available at URL: https://hdl.handle.net/1813/7198
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1236452
zbMATH Keywords: hybrid automata model
zbMATH Keywords: reachability problem
describes a project that uses: HyTech
MaRDI profile type: Publication
OpenAlex ID: W2085838366
cites work: The algorithmic analysis of hybrid systems
cites work: A theory of timed automata
cites work: Parametric real-time reasoning
cites work: HyTech: A model checker for hybrid systems
cites work: Algorithmic analysis of nonlinear hybrid systems
cites work: What good are digital clocks?
cites work: Symbolic model checking for real-time systems
cites work: Formal methods for industrial applications. Specification and programming the Steam Boiler Control
cites work: Forward and backward simulations. II: Timing-based systems
DOI: 10.1006/JCSS.1998.1581
description: scientific article; zbMATH DE number 1236452