Simple representative instantiations for multicast protocols

Authors:
Javier Esparza;Monika Maidl
Affiliations:
School of Informatics, University of Edinburgh;School of Informatics, University of Edinburgh
Venue:
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Year:
2003

Citing 6
Cited 0

Characterizing finite Kripke structures in propositional temporal logic

Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
Model checking and modular verification

ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about rings

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Stutter-invariant temporal properties are expressible without the next-time operator

Information Processing Letters
Extrapolating Tree Transformations

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Light-weight multicast services (LMS): a router-assisted scheme for reliable multicast

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a formal model for multicast network protocols working on arbitrary tree structures. We give sufficient conditions under which correctness of the protocol for all structures reduces to correctness for the structures with at most one layer of internal nodes. If additional conditions hold, we can reduce further to correctness for one single structure. All these results can be applied to (an abstract version of) the Pragmatic General Multicast protocol.