On composition and lookahead delegation of e-services modeled by automata,
暂无分享,去创建一个
Oscar H. Ibarra | Zhe Dang | Jianwen Su | O. Ibarra | Jianwen Su | Z. Dang
[1] Rajeev Alur,et al. A Theory of Timed Automata , 1994, Theor. Comput. Sci..
[2] Oscar H. Ibarra,et al. Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter , 2001, FSTTCS.
[3] Amir Pnueli,et al. Distributed reactive systems are hard to synthesize , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[4] Diego Calvanese,et al. Automatic Composition of E-services That Export Their Behavior , 2003, ICSOC.
[5] Oscar H. Ibarra,et al. Reversal-Bounded Multicounter Machines and Their Decision Problems , 1978, JACM.
[6] Martín Abadi,et al. Realizable and Unrealizable Specifications of Reactive Systems , 1989, ICALP.
[7] Géraud Sénizergues,et al. The Equivalence Problem for Deterministic Pushdown Automata is Decidable , 1997, ICALP.
[8] Jianwen Su,et al. E-services: a look behind the curtain , 2003, PODS.
[9] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[10] Zhe Dang,et al. Pushdown timed automata: a binary reachability characterization and safety verification , 2001, Theor. Comput. Sci..
[11] Tero Harju,et al. Some Decision Problems Concerning Semilinearity and Commutation , 2002, J. Comput. Syst. Sci..
[12] Shiyong Lu,et al. Semantic correctness of transactions and workflows , 2002 .
[13] Mike P. Papazoglou,et al. Agent-oriented technology in support of e-business , 2001, CACM.
[14] Munindar P. Singh. Semantical Considerations on Workflows: An Algebra for Intertask Dependencies , 1995, DBPL.
[15] Tao Jiang,et al. New Decidability Results Concerning Two-Way Counter Machines , 1995, SIAM J. Comput..
[16] Orna Kupferman,et al. Synthesizing Distributed Systems , 2001, LICS.
[17] Oscar H. Ibarra,et al. Binary Reachability Analysis of Discrete Pushdown Timed Automata , 2000, CAV.
[18] Oscar H. Ibarra,et al. On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter , 2002, ISAAC.
[19] Zhe Dang,et al. Presburger liveness verification of discrete timed automata , 2003, Theor. Comput. Sci..
[20] Zhe Dang,et al. Automatic Verification of Multi-queue Discrete Timed Automata , 2003, COCOON.
[21] Oscar H. Ibarra,et al. Automated composition of e-services: lookaheads , 2004, ICSOC '04.
[22] W.M.P. van der Aalst,et al. On the automatic generation of workflow processes based on product structures , 1999 .
[23] Oscar H. Ibarra,et al. Generalized discrete timed automata: decidable approximations for safety verificatio , 2003, Theor. Comput. Sci..
[24] S. Ginsburg,et al. Semigroups, Presburger formulas, and languages. , 1966 .
[25] J. R. Büchi,et al. Solving sequential conditions by finite-state strategies , 1969 .
[26] M. Minsky. Recursive Unsolvability of Post's Problem of "Tag" and other Topics in Theory of Turing Machines , 1961 .
[27] Brenda S. Baker,et al. Reversal-Bounded Multipushdown Machines , 1974, J. Comput. Syst. Sci..
[28] Nancy A. Lynch,et al. Hierarchical correctness proofs for distributed algorithms , 1987, PODC '87.
[29] O. Kupermann,et al. Synthesizing distributed systems , 2001, Proceedings 16th Annual IEEE Symposium on Logic in Computer Science.