Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
DOI10.1016/J.ENTCS.2009.06.036zbMATH Open1291.68277OpenAlexW2100891401MaRDI QIDQ5166610
Guillaume Feuillade, Fahima Cheikh, Philippe Balbiani
Publication date: 27 June 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2009.06.036
Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Internet topics (68M11)
Cites Work
Uses Software
Recommendations
- Unnamed Item π π
- Unnamed Item π π
- Unnamed Item π π
- Parametrized automata simulation and application to service composition π π
- Compositional synthesis of asynchronous automata π π
- AutoSyn: A new approach to automated synthesis of composite web services with correctness guarantee π π
- CONCUR 2003 - Concurrency Theory π π
- Automated synthesis of asynchronizations π π
This page was built for publication: Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition