Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition

DOI10.1016/j.entcs.2009.06.036zbMath1291.68277MaRDI 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

zbMATH Keywords

computational complexity; controller synthesis; service composition

Mathematics Subject Classification ID

68Q45: Formal languages and automata

68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68M11: Internet topics

Uses Software

• SWORD

Cites Work

• Unnamed Item
• Proof methods for modal and intuitionistic logics
• Deciding true concurrency equivalences on safe, finite nets
• Games for synthesis of controllers with partial observation.
• The variable hierarchy of the \(\mu\)-calculus is strict
• AUTOMATIC SERVICE COMPOSITION VIA SIMULATION