Services as a Paradigm of Computation - Formal Methods and Hybrid Real-Time Systems - page 536

of asynchronous interactive computation, complementing process algebras as a
standard model for synchronous computation. Open workflow nets are a most
useful starting point as a representation technique for asynchronous interactive
computation, as they provide a lot of techniques to effectively analyze the most
important properties of asynchronous interactive systems. In their given form,
open workflow nets stick to control flow of services. Data and data dependent
behavior can easily be incorporated, extending the formalism as usual in high
level Petri nets.
References
1. Gandy, R.: Church's thesis and principles for mechanisms. In: The Kleene Sympo-
sium, pp. 123-148. North-Holland, Amsterdam (1980)
2. Petri, C.A.: Kommunikation mit Automaten. PhD thesis, Bonn: Institut fur In-
strumentelle Mathematik, Schriften des IIM Nr. 2 (1962) also: Griss Air Force
Base, Technical Report RADC-TR-65-377, vol.1(1), English translation (1966)
3. Thomas, W.: Automata on Infinite Objects. In: Handbook of Theoretical Computer
Science, Volume B: Formal Models and Sematics (B), pp. 133-192 (1990)
4. Kahn, G.: The semantics of simple language for parallel programming. In: IFIP
Congress, pp. 471-475 (1974)
5. Broy, M., Stoelen, K.: Specification and Development of Interactive Systems: Focus
on Streams, Interfaces, and Refinement. Springer, Heidelberg (2001)
6. Milner, R.: A Calculus of Communication Systems. LNCS, vol. 92. Springer, Hei-
delberg (1980)
7. Lamport, L.: Specifying Systems, The TLA+ Language and Tools for Hardware
and Software Engineers. Addison-Wesley, Reading (2002)
8. Gurevich, Y.: Interactive Algorithms 2005. In: Jedrzejowicz, J., Szepietowski, A.
(eds.) MFCS 2005. LNCS, vol. 3618, pp. 26-38. Springer, Heidelberg (2005)
9. Misra, J., Cook, W.R.: Computation Orchestration: A Basis for Wide-Area Com-
puting. Journal of Software and Systems Modeling, 83-110 (May 2006)
10. Wegner, P.: Why Interaction Is More Powerful Than Algorithms. Commun.
ACM 40(5), 80-91 (1997)
11. Wegner, P.: Interactive Foundations of Computing. Theor. Comput. Sci. 192(2),
315-351 (1998)
12. Goldin, D., Smolka, S.A., Wegner, P.: Interactive Computation - The New Para-
digm. Springer, Heidelberg (2006)
13. Goldin, D.Q.: Persistent Turing Machines as a Model of Interactive Computation.
In: Schewe, K.-D., Thalheim, B. (eds.) FoIKS 2000. LNCS, vol. 1762, pp. 116-135.
Springer, Heidelberg (2000)
14. van Leeuwen, J., Wiedermann, J.: On Algorithms and Interaction. In: Nielsen, M.,
Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 99-113. Springer, Heidelberg
(2000)
15. van der Aalst, W.M.P.: The Application of Petri Nets to Workflow Management.
The Journal of Circuits, Systems and Computers 8(1), 21-66 (1998)
16. Lohmann, N., Massuthe, P., Wolf, K.: Operating Guidelines for Finite-State Ser-
vices. In: Kleijn, J., Yakovlev, A. (eds.) International Conference on Applications
and Theory of Petri Nets and Other Models of Concurrency, ICATPN 2007. LNCS,
vol. 4546, Springer, Heidelberg (2007)