Better algorithms for analyzing and enacting declarative workflow languages using LTL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6896 LNCS, Issue , 2011, Pages 83-98

  Westergaard, Michael ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

DECLARATIVE LANGUAGES; LINEAR TEMPORAL LOGIC; WORKFLOW LANGUAGE;

ALGORITHMS; ENTERPRISE RESOURCE MANAGEMENT; SPECIFICATIONS; TEMPORAL LOGIC;

TRANSLATION (LANGUAGES);

EID: 80052795701     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-23059-2_10     Document Type: Conference Paper

References (16)

1. Bryant, R.E.: Graph Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers C-35(8), 677-691 (1986)
2. Chesani, F., Mello, P., Montali, M., Torroni, P.: Verification of Choreographies During Execution Using the Reactive Event Calculus. In: Bruni, R., Wolf, K. (eds.) WS-FM 2008. LNCS, vol. 5387, pp. 55-72. Springer, Heidelberg (2009)
3. Declare webpage, http://declare.sf.net
4. Etessami, K., Holzmann, G.J.: Optimizing Büchi Automata. In: Palamidessi, C. (ed.) CONCUR 2000. LNCS, vol. 1877, pp. 153-168. Springer, Heidelberg (2000)
5. Garey, M.R., Johnson, D.S., Stockmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science 1, 237-267 (1976)
6. Gerth, R., Peled, D., Vardi, M.Y., Wolper, P.: Simple On-the-fly Automatic Verification of Linear Temporal Logic. In: Proc. of Protocol Specification, Testing and Verification, pp. 3-18 (1995)
7. Giannakopoulou, D., Havelund, K.: Automata-Based Verification of Temporal Properties on Running Programs. In: Proc. of ASE 2001, pp. 412-416. IEEE Computer Society, Los Alamitos (2001)
8. Hopcroft, J.E.: An n log n algorithm for minimizing states in a finite automaton. Technical report, Stanford University (1971)
9. Kamp, H.W.: Tense Logic and the Theory of Linear Order. PhD thesis, University of California (1968)
10. Kimura, S., Clarke, E.M.: A parallel algorithm for constructing binary decision diagrams. In: Proc. of ICCD 1990, pp. 220-223 (1990)
11. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)
12. Object Management Group (OMG). Business Process Modeling Notation (BPML). Version 2.0. OMG Avaiable Specification
13. Paige, R., Tarjan, R.E.: Three Partition Refinement Algorithms. SIAM Journal on Computing 16(6), 973-989 (1987)
14. Pei, M., Bonaki, D., van der Aalst, W.M.P.: Enacting Declarative Languages Using LTL: Avoiding Errors and Improving Performance. In: van de Pol, J., Weber, M. (eds.) Model Checking Software. LNCS, vol. 6349, pp. 146-161. Springer, Heidelberg (2010)
15. Pei, M., Schonenberg, M.H., Sidorova, N., van der Aalst, W.M.P.: Constraint-Based Workflow Models: Change Made Easy. In: Chung, S. (ed.) OTM 2007, Part I. LNCS, vol. 4803, pp. 77-94. Springer, Heidelberg (2007)
16. Ravikumar, B., Xiong, X.: A Parallel Algorithm for Minimization of Finite Automata. In: Proc. of IPPS 1996, pp. 187-191. IEEE Computer Society, Los Alamitos (1996)