LogLogics: A logic for history-dependent business processes

Authors:
Kees van Hee;Olivia Oanea;Alexander Serebrenik;Natalia Sidorova;Marc Voorhoeve
Affiliations:
Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands;Eindhoven University of Technology, Department of Mathematics and Computer Science, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Science of Computer Programming
Year:
2007

Citing 15
Cited 4

Specifying real-time properties with metric temporal logic

Real-Time Systems
A really temporal logic

Journal of the ACM (JACM)
Property preserving abstractions for the verification of concurrent systems

Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
Abstract interpretation of reactive systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
Patterns in property specifications for finite-state verification

Proceedings of the 21st international conference on Software engineering
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Logics and Models of Real Time: A Survey

Proceedings of the Real-Time: Theory in Practice, REX Workshop
Workflow Management: Models, Methods, and Systems

Workflow Management: Models, Methods, and Systems
Past pushdown timed automata and safety verification

Theoretical Computer Science - Implementation and application automata
Correctness criteria for dynamic changes in workflow systems: a survey

Data & Knowledge Engineering - Special issue: Advances in business process management
Monitoring Algorithms for Metric Temporal Logic Specifications

Electronic Notes in Theoretical Computer Science (ENTCS)
Process mining and verification of properties: an approach based on temporal logic

OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I
Nested nets for adaptive systems

ICATPN'06 Proceedings of the 27th international conference on Applications and Theory of Petri Nets and Other Models of Concurrency
Workflow resource patterns: identification, representation and tool support

CAiSE'05 Proceedings of the 17th international conference on Advanced Information Systems Engineering
On the expressiveness of TPTL and MTL

FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science

History-based joins: Semantics, soundness and implementation

Data & Knowledge Engineering
Working with the Past: Integrating History in Petri Nets

Fundamenta Informaticae - PETRI NETS 2007
History-dependent Petri nets

ICATPN'07 Proceedings of the 28th international conference on Applications and theory of Petri nets and other models of concurrency
Working with the Past: Integrating History in Petri Nets

Fundamenta Informaticae - PETRI NETS 2007

Quantified Score

Hi-index	0.01

Visualization

Abstract

Choices in business processes are often based on the process history saved as a log-file listing events and their time stamps. In this paper we introduce LogLogics, a finite-path variant of the Timed Propositional Temporal Logic with Past, which can be in particular used for specifying guards in business process models. The novelty is due to the presence of boundary points corresponding to the starting and current observation points, which gives rise to a three-valued logic allowing us to distinguish between temporal formulas that hold for any log extended with some possible past and future (true), those that do not hold for any extended log (false) and those that hold for some but not all extended logs (unknown). We reduce the check of the truth value of a LogLogics formula to a check on a finite abstraction and present an evaluation algorithm. We also define LogLogics patterns for commonly occurring properties.