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.
Filters
Monitoring Business Constraints with Linear Temporal Logic: An Approach Based on Colored Automata
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
In this paper, we present a novel runtime verification framework based on linear temporal logic and colored automata. ...
Today's information systems record real-time information about business processes. This enables the monitoring of business constraints at runtime. ...
Since runtime verification and monitoring focus on the dynamics of an evolving system as time flows, LTL (Linear Temporal Logic) have been extensively proposed as a suitable framework for formalizing the ...
doi:10.1007/978-3-642-23059-2_13
fatcat:iqmzqnggnrdkfngb3yoocufiwi
Monitoring Constraints and Metaconstraints with Temporal Logics on Finite Traces
[article]
2020
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.
Other Versions
On the one hand, this enables us to directly employ the standard characterization of LDLf based on finite-state automata to monitor constraints in a fine-grained way. ...
In particular, it helps process executors to check on-the-fly whether a running process instance satisfies business constraints of interest, providing an immediate feedback when deviations occur. ...
Among all the temporal logics used in verification, Linear-time Temporal Logic (ltl) is particularly suited for monitoring, as an actual system execution is indeed a linear sequence of events. ...
arXiv:2004.01859v2
fatcat:ueqkigqvevcrfbsxthplmt5dyu
ECA-RuleML: An Approach combining ECA Rules with temporal interval-based KR Event/Action Logics and Transactional Update Logics
[article]
2006
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.
Other Versions
An important problem to be addressed within Event-Driven Architecture (EDA) is how to correctly and efficiently capture and process the event/action-based logic. ...
We propose formalism based on reaction rules (ECA rules) and a novel interval-based event logic and present concrete RuleML-based syntax, semantics and implementation. ...
In section 4, we describe an approach to event processing based on active ECA rules in Logic Programming and relate it to the KR event/action logics approach evolved in section 3. ...
arXiv:cs/0610167v2
fatcat:4gaoujuibfcwnompxkjlbqaj44
A Tableau Construction for Finite Linear-Time Temporal Logic
[article]
2020
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.
Other Versions
This paper describes a method for converting formulas in finite propositional linear-time temporal logic (Finite LTL) into finite-state automata whose languages are the models of the given formula. ...
The approach considered is based on well-known tableau-construction techniques developed for LTL, which we adapt here for the setting of Finite LTL. ...
Conclusion This paper has given a tableau-based method for constructing nondeterministic finite automata (NFAs) from formulas in a version of Linear Temporal Logic (LTL) whose formulas are intepreted with ...
arXiv:1910.09339v2
fatcat:jsiuyhslu5cbhkhzjws4ogjhtu
Logic Synthesis
[chapter]
2017
Electronic Design Automation for IC Implementation, Circuit Design, and Process Technology
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.
ACKNOWLEDGMENT e authors thank Vladimir Yutsis for his helpful feedback on Section 1.5.2. ...
Mahapatra, m-Trie: An e�cient approach to on-chip logic minimization, Proceedings of IEEE International Conference on Computer-Aided Design, Santa Clara, CA, 2004, pp. 428-435. 61. R. Lysecky and F. ...
One approach is to examine the dependencies between incremental applications and decide on an overall ordering that would eliminate con icts. ...
doi:10.1201/9781315215112-13
fatcat:me52zpnxyfcczh3choo2p4zulm
An Operational Decision Support Framework for Monitoring Business Constraints
[chapter]
2012
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 2013; you can also visit the original URL.
The file type is application/pdf.
We discuss the foundations of the monitoring framework considering two logic-based approaches, tailored to Linear Temporal Logic on finite traces and the Event Calculus. ...
In this paper, we present the implementation of a novel business constraints monitoring framework on top of the ProM OS service. ...
In this paper, we demonstrate two such engines, one based on (finite-trace) Linear Temporal Logic (LTL) and automata, and the other on the Event Calculus (EC) and a Prolog-based reactive reasoner. ...
doi:10.1007/978-3-642-28872-2_11
fatcat:ms4sxrbx4fbwxh7yhtbnk5rcha
Runtime Verification of LTL-Based Declarative Process Models
[chapter]
2012
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 2017; you can also visit the original URL.
The file type is application/pdf.
Linear Temporal Logic (LTL) on finite traces has proven to be a good basis for the analysis and enactment of flexible constraintbased business processes. ...
In this paper, we operationalize the notion of conflicting constraints and demonstrate how innovative automatabased techniques can be applied to monitor running process instances. ...
Introduction Linear Temporal Logic (LTL) provides a solid basis for design-time verification and model checking. ...
doi:10.1007/978-3-642-29860-8_11
fatcat:v6343xeh5jdpflegvumqx4ddpu
LTLf and LDLf Monitoring: A Technical Report
[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.
Runtime monitoring is one of the central tasks to provide operational decision support to running business processes, and check on-the-fly whether they comply with constraints and rules. ...
This, in turn, enables to flexibly monitor constraints depending on the monitoring state of other constraints, e.g., "compensation" constraints that are only checked when others are detected to be violated ...
FP7-318338, and by the Sapienza Award 2013 "SPIRITLETS: Spiritlet-based smart spaces". ...
arXiv:1405.0054v1
fatcat:zzqgglg23vawtkurcw6xwtdnr4
Semantical Vacuity Detection in Declarative Process Mining
[chapter]
2016
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 2019; you can also visit the original URL.
The file type is application/pdf.
temporal logics over finite traces. ...
We then extend the standard automata-based approach so as to incorporate relevance-related information. ...
On the one hand, it makes our approach working also in a monitoring setting. ...
doi:10.1007/978-3-319-45348-4_10
fatcat:xq3cz2ck5bgsjbzsttugoscbai
Multiagent systems: algorithmic, game-theoretic, and logical foundations
2009
ChoiceReviews
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 2016; you can also visit the original URL.
The file type is application/pdf.
-KLB Contents Credits and Acknowledgments xi Introduction xiii 1 Distributed Constraint Satisfaction 1 1.1 Defining distributed constraint satisfaction problems 2 1.2 Domain-pruning algorithms 4 1.3 Heuristic ...
You are invited to use this electronic copy without restriction for on-screen viewing, but are requested to print it only under one of the following circumstances: • You live in a place that does not offer ...
An agent who is certain of a fact will not admit that he might be wrong; to him, his beliefs look like knowledge. ...
doi:10.5860/choice.46-5662
fatcat:pr2pmv7k2bad3pp5bxgogecgnq
A Comparative Assessment of Collaborative Business Process Verification Approaches
[chapter]
2017
IFIP Advances in Information and Communication Technology
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.
Research in business process model verification has yielded a plethora of approaches in form of languages and tools that are based on Petri nets family and temporal logic. ...
In this paper we present an assessment of the most common verification approaches based on their expressibility, flexibility, suitability and complexity. ...
The tools described from this point are based on Temporal Logic formalism. ...
doi:10.1007/978-3-319-65151-4_33
fatcat:gzqlcqiswjhd5plfbl5w7hzyeq
Detection of Conflicting Compliance Rules
2011
2011 IEEE 15th International Enterprise Distributed Object Computing Conference Workshops
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.
We extend classical boolean conflict driven solver to provide a new temporal conflict driven solver for temporal logic. ...
Web-based dynamic systems and pressured business environments need more than ever formal methods to analyze evolving compliance rules. ...
DecSerFlow is a declarative specification of business process based on temporal logic as a trade-off between compliance and flexibility. ...
doi:10.1109/edocw.2011.57
dblp:conf/edoc/HantryHT11
fatcat:dmvjksvxyvgbxc6tllx25dukdu
Detecting Runtime Business Process Compliance with Artifact Lifecycles
[chapter]
2013
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 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, runtime compliance checking is used for artifactcentric business process and artifact lifecycles are treated as business constraints. ...
a given constraint. ...
[7] presents a novel runtime verification framework based on linear temporal logic, and translates constraint model into colored automata to monitor the business process execution. ...
doi:10.1007/978-3-642-37804-1_45
fatcat:fzzikwjyb5h4jhgwa3zya2bgty
On The Understandability Of Semantic Constraints For Behavioral Software Architecture Compliance: A Controlled Experiment
2017
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.
documentations today, a structured language based on specification patterns that abstract underlying temporal logic formulas, and a structured cause-effect language that is based on Complex Event Processing ...
Overall all approaches support a high level of correct understanding, and the statistical inference suggests that all tested approaches are equally well suited for describing semantic constraints for behavioral ...
Temporal Logic Pattern-Based Semantic Constraint Representation Temporal Logic Constraints (TLC) are formally grounded on temporal logics such as Linear Temporal Logic (LTL) [20] . ...
doi:10.5281/zenodo.604624
fatcat:k6p273luefennnnw24tnuhxdf4
DECLARE: Full Support for Loosely-Structured Processes
2007
International Enterprise Distributed Object Computing Conference, Proceedings
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.
DECLARE is a prototype of a WFMS that uses a constraint-based process modeling language for the development of declarative models describing loosely-structured processes. ...
Each constraint template has (1) an unique name, (2) semantics specified in Linear Temporal Logic 2 (LTL) [20] and (3) graphical representation. ...
To introduce deadlines, a logic extended with time dimension and time automata can be used (e.g., Extended Timed Temporal Logic [8] ). ...
doi:10.1109/edoc.2007.4384001
fatcat:7hllukt5r5avxgviswa3xzbdni
« Previous
Showing results 1 — 15 out of 658 results