As soon as possible: Time optimal control for timed automata
E880524
"As soon as possible: Time optimal control for timed automata" is a research paper in formal methods and control theory that studies how to synthesize strategies achieving time-optimal behavior in systems modeled by timed automata.
All labels observed (1)
| Label | Occurrences |
|---|---|
| As soon as possible: Time optimal control for timed automata canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10709440 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: As soon as possible: Time optimal control for timed automata Context triple: [Oded Maler, coAuthorOf, As soon as possible: Time optimal control for timed automata]
-
A.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
B.
branching-time temporal logic CTL*
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
-
C.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
D.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
E.
hybrid automata
Hybrid automata are mathematical models used in computer science and control theory to describe systems that exhibit both continuous dynamics and discrete transitions, such as embedded or cyber-physical systems.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: As soon as possible: Time optimal control for timed automata Target entity description: "As soon as possible: Time optimal control for timed automata" is a research paper in formal methods and control theory that studies how to synthesize strategies achieving time-optimal behavior in systems modeled by timed automata.
-
A.
Temporal Verification of Reactive Systems
"Temporal Verification of Reactive Systems" is a foundational book in formal methods that presents rigorous techniques for specifying and verifying the correctness of reactive and concurrent systems using temporal logic.
-
B.
branching-time temporal logic CTL*
Branching-time temporal logic CTL* is a highly expressive formalism in computer science used to specify and reason about the behavior of concurrent and reactive systems over branching time structures.
-
C.
Symbolic Model Checking
Symbolic Model Checking is a formal verification technique that uses symbolic representations, such as binary decision diagrams, to efficiently verify properties of hardware and software systems with very large state spaces.
-
D.
Model Checking (book)
"Model Checking" is a foundational textbook that systematically presents the theory and practice of using automated verification techniques to prove correctness properties of hardware and software systems.
-
E.
hybrid automata
Hybrid automata are mathematical models used in computer science and control theory to describe systems that exhibit both continuous dynamics and discrete transitions, such as embedded or cyber-physical systems.
- F. None of above. chosen
Statements (41)
| Predicate | Object |
|---|---|
| instanceOf | research paper ⓘ |
| addresses |
control of systems with clocks and timing constraints
ⓘ
synthesis of controllers that minimize time to reach a goal ⓘ time-optimal behavior in timed systems ⓘ |
| aimsTo |
compute optimal strategies under timing constraints
ⓘ
minimize time to satisfy a specification ⓘ |
| analyzes |
optimal paths in timed transition systems
ⓘ
reachability times in timed automata ⓘ |
| appliesTo |
reactive systems with timing constraints
ⓘ
real-time systems ⓘ |
| assumes | systems modeled with clocks and clock constraints ⓘ |
| concerns |
controller-environment interaction in timed settings
ⓘ
quantitative properties of timed systems ⓘ |
| contributesTo |
methods for automatic controller synthesis
ⓘ
theory of timed games ⓘ |
| dealsWith |
optimization in formal models
ⓘ
quantitative verification ⓘ |
| field |
control theory
ⓘ
formal methods ⓘ theoretical computer science ⓘ |
| focusesOn |
controller synthesis for real-time systems
ⓘ
optimal scheduling in timed models ⓘ reachability under timing constraints ⓘ synthesizing time-optimal strategies ⓘ |
| keywords |
formal verification
ⓘ
real-time systems ⓘ strategy synthesis ⓘ time-optimal control ⓘ timed automata ⓘ |
| proposes | algorithms for time-optimal strategy synthesis ⓘ |
| relatedTo |
game theory on timed automata
ⓘ
model checking ⓘ optimal control ⓘ scheduling theory ⓘ verification of real-time systems ⓘ |
| studies |
strategy synthesis
ⓘ
time-optimal control problems ⓘ timed automata ⓘ |
| typeOfResult |
algorithmic
ⓘ
theoretical ⓘ |
| usesModel | timed automata ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: As soon as possible: Time optimal control for timed automata Description of subject: "As soon as possible: Time optimal control for timed automata" is a research paper in formal methods and control theory that studies how to synthesize strategies achieving time-optimal behavior in systems modeled by timed automata.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.