Non-controllable choice robustness expressing the controllability of workflow processes

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

Volumn 2360 LNCS, Issue , 2002, Pages 121-141

  Dehnert, Juliane ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

PERSONAL COMPUTING; PETRI NETS; GAME THEORY;

CORRECTNESS CRITERION; HACKER ATTACKS; REACTIVE SYSTEM; WORK-FLOW SYSTEMS; WORKFLOW NETS; WORKFLOW PROCESS;

GAME THEORY; DENIAL-OF-SERVICE ATTACK;

EID: 84879117511     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48068-4_9     Document Type: Conference Paper

References (19)

1. W. M. P. van der Aalst. Verification ofW orkflow Nets. In P. Azema and G. Balbo, editors, Application and Theory of Petri Nets 1997, volume 1248 of LNCS, pages 407-426. Springer-Verlag, Berlin, 1997. 122, 123
2. W. M. P. van der Aalst. The Application ofP etri Nets to Workflow Management. The Journal of Circuits, Systems and Computers, 8(1):21-66, 1998. 122, 123, 124, 125, 127
3. W. M. P. van der Aalst and T. Basten. Inheritance ofW orkflows-An approach to tackling problems related to change. Computing Science Reports 99-06, University ofColerad o Boulder, 1999. 121, 122
4. W. M. P. van der Aalst, B. Kiepuszewski, A. ter Hofstede, A. Barros, and B. Kiepuszewsk. Advanced Workflow Patterns. In O. Etzion and P. Scheuremann, editors, Proceedings Seventh IFCIS International Conference on Cooperative Information System (CoopIS 2000), volume 1901 of LNCS, pages 18-29. Springer-Verlag, September 2000. 122, 127
5. N. R. Adam, V. Atluri, and W.-K. Huang. Modeling and Analysis ofW orkflows Using Petri Net. Journal of Intelligent Information System, Special Issue on Workflow and Process Management, 10(2):131-158, 1998. 123
6. E. Asarin, O. Maler, and A. Pnueli. Symbolic controller synthesis for discrete and timed systems. In Hybrid Systems, pages 1-20, 1994. 130
7. J. Dehnert. Four Systematic Steps Towards Sound Business Process Models. In Weber et al. [19], pages 55-64. 125
8. J. Dehnert and P. Rittgen. Relaxed Soundness ofB usiness Processes. In K.L. Dittrich, A. Geppert, and M.C. Norrie, editors, Advanced Information System Engineering, CAISE 2001, volume 2068 of LNCS, pages 157-170. Springer Verlag, 2001. 125
9. W. Derks, J. Dehnert, P. Grefen, and W. Jonker. Customized atomicity specification for transactional workflow. In H. Lu and S. Spaccapietra, editors, Proceedings of the Third International Symposium on Cooperative Database Systems and Applications (CODAS'01), pages 155-164. IEEE Computer Society, April 2001. 125
10. J. Desel and J. Esparza. Free Choice Petri Nets. Cambridge University Press, 1995. 127
11. R. Eshuis and R. Wieringa. A Comparison ofP etri Net and Activity Diagram Variants. In Weber et al. [19], pages 93-104. 121, 122
12. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems. Springer, New York, 1992. 131
13. A. Martens. Modeling Workflow in Virtual Enterprises. In Weber et al. [19], pages 157-162. 121, 122
14. R.McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65(2):149-184, 1993. 130, 135
15. A. Nerode, A. Yakhnis, and V. Yakhnis. Concurrent Programs as Strategies in Games. In LFROMCS: Logic from Computer Science: Workshop-Proceedings. Springer-Verlag, 1992. 135
16. A. Pnueli and R. Rosner. On the synthesis ofa reactive module. In POPL '89. Proceedings of the sixteenth annual ACM symposium on Principles of programming languages, pages 179-190, New York, 1989. ACM Press. 130
17. K. Schmidt. Lola: A low level analyser. In Proc. Int. Conf. Application and Theory of Petri net, volume 1825 of LNCS, pages 465-474, 1999.
18. W. Thomas. On the synthesis ofs trategies in infinite games. In Symposium on Theoretical Aspects of Computer Science, pages 1-13, 1995. 139 130, 131, 135
19. H.Weber, H. Ehrig, andW. Reisig, editors. Int. Colloquium on Petri Net Technologies for Modelling Communication Based Systems. Fraunhofer Gesellschaft ISST, September 2001. 140