Parametrized automata simulation and application to service composition

DOI10.1016/J.JSC.2014.09.029MaRDI QIDQ485834zbMATH OpenOpenAlexFDO

Authors Walid Belkhir, Yannick Chevalier, Michaël Rusinowitch

Publication date 14 January 2015

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2014.09.029

zbMATH Keywords

service compositioninfinite alphabetcomposition synthesisparametrized automatasimulation preorder

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Specification and verification (program logics, model checking, etc.) (68Q60) Internet topics (68M11)

Recommendations

• AUTOMATIC SERVICE COMPOSITION VIA SIMULATION
• A parametrized propositional dynamic logic with application to service synthesis
• On composition and lookahead delegation of \(e\)-services modeled by automata
• Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
• Algorithms and Computation

Cites work

• scientific article; zbMATH DE number 1500523 (Why is no real title available?)
• scientific article; zbMATH DE number 1759750 (Why is no real title available?)
• AUTOMATIC SERVICE COMPOSITION VIA SIMULATION
• Automatic behavior composition synthesis
• Controller/orchestrator synthesis via filtration
• Finite state machines for strings over infinite alphabets
• Finite-memory automata with non-deterministic reassignment
• Intractability of decision problems for finite-memory automata
• Modal specifications for the control theory of discrete event systems
• Nominal automata for resource usage control
• On the verification of security-aware E-services
• Reachability in two-clock timed automata is PSPACE-complete
• Synthesis from Component Libraries
• Synthesis of secure adaptors
• Undecidability of bisimilarity for Petri nets and some related problems
• Web services. Concepts, architectures and applications
• Well-structured transition systems everywhere!

Cited in

(6)

• Algorithms and Complexity of Automata Synthesis by Asynhcronous Orchestration With Applications to Web Services Composition
• A parametrized propositional dynamic logic with application to service synthesis
• Algorithms and Computation
• Automata for Specifying and Orchestrating Service Contracts
• On the complexity of decision problems for parameterized finite state synchronous transducers
• AUTOMATIC SERVICE COMPOSITION VIA SIMULATION

This page was built for publication: Parametrized automata simulation and application to service composition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q485834)