Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
New Decidability Results Concerning Two-Way Counter Machines
SIAM Journal on Computing
Reversal-Bounded Multicounter Machines and Their Decision Problems
Journal of the ACM (JACM)
On the automatic generation of workflow processes based on product structures
Computers in Industry
Agent-oriented technology in support of e-business
Communications of the ACM
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
On the Emptiness Problem for Two-Way NFA with One Reversal-Bounded Counter
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Liveness Verification of Reversal-Bounded Multicounter Machines with a Free Counter
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Binary Reachability Analysis of Discrete Pushdown Timed Automata
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Semantical Considerations on Workflows: An Algebra for Intertask Dependencies
DBLP-5 Proceedings of the Fifth International Workshop on Database Programming Languages
Generalized discrete timed automata: decidable approximations for safety verification
Theoretical Computer Science - Computing and combinatorics
Presburger liveness verification of discrete timed automata
Theoretical Computer Science
Pushdown timed automata: a binary reachability characterization and safety verification
Theoretical Computer Science
Synthesizing Distributed Systems
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Semantic correctness of transactions and workflows
Semantic correctness of transactions and workflows
Distributed reactive systems are hard to synthesize
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Reversal-bounded multipushdown machines
Journal of Computer and System Sciences
Automatic verification of multi-queue discrete timed automata
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Automated composition of e-services: lookaheads
Proceedings of the 2nd international conference on Service oriented computing
Deterministic Simulation of a NFA with k---Symbol Lookahead
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Minimum-cost delegation in service composition
Theoretical Computer Science
Theoretical Computer Science
Journal of Automata, Languages and Combinatorics
Dynamic configuring service on semantic grid
WAIM '06 Proceedings of the 7th international conference on Advances in Web-Age Information Management
Hi-index | 0.00 |
Let ${\mathcal M}$ be a class of (possibly nondeterministic) language acceptors with a one-way input tape A system (A; A1, ..., Ar) of automata in ${\mathcal M}$, is composable if for every string w = a1 .. an of symbols accepted by A, there is an assignment of each symbol in w to one of the Ai's such that if wi is the subsequence assigned to Ai, then wi is accepted by Ai For a nonnegative integer k, a k-lookahead delegator for (A; A1, ..., Ar) is a deterministic machine D in ${\mathcal M}$ which, knowing (a) the current states of A, A1, ..., Ar and the accessible “local” information of each machine (e.g., the top of the stack if each machine is a pushdown automaton, whether a counter is zero on nonzero if each machine is a multicounter automaton, etc.), and (b) the k lookahead symbols to the right of the current input symbol being processed, can uniquely determine the Ai to assign the current symbol Moreover, every string w accepted by A is also accepted by D, i.e., the subsequence of string w delegated by D to each Ai is accepted by Ai Thus, k-lookahead delegation is a stronger requirement than composability, since the delegator D must be deterministic A system that is composable may not have a k-delegator for any k We look at the decidability of composability and existence of k-delegators for various classes of machines ${\mathcal M}$ Our results have applications to automated composition of e-services When e-services are modeled by automata whose alphabet represents a set of activities or tasks to be performed (namely, activity automata), automated design is the problem of “delegating” activities of the composite e-service to existing e-services so that each word accepted by the composite e-service can be accepted by those e-services collectively with each accepting a subsequence of the word, under possibly some Presburger constraints on the numbers and types of activities that can be delegated to the different e-services Our results generalize earlier ones (and resolve some open questions) concerning composability of deterministic finite automata as e-services to finite automata that are augmented with unbounded storage (e.g., counters and pushdown stacks) and finite automata with discrete clocks (i.e., discrete timed automata) We look at the decidability of composability and existence of k-delegators for various classes of machines ${\mathcal M}$ Our results have applications to automated composition of e-services E-services provide a general framework for discovery, flexible interoperation, and dynamic composition of distributed and heterogeneous processes on the Internet Automated composition allows a specified composite e-service to be implemented by composing existing e-services When e-services are modeled by automata whose alphabet represents a set of activities or tasks to be performed (namely, activity automata), automated design is the problem of “delegating” activities of the composite e-service to existing e-services so that each word accepted by the composite e-service can be accepted by those e-services collectively with each accepting a subsequence of the word, under possibly some Presburger constraints on the numbers and types of activities that can be delegated to the different e-services Our results generalize earlier ones (and resolve some open questions) concerning composability of deterministic finite automata as e-services to finite automata that are augmented with unbounded storage (e.g., counters and pushdown stacks) and finite automata with discrete clocks (i.e., discrete timed automata).