Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Events in Linear-Time Properties
RE '99 Proceedings of the 4th IEEE International Symposium on Requirements Engineering
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Fast LTL to Büchi Automata Translation
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
Automata-Based Verification of Temporal Properties on Running Programs
Proceedings of the 16th IEEE international conference on Automated software engineering
Fluent model checking for event-based systems
Proceedings of the 9th European software engineering conference held jointly with 11th ACM SIGSOFT international symposium on Foundations of software engineering
Declarative specification and verification of service choreographiess
ACM Transactions on the Web (TWEB)
Efficient model checking of safety properties
SPIN'03 Proceedings of the 10th international conference on Model checking software
DecSerFlow: towards a truly declarative service flow language
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
WS-FM'06 Proceedings of the Third international conference on Web Services and Formal Methods
An iterative approach for business process template synthesis from compliance rules
CAiSE'11 Proceedings of the 23rd international conference on Advanced information systems engineering
Better algorithms for analyzing and enacting declarative workflow languages using LTL
BPM'11 Proceedings of the 9th international conference on Business process management
Constitutive and regulative specifications of commitment protocols: A decoupled approach
ACM Transactions on Intelligent Systems and Technology (TIST) - Special section on agent communication, trust in multiagent systems, intelligent tutoring and coaching systems
Linear temporal logic and linear dynamic logic on finite traces
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
In our earlier work we proposed using the declarative language DecSerFlow for modeling, analysis and enactment of processes in autonomous web services. DecSerFlow uses constraints specified with Linear Temporal Logic (LTL) to implicitly define possible executions of a model: any execution that satisfies all constraints is possible. Hence, a finite representation of all possible executions is retrieved as an automaton generated from LTL-based constraints. Standard model-checking algorithms for creating Büchi automata from LTL formulas are not applicable because of the requirements posed by the proper execution of DecSerFlow (and LTL-based process engines). On the one hand, LTL handles infinite words where each element of the word can refer to zero or more propositions. On the other hand, each execution of a DecSerFlow model is a finite sequence of single events. In this paper we adopt an existing approach to finite-word semantics of LTL and propose the modifications of LTL and automata generation algorithm needed to handle occurrences of single events. Besides eliminating errors caused by the 'multiple properties - single events' mismatch, the proposed adjustments also improve the performance of the automata generation algorithms dramatically.