Bridging the gap between formal specification and analysis of communication protocols

SDL, Estelle and LOTOS are three high-level formal description techniques (FDT) that have been developed and standardized by the international organizations, the CCITT and ISO respectively, for the specification of industry-strength communication protocols. It is crucial to formally verify an FDT protocol specification before its implementation. Most formal analysis and verification techniques for communication protocols, however, have been based on mathematically simple low-level formulations such as finite state machines (FSM) or extension of this model (EFSM). There is a gap between the low-level formal models and the high-level FDTs in terms of expressive power and verifiability, which prohibits the use of existing state/transition based formal analysis methods, such as reachability analysis, for direct use in the formal verification of the protocols specified in the FDTs. This paper proposes a uniform framework as an approach to bridging the gap through systematic reduction of the FDT protocol specifications to a common intermediate model called the structured system of communicating machines (SSCM) which is an EFSM based, powerful, yet rather simply defined formalism. LOTOS is then used to demonstrate the applicability of the approach by developing a complete set of transformation rules and providing the proof for the semantic perseverance of those transformation rules under a well-defined event trace equivalence.

[1]  A. Jirachiefpattana,et al.  Verification results for the ISO ROSE protocol specified in Estelle , 1995 .

[2]  Robin Milner,et al.  A Calculus of Communicating Systems , 1980, Lecture Notes in Computer Science.

[3]  Michel Diaz,et al.  Modeling and Analysis of Communication and Cooperation Protocols Using Petri Net Based Models , 1982, Comput. Networks.

[4]  Gregor von Bochmann,et al.  Finite State Description of Communication Protocols , 1978, Comput. Networks.

[5]  Gregor von Bochmann,et al.  Specifications of a Simplified Transport Protocol Using Different Formal Description Techniques , 1990, Comput. Networks ISDN Syst..

[6]  David J. Kaufman,et al.  An Extended Finite State Machine Approach to Protocol Specification , 1982, PSTV.

[7]  Daniel Brand,et al.  On Communicating Finite-State Machines , 1983, JACM.

[8]  Tommaso Bolognesi,et al.  Tableau methods to describe strong bisimilarity on LOTOS processes involving pure interleaving and enabling , 1994, FORTE.

[9]  Raymond E. Miller Protocol verification: the first ten years, the next ten years; some personal observations , 1990, PSTV.

[10]  Gregor von Bochmann,et al.  Method of analysing extended finite-state machine specifications , 1990, Comput. Commun..

[11]  Joseph Sifakis,et al.  Compilation and verification of LOTOS specifications , 1990, PSTV.

[12]  Luigi Logrippo,et al.  An expressive trace theory for LOTOS , 1991, PSTV.

[13]  Jean-Pierre Courtiat,et al.  Petri nets are good for protocols , 1984, Comput. Commun. Rev..