Abstract
In mobile systems, some nodes link dynamically through different channels at different times. The π-calculus is a popular process algebra for specification and verification of systems with dynamic linking and synchronous, rendezvous message passing communication of component processes. Dynamic linking can be elegantly specified in it by sending channels to be used for further communication as messages. However, in order to be able to use the π-calculus, one has to learn its process-algebraic concepts and laws. On the other hand, specification and verification in the Temporal Logic of Actions (TLA) is almost entirely based on ordinary mathematics (i.e., first-order predicate logic, set theory, etc.). Therefore, this paper proposes a TLA approach to the specification and verification of systems with synchronous communication and dynamic linking similar to the π-calculus one. It is presented with help of a TLA specification and verification of a parametric mobile network handover procedure which has previously been specified with the π-calculus. In fact, TLA+ is used as the specification language, thus achieving completely formal specifications.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
