Parametrized automata simulation and application to service composition
DOI10.1016/J.JSC.2014.09.029zbMATH Open1314.68035OpenAlexW2064341026MaRDI QIDQ485834FDOQ485834
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
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
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)
Cites Work
- Web services. Concepts, architectures and applications
- AUTOMATIC SERVICE COMPOSITION VIA SIMULATION
- Automatic behavior composition synthesis
- Well-structured transition systems everywhere!
- Modal specifications for the control theory of discrete event systems
- Reachability in two-clock timed automata is PSPACE-complete
- Title not available (Why is that?)
- Finite-memory automata with non-deterministic reassignment
- Synthesis from Component Libraries
- Undecidability of bisimilarity for Petri nets and some related problems
- On the verification of security-aware E-services
- Finite state machines for strings over infinite alphabets
- Intractability of decision problems for finite-memory automata
- Nominal automata for resource usage control
- Controller/orchestrator synthesis via filtration
- Title not available (Why is that?)
- Synthesis of secure adaptors
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)
