A theory of timed automata
type: Item
instance of: scholarly article
title: A theory of timed automata
zbMATH Open document ID: 0803.68071
DOI: 10.1016/0304-3975(94)90010-8
author: Rajeev Alur
author: David L. Dill
published in: Theoretical Computer Science
publication date: 1994-05-05T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 562575
zbMATH Keywords: timed language
zbMATH Keywords: undecidability
zbMATH Keywords: Büchi automata
zbMATH Keywords: modeling of time
zbMATH Keywords: behavior of real-time systems
zbMATH Keywords: timed automata
zbMATH Keywords: nondeterministic timed automata
zbMATH Keywords: deterministic timed Muller automata
zbMATH Keywords: PSPACE-complete
zbMATH Keywords: verification
MaRDI profile type: Publication
full work available at URL: 0304-3975(94)90010-8
OpenAlex ID: W2101508170
cites work: Q4036557
cites work: The benefits of relaxing punctuality
cites work: Q5525343
cites work: Symbolic model checking: \(10^{20}\) states and beyond
cites work: Theories of automata on \(\omega\)-tapes: a simplified approach
cites work: A unified approach for showing language inclusion and equivalence between various types of \(\omega\)-automata
cites work: Automatic verification of finite-state concurrent systems using temporal logic specifications
cites work: Q4037392
cites work: Using branching time temporal logic to synthesize synchronization skeletons
cites work: Q4037378
cites work: Propositional dynamic logic of nonregular programs
cites work: Communicating sequential processes
cites work: Q3862379
cites work: A Graph-Theoretic Approach for Timing Analysis and its Implementation
cites work: Complementing deterministic Büchi automata in polynomial time
cites work: Testing and generating infinite sequences by a finite automaton
cites work: Q3746875
cites work: Q5573961
cites work: The complementation problem for Büchi automata with applications to temporal logic
cites work: Q4385530
cites work: Temporal logic can be more expressive
description: scientific article; zbMATH DE number 562575