Modeling and Verification of End-to-End Protocols

Danthine, André

doi:10.1007/978-94-009-7760-0_11

Cited by 3 publications

(2 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The concept of backward execution of protocols and service specifications has already been studied in [DB78] [Hol85], and more recently, by using logic programming concepts related to ours, in [Lin90]. From the above, it should be clear that backward reasoning uses both backward execution and conventional forward execution.…”

Section: Backward Reasoning In Lotosmentioning

confidence: 99%

Feature Interaction Detection using Backward Reasoning with LOTOS

Stepien

Logrippo

1995

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

The problem of detecting feature interactions in telephone systems design is addressed. The method proposed involves specification of the features in LOTOS, and uses an analysis technique called backward reasoning. This is is implemented in LOTOS by a combination of backward and forward execution. A tool to help carry out backward execution is presented. A detailed example ofthe use of the technique is given, involving the three-way-calling and call-waiting features.

show abstract

Section: Backward Reasoning In Lotosmentioning

confidence: 99%

Feature Interaction Detection using Backward Reasoning with LOTOS

Stepien

Logrippo

1995

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

show abstract

“…A Petri net [1, 6,23] is an abstract, formal model of systems with interacting, concurrent or parallel components. Petri nets have been successfully used in modelling, validation and analysis of systems in which it is possible for some events to occur concurrently but there are constraints on the concurrence, precedence, or frequency of these occurrences [6,9,11,14,15,22]. Petri nets, however, are not complete enough for the study of performance issues since no assumption is made on the duration of systems activities.…”

Section: Introductionmentioning

confidence: 99%

M-timed Petri nets, priorities, preemptions, and performance evaluation of systems

Zuberek

Advances in Petri Nets 1985

View full text Add to dashboard Cite

In M-timed Petri nets, firing times are exponentially distributed random variables associated with transitions of a net. Several classes of M-timed Petri nets are discussed in this paper to show increasing "modelling power" of different nets. Conflict-free nets can model M and E k -type queueing systems. Free-choice nets can also represent H k -type systems. Systems with several classes of users and with service priorities assigned to user classes require nets with inhibitor arcs. Preemption of service can be represented by extended nets with escape (or generalized inhibitor) arcs. Finally, to provide flexible modelling of scheduling and decision strategies, enhanced Petri nets are introduced with two classes of transitions, immediate and timed ones, and with (exponentially distributed) firing times associated with the timed transitions. It is shown that the behaviour of bounded M-timed Petri nets can be represented by finite "state" graphs which are finite-state continuous-time homogeneous Markov processes. Stationary probabilities of states can thus be obtained by standard techniques used for analysis of Markov chains, and then operational analysis can be applied for performance evaluation. Simple models of interactive systems are used as an illustration of modelling.

show abstract

Protocol Representation with Finite-State Models

Danthine

1980

IEEE Trans. Commun.

View full text Add to dashboard Cite

Modeling and Verification of End-to-End Protocols

Cited by 3 publications

References 14 publications

Feature Interaction Detection using Backward Reasoning with LOTOS

Feature Interaction Detection using Backward Reasoning with LOTOS

M-timed Petri nets, priorities, preemptions, and performance evaluation of systems

Protocol Representation with Finite-State Models

Contact Info

Product

Resources

About