A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols
DOI10.1007/978-3-319-17581-2_6zbMath1328.68026OpenAlexW1197491111MaRDI QIDQ3460215
Mamoun Filali, Meriem Ouederni, Jean-Baptiste Raclet
Publication date: 6 January 2016
Published in: Communications in Computer and Information Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-17581-2_6
Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Permutation rewriting and algorithmic verification
- Semi-commutations
- Termination detection for diffusing computations
- A brief account of runtime verification
- Deciding choreography realizability
- On Communicating Finite-State Machines
- Time, clocks, and the ordering of events in a distributed system
- Communication-based prevention of useless checkpoints in distributed computations
This page was built for publication: A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols