An algebraic verification of a mobile network

DOI10.1007/BF01211473zbMath0782.68081MaRDI QIDQ1205185

Fredrik Orava, Joachim Parrow

Publication date: 1 April 1993

Published in: Formal Aspects of Computing (Search for Journal in Brave)

zbMATH Keywords

process algebramobile networkscommunication protocolsalgebraic verification

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Basic observables for a calculus for global computing, On the decidability of process equivalences for the π-calculus, On the decidability of process equivalences for the \(\pi\)-calculus, Unnamed Item, Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types, Type inference and strong static type checking for Promela, A process calculus BigrTiMo of mobile systems and its formal semantics, A Practical Approach to Verification of Mobile Systems Using Net Unfoldings, Names of the \(\pi\)-calculus agents handled locally, A partition refinement algorithm for the \(\pi\)-calculus

Cites Work

• Modal logics for mobile processes
• A calculus of mobile processes. I
• A calculus of mobile processes. II
• The formalization and analysis of a communications protocol
• Algebraic specification and verification of communication protocols
• Applications of Process Algebra
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item