Cited By
View all- Arcile JAndré É(2022)Timed Automata as a Formalism for Expressing Security: A Survey on Theory and PracticeACM Computing Surveys10.1145/353496755:6(1-36)Online publication date: 19-May-2022
Corrections to “A Menagerie of Timed Automata”
Article No.: 42, Pages 1 - 8
Abstract
This note corrects a technical error in the ACM Computing Surveys article mentioned in the title. The flaw involved constructions for showing that timed automata with urgent locations have the same expressiveness as timed automata that allow false location invariants. Corrected constructions are presented in this note, and the affected results are reproved.
Reference
[1]
Peter Fontana and Rance Cleaveland. 2014. A menagerie of timed automata. Comput. Surv. 46, 3 (Jan. 2014), 40:1--40:56.
Index Terms
- Corrections to “A Menagerie of Timed Automata”
Recommendations
Interrupt Timed Automata: verification and expressiveness
We introduce the class of Interrupt Timed Automata (ITA), a subclass of hybrid automata well suited to the description of timed multi-task systems with interruptions in a single processor environment.
While the reachability problem is undecidable for ...
Alternating timed automata
A notion of alternating timed automata is proposed. It is shown that such automata with only one clock have decidable emptiness problem over finite words. This gives a new class of timed languages that is closed under boolean operations and which has an ...
Undecidable problems about timed automata
FORMATS'06: Proceedings of the 4th international conference on Formal Modeling and Analysis of Timed SystemsWe solve some decision problems for timed automata which were raised by S. Tripakis in [Tri04] and by E. Asarin in [Asa04]. In particular, we show that one cannot decide whether a given timed automaton is determinizable or whether the complement of a ...
Comments
Information & Contributors
Information
Published In
May 2018
550 pages
Copyright © 2017 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 29 June 2017
Accepted: 01 April 2017
Revised: 01 July 2016
Received: 01 August 2015
Published in CSUR Volume 50, Issue 3
Check for updates
Author Tags
Qualifiers
- Survey
- Research
- Refereed
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- View Citations1Total Citations
- 276Total Downloads
- Downloads (Last 12 months)9
- Downloads (Last 6 weeks)0
Reflects downloads up to 31 Jan 2025
Other Metrics
Citations
Cited By
View all- Arcile JAndré É(2022)Timed Automata as a Formalism for Expressing Security: A Survey on Theory and PracticeACM Computing Surveys10.1145/353496755:6(1-36)Online publication date: 19-May-2022
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in