Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Three partition refinement algorithms
SIAM Journal on Computing
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
A Parallel Algorithm for Minimization of Finite Automata
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
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
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Automata-Based Verification of Temporal Properties on Running Programs
Proceedings of the 16th IEEE international conference on Automated software engineering
An n log n algorithm for minimizing states in a finite automaton
An n log n algorithm for minimizing states in a finite automaton
Verification of Choreographies During Execution Using the Reactive Event Calculus
Web Services and Formal Methods
Constraint-based workflow models: change made easy
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems: CoopIS, DOA, ODBASE, GADA, and IS - Volume Part I
Enacting declarative languages using LTL: avoiding errors and improving performance
SPIN'10 Proceedings of the 17th international SPIN conference on Model checking software
Monitoring business constraints with linear temporal logic: an approach based on colored automata
BPM'11 Proceedings of the 9th international conference on Business process management
An operational decision support framework for monitoring business constraints
FASE'12 Proceedings of the 15th international conference on Fundamental Approaches to Software Engineering
Runtime verification of LTL-Based declarative process models
RV'11 Proceedings of the Second international conference on Runtime verification
Aligning event logs and declarative process models for conformance checking
BPM'12 Proceedings of the 10th international conference on Business Process Management
Mixing paradigms for more comprehensible models
BPM'13 Proceedings of the 11th international conference on Business Process Management
Monitoring business constraints with the event calculus
ACM Transactions on Intelligent Systems and Technology (TIST) - Special Section on Intelligent Mobile Knowledge Discovery and Management Systems and Special Issue on Social Web Mining
| Hi-index | 0.00 |
Declarative workflow languages are easy for humans to understand and use for specifications, but difficult for computers to check for consistency and use for enactment. Therefore, declarative languages need to be translated to something a computer can handle. One approach is to translate the declarative language to linear temporal logic (LTL), which can be translated to finite automata. While computers are very good at handling finite automata, the translation itself is often a road block as it may take time exponential in the size of the input. Here, we present algorithms for doing this translation much more efficiently (around a factor of 10,000 times faster and handling 10 times larger systems on a standard computer), making declarative specifications scale to realistic settings.