A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
Filters
Fluent Logic Workflow Analyser: A Tool for The Verification of Workflow Properties
2014
Electronic Proceedings in Theoretical Computer Science
Preserved Fulltext
Other Versions
The specification language for property description is Fluent Linear Time Temporal Logic. Fluents provide an adequate flexibility for capturing properties of workflows. ...
In this paper we present the design and implementation, as well as a use case, of a tool for workflow analysis. The tool provides an assistant for the specification of properties of a workflow model. ...
The formal language used for property specification is a known temporal logic, fluent linear temporal logic (FLTL) [5] , which is well suited for formally expressing declarative properties of workflows ...
doi:10.4204/eptcs.139.4
fatcat:mpf5dzrffvg5pe3vjxdlqzyhhe
Verifying Compliance of Business Processes with Temporal Answer Sets
2011
Italian Conference on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The logical formalism we use, is a combination of Answer Set Programming and Dynamic Linear Time Temporal Logic (DLTL), and allows for a declarative specification of a business process, as well as the ...
Besides allowing for a declarative specification of business processes, the proposed framework can be used for encoding business processes specified in conventional workflow languages. ...
This work has been partially supported by Regione Piemonte, Project "ICT4LAW: ICT Converging on Law: Next Generation Services for Citizens, Enterprises, Public Administration and Policymakers" ...
dblp:conf/cilc/DAprileGGMPD11
fatcat:wdootc2lxzfb5gsehri2isydoi
Business process verification with constraint temporal answer set programming
2013
Theory and Practice of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It allows for a declarative specification of a business process but also for encoding processes specified in conventional workflow languages. ...
AbstractThe paper provides a framework for the verification of business processes, based on an extension of answer set programming (ASP) with temporal logic and constraints. ...
CLIMA 10] • declarative temporal constraints (e.g.ConDec/Declare from van der Aalst et al) • «classical» graphical workflow notation (BPMN, YAWL)We used a translation from basic workflow constructs of ...
doi:10.1017/s1471068413000409
fatcat:oahjxhewuvc7rf5gqfkl7tlibe
Verification with Answer Set Programming, Reasoning about Actions and Change, Constraints and Ontologies
2019
International Conference of the Italian Association for Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this extended abstract, we describe a line of research where logic-based knowledge representation and reasoning is used for both representing process and system models in knowledge-intensive domains ...
the Constraint ASP extensions); on the other hand, Bounded Model Checking for linear time temporal logics can be encoded in ASP. ...
XOR-splits in the workflow may be conditioned on such fluents, and fluents may occur in formulae to be verified. ...
dblp:conf/aiia/0001MD19
fatcat:5dlqoyvdu5eizjgswoih3q7mcu
Developing Model-Checking Mechanisms for ASSL: An Experience Report
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The Autonomic System Specification Language (ASSL) is a formal method dedicated to autonomic computing, and as such, assists developers with formal specification, validation and code generation of autonomic ...
Due to the synthesis approach of automatic code generation, ASSL guarantees consistency between a specification and the corresponding implementation. ...
in a global context). We can use a model checker to verify relations of nodes and actions expressed as temporal logic [5] constraints. ...
doi:10.1007/978-3-642-24690-6_3
fatcat:jhdvnzrkprfljmb4sy3azzgdqe
Behavioral Reasoning on Semantic Business Processes in a Rule-Based Framework
[chapter]
2014
Communications in Computer and Information Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our semantics defines a state transition system by following an approach similar to the Fluent Calculus, and allows us to specify state change in terms of preconditions and effects of the enactment of ...
As a result, our framework provides a wide range of reasoning services by using standard logic programming inference engines. ...
In the following we present some examples of properties that can be specified and verified in our framework. ...
doi:10.1007/978-3-662-44440-5_18
fatcat:iwtgmmap4bfmxo3yl5tfzpbajy
Reasoning on Data-Aware Business Processes with Constraint Logic
2014
International Symposium on Data-Driven Process Discovery and Analysis
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
The behavioral semantics of a process is defined as a state transition system by following an approach similar to the Fluent Calculus, and allows us to specify state change in terms of preconditions and ...
We propose a framework grounded in Constraint Logic Programming for representing and reasoning about business processes from both the workflow and data perspective. ...
The verification of temporal properties given µ-calculus variants is addressed, and some decidability and computational complexity results are provided. ...
dblp:conf/simpda/SmithP14
fatcat:wy3dbzeugzh5jgsihozev2ilrq
Ontology-based Representation and Reasoning on Process Models: A Logic Programming Approach
[article]
2014
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The behavioral semantics of a process is defined as a state transition system by following an approach similar to the Fluent Calculus, and allows us to specify state change in terms of preconditions and ...
We propose a framework grounded in Logic Programming for representing and reasoning about business processes from both the procedural and ontological point of views. ...
Verification In the following we present some examples of properties that can be specified and verified in our framework. ...
arXiv:1410.1776v1
fatcat:d72vth4lqnf2jg4hwfwoao52ha
On the integration of declarative choreographies and Commitment-based agent societies into the SCIFF logic programming framework
2010
Multiagent and Grid Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
SCIFF is the underlying logic programming framework for modelling and verifying interaction in open systems. ...
Mainstream approaches tend to focus on procedural aspects, leading to over-constrained and over-specified models. ...
Acknowledgments We would like to thank the anonymous reviewers of this Special Issue and of the MALLOW-AWESOME'007 workshop for their valuable comments and suggestions. ...
doi:10.3233/mgs-2010-0147
fatcat:ivee42ktrbadbap7tonou4kpby
Dynamic Reconfiguration of Business Processes
2019
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Acknowledgement This project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 778233 ...
logic of fluents to provide a uniform framework for specifying state-based temporal properties in event-based models [10] . ...
FLTL [10] is a linear-time temporal logic for reasoning about fluents. ...
doi:10.5281/zenodo.3263302
fatcat:47sfxinu4fgk7jqc4j4pzhpmbm
Dynamic Reconfiguration of Business Processes
2019
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
logic of fluents to provide a uniform framework for specifying state-based temporal properties in event-based models [10] . ...
FLTL [10] is a linear-time temporal logic for reasoning about fluents. ...
doi:10.5281/zenodo.3263303
fatcat:hob6ofyn6vdwvavcyax4evhl7e
A Platform for Managing Business Process Knowledge Bases via Logic Programming
2013
Italian Conference on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
language, (iii) the behavioral properties of process executions, expressed by means of the CTL temporal logic, and (iv) the domain specific semantics of individual activities occurring in a BP, defined ...
In particular, the WHERE clause of a QuBPAL query can specify a combination of ontological, structural, and behavioral properties. ...
dblp:conf/cilc/SmithSP13
fatcat:umru5jyobjgrthekfqafgdo6qe
An action-based approach to the formal specification and automatic analysis of business processes under authorization constraints
2012
Journal of computer and system sciences (Print)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Furthermore we show that a number of reasoning tasks that arise in this context (namely checking whether the control flow together with the security policy meets the expected security properties, building ...
In this paper we show that action-based languages provide a rich and natural framework for the formal specification of and automated reasoning about business processes under authorization constraints. ...
This work is partially supported by the FP7-ICT-2007-1 Project no. 216471, "AVANTSSAR: Automated Validation of Trust and Security of Service-oriented Architectures" (www.avantssar.eu) and by the project ...
doi:10.1016/j.jcss.2011.02.015
fatcat:yw3vjf27prcdlkcxrkwjqcmybe
Temporal deontic action logic for the verification of compliance to norms in ASP
2013
Proceedings of the Fourteenth International Conference on Artificial Intelligence and Law - ICAIL '13
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we develop a deontic temporal extension of Answer Set Programming (ASP) suitable for verifying compliance of a business process to norms involving such different types of obligations. ...
To this end, we extend Dynamic Linear Time Temporal Logic (DLTL) with deontic modalities to define a Deontic DLTL. ...
In our approach, the dynamic of commitments and the propagation properties of obligations are declaratively modeled by a set of causal laws, and verifi-cation related to obligations is performed by checking ...
doi:10.1145/2514601.2514608
dblp:conf/icail/GiordanoMD13
fatcat:3oxhvpxrb5adtelec5bsnb7pqe
Toward consistency checking of natural language temporal requirements
2011
2011 26th IEEE/ACM International Conference on Automated Software Engineering (ASE 2011)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Li, Viriyasitavat, Ruchikachorn, and Martin [23] presented an automated framework for verifying service workflow requirements using propositional logic. ...
Fluents are used to describe logical properties of a system at any given time. Each of them can be assigned a logical value true or false. Fluents can be inertial or not. ...
doi:10.1109/ase.2011.6100148
dblp:conf/kbse/Li11
fatcat:5ubixtz3vndy5f7ckszzsjuvxy
« Previous
Showing results 1 — 15 out of 317 results