Triple

T20836680
Position Surface form Disambiguated ID Type / Status
Subject Nancy Lynch E512975 entity
Predicate notableWork P4 FINISHED
Object The Theory of Timed I/O Automata
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.
E1452101 NE FINISHED

How this triple was built (4 steps)

Every LLM step that produced this triple, in pipeline order — named-entity classification, the disambiguation choices (the exact options shown, with the pick highlighted), and the generated description. The batch + timestamp of each is in the Provenance table below.

NER Named-entity recognition gpt-5-mini
Instruction
Given a phrase, classify it is english named entity (e.g., persons, organizations, works of art) in Latin script, or not (e.g., literals, dates, URLs, verbose phrases). For disambiguation, the statement where the phrase occurs as object is also given. Please return a JSON object with `phrase` (string, the phrase being analyzed) and `is_ne` (boolean, indicating whether the phrase is a Named Entity).
Input
Phrase: The Theory of Timed I/O Automata | Statement: [Nancy Lynch, notableWork, The Theory of Timed I/O Automata]
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.
NEDg Description generation gpt-5.1
Instruction
Generate a one-sentence description of the target entity. 
You are given a context triple in the form (subject, predicate, object), where the object is the target entity. 
# Instructions
Use the triple to infer relevant information about the entity. Describe the entity based on what is most defining, well-known. 
Avoid repeating the information from the triple, unless really essential.
# Response Format
Return only the sentence: "Description: [one-sentence description of the target entity]"
Input
Entity: The Theory of Timed I/O Automata
Triple: [Nancy Lynch, notableWork, The Theory of Timed I/O Automata]
Generated 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.
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

Provenance (5 batches)

The batch behind each pipeline step, in order, with when it ran. Timestamps are batch-level — stages were processed in waves, so the object chain (NER → NED1 → NEDg → NED2) reads in order, but predicate / elicitation batches can sit in a different wave.

Step Stage Batch ID Status When
creating Elicitation batch_69e0b4cf62a88190bbf92351e9e57259 completed April 16, 2026, 10:07 a.m.
NER Named-entity recognition batch_69e6c326daec8190bd4caa41a4b38833 completed April 21, 2026, 12:21 a.m.
NED1 Entity disambiguation (via context triple) batch_6a090084a1c481909a344ee40d846b10 completed May 16, 2026, 11:40 p.m.
NEDg Description generation batch_6a0900fd590c8190b42faa5c5191189a completed May 16, 2026, 11:42 p.m.
NED2 Entity disambiguation (via description) batch_6a0901950c1c8190befa72dc20236b9e completed May 16, 2026, 11:45 p.m.
Created at: April 16, 2026, 12:42 p.m.