Formal Methods in Communication Protocol Design

Bochmann, Gregor von; Sunshine, Carl A.

doi:10.1109/tcom.1980.1094685

Cited by 184 publications

(44 citation statements)

References 22 publications

(4 reference statements)

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The composed machine is obtained from a reachability graph [Wes78, BoSu80,BrZa83] that described the collective behavior of the system components in terms of internal and external actions of the system. In the following subsection we give the details of building a reachability graph and a composed machine.…”

Section: A System Of Communicating Fsmsmentioning

confidence: 99%

See 1 more Smart Citation

FSM Based Interoperability Testing Methods for Multi Stimuli Model

El-Fakih

Trenkaev

Spitsyna

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In this paper, we propose two fault models and methods for the derivation of interoperability test suites when the system implementation is given in the form of two deterministic communicating finite state machines. A test suite returned by the first method enables us to determine if the implementation is free of livelocks. If the implementation is free of livelocks, the second method returns a test suite that checks if the implementation conforms to the specification. Application examples are used to illustrate the methods.

show abstract

Section: A System Of Communicating Fsmsmentioning

confidence: 99%

“…To describe the joint behavior of a SCFSM we build a reachability graph G [Wes78, BoSu80,BrZa83]. The reachability graph G is a pair (V,E), where the set V of vertices represents the set of so-called global states of the system.…”

Section: Reachability Graph and Composed Fsmmentioning

confidence: 99%

FSM Based Interoperability Testing Methods for Multi Stimuli Model

El-Fakih

Trenkaev

Spitsyna

et al. 2004

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…(1) the goal state is derived and the inference procedure is successful; or (2) the goal state has not been achieved, but the conflict set in Step 2 is empty.…”

Section: Controlled Production Systemsmentioning

confidence: 99%

“…Figure 6( The information flows passed through the communication network to carry out the task-negotiation procedure is shown in Figure 7. (2) OP5 (3) OP7 (4) OP6 (6) CELL #5 OPl (4) OP6 (2) OP7 (2) OP8 (4) OP9 (5) OP10(l) OPl (6) OP4 (2) OP5 (4) OP6 (5) OP7 (3) OP8 (3) OP9 (6) OP10(9) The job hierarchy in the example. The precedence relations between the tasks the SPT rule (Baker 1974 The definition of the places used in the nets is shown in Table 2.…”

mentioning

confidence: 99%

A distributed knowledge-based approach to flexible automation: The contract net framework

Shaw

Whinston

1988

Int J Flex Manuf Syst

View full text Add to dashboard Cite

This paper applies distributed artificial intelligence to the real-time planning and control of flexible manufacturing systems (FMS) consisting of asynchronous manufacturing cells. A knowledge-based approach is used to determine the course of action, resource sharing, and processor assignments. Within each cell there is an embedded automatic planning system that executes dynamic scheduling and supervises manufacturing operations. Because of the decentralized control, realtime task, assignments are carried out by a negotiation process among cell hosts.The negotiation process is modeled by augmented Petri nets -the combination of production rules and Petri nets -and is executed by a distributed, rule-based algorithm.

show abstract

“…If time is not modeled explicitly, then one is forced to resort to informal arguments about global timing relations in the system. Such informal arguments are inadequate and are the source of many protocol system design errors [3].…”

Section: Real-time Behaviormentioning

confidence: 99%

An HDLC protocol specification and its verification using image protocols

Shankar

Lam

1983

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

We use an event-driven process model to specify a version of the High-Level Data Link Control (HDLC) protocol between two communicating protocol entities. The protocol is verified using the method of projections. The verification serves as a rigorous exercise to demonstrate the applicability of this method to the analysis of real-life communication protocols.The HDLC protocol has two characteristics found in most real-life communication protocols. First, the HDLC protocol operates under real-time constraints that are important not only for its performance but also for its correct logical behavior. We specify this real-time behavior using time variables and time events. Second, the HDLC protocol has three distinguishable functions: connection management, and one-way data transfers between the protocol entities. For each of these functions, we construct an image protocol using the method of projections. With each image protocol we obtain inductively complete invariant assertions that state various desirable logical safety properties. From the properties of image protocols it follows that these safety properties as proved for the image protocols are also satisfied by the HDLC protocol presented herein. We also suggest a minor modification to HDLC that will make it well-structured.

show abstract

Formal Methods in Communication Protocol Design

Abstract: serves as Vice-chairman (United States) of IFIP Working Group 6.4 on Local Computer Networks.

Cited by 184 publications

References 22 publications

FSM Based Interoperability Testing Methods for Multi Stimuli Model

FSM Based Interoperability Testing Methods for Multi Stimuli Model

A distributed knowledge-based approach to flexible automation: The contract net framework

An HDLC protocol specification and its verification using image protocols

Contact Info

Product

Resources

About