2012 · 21 citations · 12 references
ComputingComputer ScienceFormal MethodsLogicReal-time SystemsDeadline AnalysisReal-time Systems DesignTemporal LogicLinear Temporal LogicLinear-time Temporal LogicOperatorsSatisfiabilitySatisfiability ProblemTemporal Logic SpecificationTemporal OperatorsUndecidability
We propose fLTL, an extension to linear-time temporal logic (LTL) that allows for expressing relative frequencies by a generalization of temporal operators. This facilitates the specification of requirements such as the deadlines in a realtime system must be met in at least 95% of all cases. For our novel logic, we establish an undecidability result regarding the satisfiability problem but identify a decidable fragment which strictly increases the expressiveness of LTL by allowing, e.g., to express non-context-free properties.
12
The temporal logic of programs
Amir Pnueli · 1977 · 5.7K citations
Computation: Finite and Infinite Machines.
D. A. Clarke, Marvin Minsky · American Mathematical Monthly · 1968 · 2.6K citations
Temporal logic can be more expressive
Pierre Wolper · Information and Control · 1983 · 658 citations