Buscar
Mostrando ítems 1-10 de 21
Model checking LTL formulae in RAISE with FDR
(Scopus, 2009)
TheRaise SpecificationLanguage (RSL) is a modeling languagewhich supports various specification styles. To apply model checking to RSL concurrent descriptions, we translate RSL specifications into the input language CSPM ...
Polynomial-Time Reformulations of LTL Temporally Extended Goals into Final-State Goals
(2015)
Linear temporal logic (LTL) is an expressive language that allows specifying temporally extended goals and preferences. A general approach to dealing with general LTL properties in planning is by "compiling them away"; ...
Finite LTL Synthesis as Planning
(2018)
LTL synthesis is the task of generating a strategy that satisfies a Linear Temporal Logic (LTL) specification interpreted over infinite traces. In this paper we examine the problem of LTLf synthesis, a variant of LTL ...
An Spin / Promela application for model checking UML sequence diagrams
(Science and Information Organization, 2018)
A Spin / Promela Application for Model checking UML Sequence Diagrams
(2018)
UML sequence diagrams usually represent the behavior of systems execution. Automated verification of UML sequence diagrams’ correctness is necessary because they can model critical algorithmic behaviors of information ...
Real time search with linear temporal goals
(2023)
In Real-Time Heuristic Search (RTHS) we are given a search graph G, a heuristic, and an objective, which is to find a path from a start node to a given goal node in G. As such, one does not impose any trajectory constraints ...
Non-Deterministic Planning with Temporally Extended Goals: LTL over Finite and Infinite Traces
(2017)
Temporally extended goals are critical to the specification of a diversity of real-world planning problems. Here we examine the problem of non-deterministic planning with temporally extended goals specified in linear ...