Parametrized automata simulation and application to service composition

DOI10.1016/j.jsc.2014.09.029zbMath1314.68035OpenAlexW2064341026MaRDI QIDQ485834

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) Specification and verification (program logics, model checking, etc.) (68Q60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Internet topics (68M11)

Cites Work

• Unnamed Item
• Unnamed Item
• Automatic behavior composition synthesis
• On the verification of security-aware E-services
• Undecidability of bisimilarity for Petri nets and some related problems
• Synthesis of secure adaptors
• Modal specifications for the control theory of discrete event systems
• Intractability of decision problems for finite-memory automata
• Web services. Concepts, architectures and applications
• Nominal Automata for Resource Usage Control
• FINITE-MEMORY AUTOMATA WITH NON-DETERMINISTIC REASSIGNMENT
• Controller/Orchestrator Synthesis via Filtration
• AUTOMATIC SERVICE COMPOSITION VIA SIMULATION
• Synthesis from Component Libraries
• Finite state machines for strings over infinite alphabets
• Reachability in Two-Clock Timed Automata Is PSPACE-Complete
• Well-structured transition systems everywhere!

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