Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata

DOI10.1007/978-3-540-75698-9_4zbMath1141.68345OpenAlexW4236927140MaRDI QIDQ3508514

Mahdi Niamanesh, Rasool Jalili

Publication date: 1 July 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75698-9_4

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Network protocols (68M12)

Related Items (1)

Modeling Routing Protocols in Adhoc Networks

This page was built for publication: Formalizing Compatibility and Substitutability in Communication Protocols Using I/O-Constraint Automata