A compositional framework to the specification of service protocols controllability and substitutability

DOI10.1080/00207160.2013.827177MaRDI QIDQ2921918zbMATH OpenOpenAlexFDO

Authors Nabil Hameurlain

Publication date 14 October 2014

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207160.2013.827177

zbMATH Keywords

asynchronous compositioncontrollabilityrefinementservice protocolssubstitutability

Mathematics Subject Classification ID

Network protocols (68M12)

Recommendations

• A controller synthesis framework for automated service composition
• Deriving protocol specifications from service specifications written as Predicate/Transition-nets
• Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study

Cites work

• CADP 2010: a toolbox for the construction and analysis of distributed processes
• Conversation protocols: a formalism for specification and verification of reactive electronic services
• Modular construction and partial order semantics of Petri nets
• Refinement and asynchronous composition of modal Petri nets

Cited in

(6)

• Analysing and determining substitutability of different granularity Web services
• Checking protocol compatibility using Maude
• Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata
• Does My Service Have Partners?
• A generic framework for n-protocol compatibility checking
• Deriving protocol specifications from service specifications written as Predicate/Transition-nets

Describes a project that uses

Uses Software

• CADP
• INA

This page was built for publication: A compositional framework to the specification of service protocols controllability and substitutability

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