On composition and lookahead delegation of e-services modeled by automata

Theoretical Computer Science

Volumn 341, Issue 1-3, 2005, Pages 344-363

  Dang, Zhe ^a   Ibarra, Oscar H ^b   Su, Jianwen ^b  

^a Washington State University   (United States)

^b University of California   (United States)

Author keywords

Automated composition; Decidable; Delegator; E service modelling; E services; Finite state automata; Infinite state automata; Lookahead delegation; Undecidable

Indexed keywords

AUTOMATION; CODES (SYMBOLS); COMPUTER SCIENCE; COMPUTER SIMULATION; ELECTRONIC COMMERCE; FORMAL LANGUAGES; INFORMATION ANALYSIS;

DETERMINISTIC MACHINES; E-SERVICES; LANGUAGE ACCEPTORS; MULTICOUNTER AUTOMATION;

AUTOMATA THEORY;

EID: 23844527463     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.06.009     Document Type: Article

References (29)

1. M. Abadi, L. Lamport, P. Wolper, Realizable and unrealizable specifications of reactive systems, in: Proc. 16th Internat. Colloq. on Automata, Languages and Programming, 1989.
2. R. Alur, Timed automata, in: CAV'99, Lecture Notes in Computer Science, Vol. 1633, Springer, Berlin, 1999, pp. 8-22.
3. R. Alur, and D. Dill Automata for modeling real-time systems Theoret. Comput. Sci. 126 2 1994 183 236
4. B. Baker, and R. Book Reversal-bounded multipushdown machines J. Comput. System Sci. 8 1974 315 332
5. D. Berardi, D. Calvanese, G. De Giacomo, M. Lenzerini, M. Mecella, Automatic composition of e-services that export their behavior, in: Proc. First Internat. Conf. on Service Oriented Computing (ICSOC), Lecture Notes in Computer Science, Vol. 2910 LNCS, 2003, pp. 43-58.
6. J. Buchi, and L. Landweber Solving sequential conditions by finite-state strategies Trans. Amer. Math. Soc. 138 1969 295 311
7. Z. Dang Pushdown time automata: a binary reachability characterization and safety verification Theoret. Comput. Sci. 302 2003 93 121
8. Z. Dang, O. Ibarra, T. Bultan, R. Kemmerer, J. Su, Binary reachability analysis of discrete pushdown timed automata, in: Proc. Internat. Conf. on Computer-Aided Verification (CAV), 2000, pp. 69-84.
9. Z. Dang, O.H. Ibarra, and R.A. Kemmerer Generalized discrete timed automata: decidable approximations for safety verification Theoret. Comput. Sci. 296 2003 59 74
10. Z. Dang, O.H. Ibarra, P. San Pietro, Liveness verification of reversal-bounded multicounter machines with a free counter, in: FSTTCS'01, Lecture Notes in Computer Science, Vol. 2245, Springer, Berlin, 2001, pp. 132-143.
11. Z. Dang, O.H. Ibarra, Z. Sun, On the emptiness problems for two-way nondeterministic finite automata with one reversal-bounded counter, in: ISAAC'02, Lecture Notes in Computer Science, Vol. 2518, Springer, Berlin, 2002, pp. 103-114.
12. Z. Dang, P. San Pietro, and R.A. Kemmerer Presburger liveness verification for discrete timed automata Theoret. Comput. Sci. 299 2003 413 438
13. C.E. Gerede, R. Hull, O.H. Ibarra, J. Su, Automated composition of e-services: lookaheads, in: Proc. Second Internat. Conf. on Service Oriented Computing, 2004.
14. S. Ginsburg, and E. Spanier Semigroups, Presburger formulas, and languages Pacific J. Math. 16 1966 285 296
15. T. Harju, O. Ibarra, J. Karhumaki, and A. Salomaa Some decision problems concerning semilinearity and computation J. Comput. System Sci. 65 2002 278 294
16. R. Hull, M. Benedikt, V. Christophides, J. Su, E-services: a look behind the curtain, in: Proc. ACM Symp. on Principles of Database Systems, 2003.
17. O.H. Ibarra Reversal-bounded multicounter machines and their decision problems J. ACM 25 1 1978 116 133
18. O.H. Ibarra, T. Jiang, N. Tran, and H. Wang New decidability results concerning two-way counter machines SIAM J. Comput. 24 1995 123 137
19. O. Kupferman, M.Y. Vardi, Synthesizing distributed systems, in: Proc. IEEE Symp. on Logic in Computer Science, 2001.
20. S. Lu, Semantic correctness of transactions and workflows, Ph.D. Thesis, SUNY at Stony Brook, 2002.
21. N. Lynch, M. Tuttle, Hierarchical correctness proofs for distributed algorithms, in: Proc. Sixth ACM Symp. on Principles of Distributed Computing, 1987, pp. 137-151.
22. M. Minsky Recursive unsolvability of Post's problem of Tag and other topics in the theory of Turing machines Ann. of Math. 74 1961 437 455
23. M. Papazoglou Agent-oriented technology in support of e-business Comm. ACM 44 4 2001 71 77
24. P. San Pietro, Z. Dang, Automatic verification of multi-queue discrete timed automata, in: COCOON'03, Lecture Notes in Computer Science, Vol. 2697, Springer, Berlin, 2003, pp. 159-171.
25. A. Pnueli, R. Rosner, Distributed reactive systems are hard to synthesize, in: Proc. IEEE Symp. on Foundations of Computer Science, 1990.
26. W. Savitch Relationship between nondeterministic and deterministic tape complexities J. Comput. System Sci. 4 1970 177 192
27. G. Senizergues The equivalence problem for deterministic pushdown automata is decidable Lecture Notes in Computer Science Vol. 1256 1997 Springer Berlin 671 681
28. M. Singh, Semantical considerations on workflows: an algebra for intertask dependencies, in: Proc. Workshop on Database Programming Languages (DBPL), 1995.
29. W.M.P. van der Aalst On the automatic generation of workflow processes based on product structures Comput. Ind. 39 2 1999 97 111