On reachability of hybrid automata
E881564
"On reachability of hybrid automata" is a foundational research paper in formal verification and hybrid systems theory that investigates algorithmic methods for determining whether certain states can be reached in systems combining discrete and continuous dynamics.
All labels observed (1)
| Label | Occurrences |
|---|---|
| On reachability of hybrid automata canonical | 2 |
How this entity was disambiguated
This entity first appeared as the object of triple T10709442 — 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: On reachability of hybrid automata Context triple: [Oded Maler, coAuthorOf, On reachability of hybrid automata]
-
A.
From timed automata to hybrid systems
"From timed automata to hybrid systems" is a scholarly work that explores the extension of timed automata models to more general hybrid systems, integrating discrete and continuous dynamics in system verification and modeling.
-
B.
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.
-
C.
As soon as possible: Time optimal control for timed automata
"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.
-
D.
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.
-
E.
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.
- 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: On reachability of hybrid automata Target entity description: "On reachability of hybrid automata" is a foundational research paper in formal verification and hybrid systems theory that investigates algorithmic methods for determining whether certain states can be reached in systems combining discrete and continuous dynamics.
-
A.
From timed automata to hybrid systems
"From timed automata to hybrid systems" is a scholarly work that explores the extension of timed automata models to more general hybrid systems, integrating discrete and continuous dynamics in system verification and modeling.
-
B.
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.
-
C.
As soon as possible: Time optimal control for timed automata
"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.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Statements (41)
| Predicate | Object |
|---|---|
| instanceOf | research paper ⓘ |
| aim | to provide algorithmic methods for reachability in hybrid automata ⓘ |
| appliesTo |
models of physical systems with digital controllers
ⓘ
safety analysis of hybrid control systems ⓘ |
| contribution |
characterizes which reachability problems for hybrid automata are decidable
ⓘ
characterizes which reachability problems for hybrid automata are undecidable ⓘ establishes foundational results on reachability for classes of hybrid automata ⓘ introduces algorithmic techniques for reachability analysis in hybrid systems ⓘ |
| describes |
methods for determining whether certain states can be reached in hybrid systems
ⓘ
systems combining discrete and continuous dynamics ⓘ |
| field |
automata theory
ⓘ
control theory ⓘ formal verification ⓘ hybrid systems ⓘ theoretical computer science ⓘ |
| focus |
algorithmic techniques for subclasses of hybrid automata
ⓘ
theoretical limits of automatic verification for hybrid automata ⓘ |
| importance |
considered a foundational work in hybrid systems theory
ⓘ
widely cited in the formal verification community ⓘ |
| influencedField |
design of verification tools for hybrid systems
ⓘ
embedded and cyber-physical systems ⓘ model checking of hybrid systems ⓘ safety-critical systems verification ⓘ |
| problemAddressed |
automatic verification of safety properties in hybrid systems
ⓘ
whether a given set of states is reachable from an initial set ⓘ |
| studies |
computational properties of hybrid automata
ⓘ
reachability of states in systems with both discrete transitions and continuous flows ⓘ |
| title | On reachability of hybrid automata ⓘ |
| topic |
algorithmic verification
ⓘ
decidability ⓘ hybrid automata ⓘ reachability analysis ⓘ safety verification ⓘ state-space exploration ⓘ undecidability ⓘ verification of hybrid systems ⓘ |
| typeOfSystemStudied |
dynamical systems with mode-dependent differential constraints
ⓘ
systems with continuous variables and discrete modes ⓘ |
| usedIn |
academic research on hybrid systems
ⓘ
development of hybrid model checkers ⓘ theoretical foundations of cyber-physical system verification ⓘ |
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: On reachability of hybrid automata Description of subject: "On reachability of hybrid automata" is a foundational research paper in formal verification and hybrid systems theory that investigates algorithmic methods for determining whether certain states can be reached in systems combining discrete and continuous dynamics.
Referenced by (2)
Full triples — surface form annotated when it differs from this entity's canonical label.