Better Algorithms for Analyzing and Enacting Declarative Workflow Languages Using LTL
Author:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 83-98
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance2010
- Verification of Choreographies During Execution Using the Reactive Event CalculusLecture Notes in Computer Science, 2009
- A parallel algorithm for constructing binary decision diagrams2002
- Optimizing Büchi Automata2000
- Simple On-the-fly Automatic Verification of Linear Temporal Logic1996
- Temporal Verification of Reactive Systems1995
- Three Partition Refinement AlgorithmsSIAM Journal on Computing, 1987
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976
- AN n log n ALGORITHM FOR MINIMIZING STATES IN A FINITE AUTOMATON1971