The Theory of Timed I/O Automata
E1452101
UNEXPLORED
The Theory of Timed I/O Automata is a formal framework in theoretical computer science for modeling, specifying, and verifying real-time, interactive distributed systems using automata with explicit timing and input/output behavior.
All labels observed (1)
| Label | Occurrences |
|---|---|
| The Theory of Timed I/O Automata canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T20836680 — 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: The Theory of Timed I/O Automata Context triple: [Nancy Lynch, notableWork, The Theory of Timed I/O 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.
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.
-
C.
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.
-
D.
The Temporal Logic of Programs
The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
-
E.
On reachability of hybrid automata
"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.
- 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: The Theory of Timed I/O Automata Target entity description: The Theory of Timed I/O Automata is a formal framework in theoretical computer science for modeling, specifying, and verifying real-time, interactive distributed systems using automata with explicit timing and input/output behavior.
-
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.
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.
-
C.
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.
-
D.
The Temporal Logic of Programs
The Temporal Logic of Programs is a landmark 1977 paper by Amir Pnueli that introduced temporal logic as a formal framework for specifying and verifying the behavior of concurrent and reactive computer programs.
-
E.
On reachability of hybrid automata
"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.
- F. None of above. chosen
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.