@inproceedings{e3d0a239905542cdba5bd653e4f88b68,
title = "Better algorithms for analyzing and enacting declarative workflow languages using LTL",
abstract = "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.",
author = "M. Westergaard",
year = "2011",
doi = "10.1007/978-3-642-23059-2_10",
language = "English",
isbn = "978-3-642-23058-5",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "83--98",
editor = "S. Rinderle-Ma and F. Toumani and K. Wolf",
booktitle = "Business Process Management (9th International Conference, BPM 2011, Clermont-Ferrand, France, August 28-September 2, 2011. Proceedings)",
}