Robust satisfaction of temporal logic over real-valued signals
E880525
"Robust satisfaction of temporal logic over real-valued signals" is a research paper that extends temporal logic semantics to quantify how strongly or weakly real-valued signals satisfy temporal specifications, enabling more resilient verification and analysis of continuous and hybrid systems.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Robust satisfaction of temporal logic over real-valued signals canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10709441 — 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: Robust satisfaction of temporal logic over real-valued signals Context triple: [Oded Maler, coAuthorOf, Robust satisfaction of temporal logic over real-valued signals]
-
A.
linear temporal logic
Linear temporal logic is a modal temporal logic used in computer science and formal methods to specify and reason about the behavior of systems over linear sequences of time, using operators that describe how properties evolve in the future.
-
B.
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.
-
C.
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.
-
D.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
E.
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.
- 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: Robust satisfaction of temporal logic over real-valued signals Target entity description: "Robust satisfaction of temporal logic over real-valued signals" is a research paper that extends temporal logic semantics to quantify how strongly or weakly real-valued signals satisfy temporal specifications, enabling more resilient verification and analysis of continuous and hybrid systems.
-
A.
linear temporal logic
Linear temporal logic is a modal temporal logic used in computer science and formal methods to specify and reason about the behavior of systems over linear sequences of time, using operators that describe how properties evolve in the future.
-
B.
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.
-
C.
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.
-
D.
Temporal Logic of Actions
Temporal Logic of Actions is a formal framework for specifying and reasoning about concurrent and distributed systems using temporal logic to describe system behaviors over time.
-
E.
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.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf | research paper ⓘ |
| appliesTo |
continuous-time signals
ⓘ
discrete-time signals ⓘ real-valued trajectories of dynamical systems ⓘ |
| assumes | signals take values in real numbers ⓘ |
| characterizes |
robustness margins for satisfaction of temporal properties
ⓘ
robustness margins for violation of temporal properties ⓘ |
| contributesTo |
design of robust controllers from temporal specifications
ⓘ
falsification and testing of control systems ⓘ monitoring of temporal properties in cyber-physical systems ⓘ |
| defines | robust satisfaction measure for temporal logic formulas ⓘ |
| enables |
measuring how strongly a signal satisfies a temporal specification
ⓘ
measuring how strongly a signal violates a temporal specification ⓘ robust verification of continuous systems ⓘ robust verification of hybrid systems ⓘ sensitivity analysis of system behaviors with respect to specifications ⓘ |
| extends | Boolean semantics of temporal logic ⓘ |
| field |
control theory
ⓘ
formal methods ⓘ hybrid systems ⓘ runtime monitoring ⓘ temporal logic ⓘ verification ⓘ |
| focusesOn |
continuous and hybrid dynamical systems
ⓘ
quantitative semantics of temporal logic ⓘ real-valued signals ⓘ robustness of specification satisfaction ⓘ temporal specifications ⓘ |
| goal |
improve resilience of temporal logic verification to perturbations
ⓘ
provide graded notion of satisfaction instead of purely Boolean ⓘ |
| influenced |
later work on robust signal temporal logic semantics
ⓘ
tools for quantitative monitoring of temporal properties ⓘ |
| introduces | quantitative semantics for temporal logic over signals ⓘ |
| isUsedIn |
analysis of embedded and cyber-physical systems
ⓘ
runtime monitoring of safety and liveness properties ⓘ simulation-based verification ⓘ |
| relatesTo |
metric temporal logic
ⓘ
quantitative verification ⓘ signal temporal logic ⓘ |
| supports |
optimization-based verification methods
ⓘ
search for counterexamples with maximal violation ⓘ search for trajectories with maximal satisfaction margin ⓘ |
| uses |
distance of signals from specification violation sets
ⓘ
metric-based interpretation of temporal operators ⓘ |
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: Robust satisfaction of temporal logic over real-valued signals Description of subject: "Robust satisfaction of temporal logic over real-valued signals" is a research paper that extends temporal logic semantics to quantify how strongly or weakly real-valued signals satisfy temporal specifications, enabling more resilient verification and analysis of continuous and hybrid systems.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.