A generic framework for \(n\)-protocol compatibility checking
From MaRDI portal
Publication:433347
DOI10.1016/j.scico.2011.03.009zbMath1245.68028OpenAlexW85326815MaRDI QIDQ433347
Meriem Ouederni, Gwen Salaün, Francisco Durán
Publication date: 13 July 2012
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2011.03.009
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) General topics in the theory of software (68N01)
Related Items (5)
An Event-B based approach for cloud composite services verification ⋮ On the diversity of asynchronous communication ⋮ Can we communicate? Using dynamic logic to verify team automata ⋮ A modular framework for verifying versatile distributed systems ⋮ Research on the dynamic reconfiguration of Web application using two-phase compatibility verification
Uses Software
Cites Work
- Symbolic bisimulations
- Modal logics for mobile processes
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- A calculus of communicating systems
- Conditional rewriting logic as a unified model of concurrency
- Maude: specification and programming in rewriting logic
- On the usability of process algebra: An architectural view
- Specification and proof in membership equational logic
- CADP 2010: A Toolbox for the Construction and Analysis of Distributed Processes
- On Communicating Finite-State Machines
- Automatic Generation of Adaptation Contracts
- Compatibility and inheritance in software architectures
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A generic framework for \(n\)-protocol compatibility checking
