scholarly journals LTL on Finite and Process Traces: Complexity Results and a Practical Reasoner

2018 ◽  
Vol 63 ◽  
pp. 557-623 ◽  
Author(s):  
Valeria Fionda ◽  
Gianluigi Greco
Keyword(s):  
Modal Logic ◽  
Temporal Logic ◽  
Business Processes ◽  
Complexity Analysis ◽  
State Of The Art ◽  
Linear Temporal Logic ◽  
Time Instant ◽  
Sat Solvers ◽  
Similarities And Differences ◽  
Practical Reasoner

Linear temporal logic (LTL) is a modal logic where formulas are built over temporal operators relating events happening in different time instants. According to the standard semantics, LTL formulas are interpreted on traces spanning over an infinite timeline. However, applications related to the specification and verification of business processes have recently pointed out the need for defining and reasoning about a variant of LTL, which we name LTLp, whose semantics is defined over process traces, that is, over finite traces such that, at each time instant, precisely one propositional variable (standing for the execution of some given activity) evaluates true. The paper investigates the theoretical underpinnings of LTLp and of a related logic formalism, named LTLf, which had already attracted attention in the literature and where formulas have the same syntax as in LTLp and are evaluated over finite traces, but without any constraint on the number of variables simultaneously evaluating true. The two formalisms are comparatively analyzed, by pointing out similarities and differences. In addition, a thorough complexity analysis has been conducted for reasoning problems about LTLp and LTLf, by considering arbitrary formulas as well as classes of formulas defined in terms of restrictions on the temporal operators that are allowed. Finally, based on the theoretical findings of the paper, a practical reasoner specifically tailored for LTLp and LTLf has been developed by leveraging state-of-the-art SAT solvers. The behavior of the reasoner has been experimentally compared with other systems available in the literature.

Model Checking of Constraint-Based Workflow Based on Linear Temporal Logic

2012 ◽  
Vol 601 ◽  
pp. 401-405
Author(s):  
Wen Bo Zhou ◽  
Shu Zhen Yao
Keyword(s):  
Model Checking ◽  
Temporal Logic ◽  
Business Processes ◽  
Workflow Management ◽  
Linear Temporal Logic ◽  
Management Systems ◽  
Workflow Management Systems ◽  
Model Based ◽  
Büchi Automaton ◽  
Constraint Based Models

The degree of flexibility of workflow management systems heavily influences the way business processes are executed. Constraint-based models are considered to be more flexible than traditional models because of their semantics: everything that does not violate constraints is allowed. More and more people use declarative languages to define workflow, such as linear temporal logic. But how to guarantee the correctness of the model based on the linear temporal logic is still a problem. This article proposes a way to verify the model based on Büchi automaton and gives the corresponding algorithms. Thus the verification of declarative workflow based on the linear temporal logic is solved.

scholarly journals X and more Parallelism. Integrating LTL-Next into SAT-based Planning with Trajectory Constraints while Allowing for even more Parallelism

2018 ◽  
Vol 21 (62) ◽  
pp. 75
Author(s):  
Gregor Behnke ◽  
Susanne Biundo
Keyword(s):  
Temporal Logic ◽  
State Of The Art ◽  
Empirical Evaluation ◽  
Linear Temporal Logic ◽  
Boolean Satisfiability ◽  
The Other ◽  
Major Drawback ◽  
Current State ◽  
Other Hand ◽  
Compilation Techniques

Linear temporal logic (LTL) provides expressive means to specify temporally extended goals as well as preferences.Recent research has focussed on compilation techniques, i.e., methods to alter the domain ensuring that every solution adheres to the temporally extended goals.This requires either new actions or an construction that is exponential in the size of the formula.A translation into boolean satisfiability (SAT) on the other hand requires neither.So far only one such encoding exists, which is based on the parallel $\exists$-step encoding for classical planning.We show a connection between it and recently developed compilation techniques for LTL, which may be exploited in the future.The major drawback of the encoding is that it is limited to LTL without the X operator.We show how to integrate X and describe two new encodings, which allow for more parallelism than the original encoding.An empirical evaluation shows that the new encodings outperform the current state-of-the-art encoding.

scholarly journals Contextualized Filtering for Shared Cyber Threat Information

Sensors ◽  
2021 ◽  
Vol 21 (14) ◽  
pp. 4890
Author(s):  
Athanasios Dimitriadis ◽  
Christos Prassas ◽  
Jose Luis Flores ◽  
Boonserm Kulvatunyou ◽  
Nenad Ivezic ◽  
...  
Keyword(s):  
Information Sharing ◽  
Business Processes ◽  
State Of The Art ◽  
Contextual Information ◽  
Coarse Grained ◽  
Business Information ◽  
Cyber Threat ◽  
Domain Expertise ◽  
Multi Level ◽  
Filtering Approach

