Results 11 to 20 of about 26,826 (260)
The Complexity of Generalized Satisfiability for Linear Temporal Logic [PDF]
Logical Methods in Computer Science, 2009 In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used.
Michael Bauland +4 more
doaj +1 more source
Specification Sketching for Linear Temporal Logic
, 2023 Virtually all verification and synthesis techniques assume that the formal specifications are readily available, functionally correct, and fully match the engineer's understanding of the given system. However, this assumption is often unrealistic in practice: formalizing system requirements is notoriously difficult, error-prone, and requires ...
Simon Lutz +2 more
openaire +3 more sources
A Proof of Stavi's Theorem [PDF]
Logical Methods in Computer Science, 2018 Kamp's theorem established the expressive equivalence of the temporal logic with Until and Since and the First-Order Monadic Logic of Order (FOMLO) over the Dedekind-complete time flows. However, this temporal logic is not expressively complete for FOMLO
Alexander Rabinovich
doaj +1 more source
A Gödel Calculus for Linear Temporal Logic
Proceedings of the Nineteenth International Conference on Principles of Knowledge Representation and Reasoning, 2022 We consider GTL, a variant of linear temporal logic based on Gödel-Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a superintuitionistic logic. Using semantical methods, the logic was shown to be PSPACE-complete. In this paper we provide a deductive calculus for GTL, and show
Juan Pablo Aguilera Ozuna +3 more
openaire +4 more sources
Automata Linear Dynamic Logic on Finite Traces [PDF]
Logical Methods in Computer ScienceTemporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity.
Kevin W. Smith, Moshe Y. Vardi
doaj +1 more source
Linear Temporal Logic-based Mission Planning
International Journal of Interactive Multimedia and Artificial Intelligence, 2016 In this paper, we describe the Linear Temporal Logic-based reactive motion planning. We address the problem of motion planning for mobile robots, wherein the goal specification of planning is given in complex environments.
Anil Kumar, Rahul Kala
doaj +1 more source
CoRR, 2015 Although it is widely accepted that every system should be robust, in the sense that "small" violations of environment assumptions should lead to "small" violations of system guarantees, it is less clear how to make this intuitive notion of robustness mathematically precise.
Paulo Tabuada, Daniel Neider
openaire +4 more sources
Modelling and Analysis of the Lift System as a Hybrid System [PDF]
Acta Electrotechnica et Informatica, 2017 This paper deals with one of the challenges of cyber-physical systems, namely modelling them as hybrid systems. Specifically the paper aims to utilize hybrid systems framework onto the lift system which comes from the real laboratory lift.
Dominik VOŠČEK +2 more
doaj +1 more source
Decision procedure for first-order linear temporal logic with semi-periodic kemels
Lietuvos Matematikos Rinkinys, 2002 There is not abstract.
Regimantas Pliuškevičius
doaj +3 more sources
Method of marks for propositional linear temporal logic
Lietuvos Matematikos Rinkinys, 2014 It is known that traditional techniques used to ensure termination of a decision procedure in non-classical logics are based on loop-checking, in general.
Regimantas Pliuškevičius
doaj +1 more source