An Implementation of an Automated Protocol Synthesizer (APS) and Its Application to the X.21 Protocol

Ramamoorthy, C. V.; Dong, Shouling; Usuda, Yutaka

doi:10.1109/tse.1985.232547

Cited by 48 publications

(9 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The existing methods of this approach are reviewed as follows. [27] is used in automatically creating a PN of the peer entity of a two-party protocol. The approach designs one party (called local entity 3 in [271) first, verifies its correctness, then applies a set of well-designed transformation rules to generate the corresponding peer entity.…”

Section: Existing Synthesis Approachesmentioning

confidence: 99%

See 1 more Smart Citation

A synthesis technique of general petri nets

Chao

Wang

1994

Journal of Systems Integration

View full text Add to dashboard Cite

Abstract. The general Petri net (GPN) is useful for modeling flexible manufacturing systems with multiple robots and workstations [15] and for parallel programs [8]. A problem of using reachability analysis for analyzing Petri nets (PN) is the large number of states generated. Most of the existing synthesis techniques do not deal with GPN. Koh et al. [15] invented a synthesis technique for GPN. We propose to improve their achievement by adding the simple Arc-ratio rules to Yaw's knitting technique [37,38,39] based on the notion of structure relationship together with new path generations, which mark the most distinct feature compared with other approaches. The synthesis rules and procedures of how to update the temporal matrix and structure synchronic distance are presented. The Arc-ratio rules for GPN are also presented. One can successfully synthesize complicated Petri nets using these rules. An example to synthesize a Petri net in [15] is illustrated. The correctness of each synthesis rule with an appropriate Arc-ratio rule for GPN is proved.

show abstract

Section: Existing Synthesis Approachesmentioning

confidence: 99%

“…Messages received by an entity must be properly handled. If a received message is not consumed by any process of the entity, the PN is incomplete [27]. Thus, each PSP in Xjg must be able to receive tokens.…”

Section: Z4 (Interactive Tt Generation)mentioning

confidence: 99%

A synthesis technique of general petri nets

Chao

Wang

1994

Journal of Systems Integration

View full text Add to dashboard Cite

show abstract

“…Further, we generate the sufficient and necessary deadlock-free Conditions (DFCs) for SMEs [5]. Most synthesis approaches, including top-down/bottom-up [10,[14][15], peer entity generation [16], and the knitting technique [1][2][3][4], do not deal with processes sharing resources. We were thus, motivated, in this work, to extend the knitting technique so that it can also handle Petri net with shared resources.…”

Section: Backward Generationmentioning

confidence: 99%

Petri net synthesis and synchronization using knitting technique

Chao

Wang

Proceedings of IEEE International Conference on Systems, Man and Cybernetics

View full text Add to dashboard Cite

Petri net (PN) synthesis can avoid the state exploration problem, which is of exponential complexity, by guaranteeing the correctness in the Petri net while incrementally expanding the net. The conventional Petri net synthesis approaches, in general, suffer the drawback of only being able to synthesize a few classes of nets. However, the knitting technique, originally proposed by Chao [1-4], can synthesize Petri nets beyond assymetricchoice nets. In addition, one major advantage of the knitting technique is that the resultant Petri net is guaranteed to be live, bounded, and reversible -the well-behaved properties. Therefore, the cumbersome reanalysis and modification procedures that are inevitable for the conventional Petri net synthesis methods can be avoided. Most current synthesis techniques cannot handle systems with shared resources. Zhou et al. [5] presented the conditions for a PN containing Sequential Mutual Exclusion (SME) to be live, bounded, and deadlock-free. The major motivation of this work is to generalize Zho et al.'s pioneering work [5] and to extend the knitting technique to construction of classes of PNs that involve synchronization and shared resources according to the synthesis rules. In addition, the knitting technique developed prior to this work concentrated on the structural relationships among the pseudo-processes only and was not related to the marking. This paper is the first work to consider marking in the PN synthesis with the knitting technique.

show abstract

“…Whenever P changes to P 0 by adding p, generate Q 0 from P;p;Q so that P S 0 consisting of P 0 and Q 0 is free from deadlocks and The proposed method for adding behaviour expressions in a protocol specication is basically a two steps procedure. step 1: From the behaviour expression that is added to the behaviour expression of an entity, we get the peer behaviour expression which is going to be added to the other entity, [5], [6], [7]. We get the peer behaviour expression, q; from p as shown in the Algorithm 3.1. step 2: We add q to Q (or its sub-entities) to obtain Q 0 .…”

Section: Communication Modelmentioning

confidence: 99%

A flexible approach for extension of communication protocols

Bista

Takahashi

Kinoshita

et al.

Proceedings Twelfth International Conference on Information Networking (ICOIN-12)

View full text Add to dashboard Cite

Users of computer communication systems and their requirements are r apidly increasing and changing. In order to deal such a situation a rapid development method o f c ommunication systems is necessary. One of the such development methods is to change an existing specication of the system to obtain the desired specication of the system. However, a very little work has been done to support making changes in formal specications. In this paper, we propose a mechanism for making changes in formal protocol specications by adding protocol functions in an existing protocol specication.

show abstract

An Implementation of an Automated Protocol Synthesizer (APS) and Its Application to the X.21 Protocol

Cited by 48 publications

References 12 publications

A synthesis technique of general petri nets

A synthesis technique of general petri nets

Petri net synthesis and synchronization using knitting technique

A flexible approach for extension of communication protocols

Contact Info

Product

Resources

About