Cyber threat information sharing is an imperative process towards achieving collaborative security, but it poses several challenges. One crucial challenge is the plethora of shared threat information. Therefore, there is a need to advance filtering of such information. While the state-of-the-art in filtering relies primarily on keyword- and domain-based searching, these approaches require sizable human involvement and rarely available domain expertise. Recent research revealed the need for harvesting of business information to fill the gap in filtering, albeit it resulted in providing coarse-grained filtering based on the utilization of such information. This paper presents a novel contextualized filtering approach that exploits standardized and multi-level contextual information of business processes. The contextual information describes the conditions under which a given threat information is actionable from an organization perspective. Therefore, it can automate filtering by measuring the equivalence between the context of the shared threat information and the context of the consuming organization. The paper directly contributes to filtering challenge and indirectly to automated customized threat information sharing. Moreover, the paper proposes the architecture of a cyber threat information sharing ecosystem that operates according to the proposed filtering approach and defines the characteristics that are advantageous to filtering approaches. Implementation of the proposed approach can support compliance with the Special Publication 800-150 of the National Institute of Standards and Technology.

scholarly journals Divergent stutter bisimulation abstraction for controller synthesis with linear temporal logic specifications

Automatica ◽  
2021 ◽  
Vol 130 ◽  
pp. 109723
Author(s):  
Sahar Mohajerani ◽  
Robi Malik ◽  
Andrew Wintenberg ◽  
Stéphane Lafortune ◽  
Necmiye Ozay
Keyword(s):  
Temporal Logic ◽  
Linear Temporal Logic ◽  
Controller Synthesis

scholarly journals A Unified Translation of Linear Temporal Logic to ω-Automata

2020 ◽  
Vol 67 (6) ◽  
pp. 1-61
Author(s):  
Javier Esparza ◽  
Jan Křetínský ◽  
Salomon Sickert
Keyword(s):  
Temporal Logic ◽  
Linear Temporal Logic

Extending Linear Temporal Logic with Clocks to Object-Z

2014 ◽  
Vol 513-517 ◽  
pp. 927-930
Author(s):  
Zhi Cheng Wen ◽  
Zhi Gang Chen
Keyword(s):  
Real Time ◽  
Temporal Logic ◽  
Formal Specification ◽  
Large Scale ◽  
Linear Temporal Logic ◽  
Specification Language ◽  
Continuous Variables ◽  
Real Time System ◽  
Software Specification ◽  
Formal Specification Language

Object-Z, an extension to formal specification language Z, is good for describing large scale Object-Oriented software specification. While Object-Z has found application in a number of areas, its utility is limited by its inability to specify continuous variables and real-time constraints. Linear temporal logic can describe real-time system, but it can not deal with time variables well and also can not describe formal specification modularly. This paper extends linear temporal logic with clocks (LTLC) and presents an approach to adding linear temporal logic with clocks to Object-Z. Extended Object-Z with LTLC, a modular formal specification language, is a minimum extension of the syntax and semantics of Object-Z. The main advantage of this extension lies in that it is convenient to describe and verify the complex real-time software specification.

THE APPLICATION OF PETRI NETS TO WORKFLOW MANAGEMENT

1998 ◽  
Vol 08 (01) ◽  
pp. 21-66 ◽  
Author(s):  
W. M. P. VAN DER AALST
Keyword(s):  
Petri Nets ◽  
Petri Net ◽  
Business Processes ◽  
State Of The Art ◽  
Workflow Management ◽  
Explicit Representation ◽  
The Other ◽  
Application Domain ◽  
Analysis Techniques ◽  
The One

Workflow management promises a new solution to an age-old problem: controlling, monitoring, optimizing and supporting business processes. What is new about workflow management is the explicit representation of the business process logic which allows for computerized support. This paper discusses the use of Petri nets in the context of workflow management. Petri nets are an established tool for modeling and analyzing processes. On the one hand, Petri nets can be used as a design language for the specification of complex workflows. On the other hand, Petri net theory provides for powerful analysis techniques which can be used to verify the correctness of workflow procedures. This paper introduces workflow management as an application domain for Petri nets, presents state-of-the-art results with respect to the verification of workflows, and highlights some Petri-net-based workflow tools.

Sign in / Sign up

Export Citation Format

Share Document