An algebraic verification of a mobile network
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3958712 (Why is no real title available?)
- scientific article; zbMATH DE number 4022620 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 42237 (Why is no real title available?)
- scientific article; zbMATH DE number 140247 (Why is no real title available?)
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Algebraic specification and verification of communication protocols
- Applications of Process Algebra
- Modal logics for mobile processes
- The formalization and analysis of a communications protocol
Cited in
(15)- A partition refinement algorithm for the -calculus
- Using extended logic programming for alarm-correlation in cellular phone networks
- Verification techniques for a network algebra
- Type inference and strong static type checking for Promela
- The Maude LTL model checker
- Algebraic specification and verification of communication protocols
- Coalgebraic minimization of HD-automata for the \(\pi\)-calculus using polymorphic types
- A process calculus BigrTiMo of mobile systems and its formal semantics
- On the decidability of process equivalences for the \(\pi\)-calculus
- Basic observables for a calculus for global computing
- On the decidability of process equivalences for the \(\pi\)-calculus
- scientific article; zbMATH DE number 1949603 (Why is no real title available?)
- A Practical Approach to Verification of Mobile Systems Using Net Unfoldings
- Efficient verification of a multicast protocol for mobile computing
- Names of the -calculus agents handled locally
This page was built for publication: An algebraic verification of a mobile network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1205185)
