Generalized discrete timed automata: Decidable approximations for safety verification.
type: Item
instance of: scholarly article
title: Generalized discrete timed automata: Decidable approximations for safety verification.
zbMATH Open document ID: 1044.68086
DOI: 10.1016/S0304-3975(02)00432-2
author: Zhe Dang
author: Oscar H. Ibarra
author: Richard A. Kemmerer
published in: Theoretical Computer Science
publication date: 2003-08-17T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 1965289
zbMATH Keywords: \(r\)-reset-bounded approximation
zbMATH Keywords: \(B\)-bounded approximation
zbMATH Keywords: \(\langle B,r\rangle\)-crossing-bounded approximation
cites work: ASTRAL
cites work: Q4817528
cites work: Model-checking in dense real-time
cites work: A theory of timed automata
cites work: A really temporal logic
cites work: Parametric real-time reasoning
cites work: Q4270062
cites work: Q4551181
cites work: Q2754074
cites work: Q2762788
cites work: Symbolic model checking for real-time systems
cites work: Reversal-Bounded Multicounter Machines and Their Decision Problems
cites work: New Decidability Results Concerning Two-Way Counter Machines
cites work: Q4536378
cites work: From timed automata to logic — and back
cites work: Uppaal in a nutshell
cites work: Kronos: A verification tool for real-time systems
describes a project that uses: ASTRAL
describes a project that uses: Kronos
describes a project that uses: Uppaal
MaRDI profile type: Publication
full work available at URL: s0304-3975(02)00432-2
OpenAlex ID: W1964178654
description: scientific article; zbMATH DE number 1965289