Triple

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).

Phrase: As soon as possible: Time optimal control for timed automata | Statement: [Oded Maler, coAuthorOf, As soon as possible: Time optimal control for timed automata]

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.

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]"

Entity: As soon as possible: Time optimal control for timed automata
Triple: [Oded Maler, coAuthorOf, 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.

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