Verification of an Audio Protocol with bus collision using Uppaal

Bengtsson, Johan; Griffioen, W. O. David; Kristoffersen, K.; Larsen, Kim Guldstrand; Larsson, Fredrik; Pettersson, Paul; Yi, Wang

doi:10.1007/3-540-61474-5_73

Cited by 76 publications

(45 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A natural question to ask is whether the formulae in the property language SBLL are testable, in the sense of this paper, when interpreted with respect to the transition relation ~. In the full version of this work, we shall show that this is indeed possible if the test automata are allowed to have committed locations [5], and the definition of the parallel composition operator is modified to take the nature of these locations into account. We expect, however, that the weak interpretation of the property language will be more useful in practical applications of our approach to model-checking.…”

Section: Discussionmentioning

confidence: 96%

“…More experimental activity will be needed to fully test the feasibility of model-checking via reachability testing. So far, all the case studies carried out with the use of UPPAAL (see, e.g., [5,13,14]) seem to support the conclusion that this approach to model-checking can indeed be applied to realistic case studies, but further evidence needs to be accumulated to substantiate this claim. In this process of experimentation, we also expect to further develop a collection of heuristics that can be used to reduce the size of the test automata obtained by means of our automatic translation of formulae into automata.…”

Section: Discussionmentioning

confidence: 99%

“…Model-checking of real time systems has been extensively studied in the last few years, leading to both important theoretical results, setting the limits of decidability [3,10], and to the emergence of practical tools as HyTech [9], Kronos [18] and UPPAAL [6], which have been successfully applied to the verification of real sized systems [5,12].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Model checking via reachability testing for timed automata

Aceto

Burgueño

Larsen

1998

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

Abstract.In this paper we develop an approach to model-checking for timed automata via teachability testing. As our specification formalism, we consider a dense-time property language with clocks. This property language may be used to express safety and bounded liveness properties of real-time systems. We show how to automatically synthesize, for every formula ~, a test automaton T~, in such a way that checking whether a system S satisfies the property ~o can be reduced to a reachability question over the system obtained by making Tv interact with S.

show abstract

Section: Discussionmentioning

confidence: 96%

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Model checking via reachability testing for timed automata

Aceto

Burgueño

Larsen

1998

Tools and Algorithms for the Construction and Analysis of Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…Model checkers for timed and hybrid automata have been used successfully to analyze various physical level communication protocols for consumer electronics devices [9,16,20,6,18]. Since these protocols typically use variations of biphase mark (e.g.…”

Section: Related Work and Concluding Remarksmentioning

confidence: 99%

Analysis of a biphase mark protocol with U ppaal and PVS

Vaandrager

Groot

2006

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. The biphase mark protocol is a convention for representing both a string of bits and clock edges in a square wave. The protocol is frequently used for communication at the physical level of the ISO/OSI hierarchy, and is implemented on microcontrollers such as the Intel 82530 Serial Communications Controller. An important property of the protocol is that bit strings of arbitrary length can be transmitted reliably, despite differences in the clock rates of sender and receiver (drift), variations of the clock rates (jitter), and distortion of the signal after generation of an edge. In this article, we show how the protocol can be modelled naturally in terms of timed automata. We use the model checker Uppaal to derive the maximal tolerances on the clock rates, for different instances of the protocol, and to support the general parametric verification that we formalized using the proof assistant PVS. Based on the derived parameter constraints we propose instances of BMP that are correct (at least in our model) but have a faster bit rate than the instances that are commonly implemented in hardware.

show abstract

“…In practice, using QTA transfers the problem of verifying a QoS statement of a distributed system into a reachability analysis in a network of Timed Automata, which can be carried out via model checkers. In this paper, we shall use UPPAAL [6,9], which has been successfully applied to the verification of real-time systems [8,14,18].…”

Section: Introductionmentioning

confidence: 99%

Verification of Timeliness QoS Properties in Multimedia Systems

Bordbar

Okano

2003

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract.One of the main challenges of the design of object-based Distributed Multimedia Systems is to address the performance related issues such as the Quality of Service (QoS). The specification of QoS is a crucial part of architectural object-based methods such as Open Distributed Processing (ODP). In the ODP, a QoS property assigned to an object is modelled via two clauses of required and provided QoS statements, which specify the level of QoS required/provided by an object from/to its environment, respectively. An over-demanding QoS statement can be beyond the physical limitation of the system and might result in inconsistencies. In particular, to produce a correct design, it is crucial to study the effect of QoS statements of components on the overall behaviour of the system in earlier stages of the design. This paper develops a theory for the verification of Timeliness QoS properties such as Jitter, Throughput and Latency. The approach adopted is based on the idea of Test Automata. We shall present a formal definition of Timeliness QoS properties, which is used for the creation of Test Automata. Such Test Automata, which we shall refer to as QoS Timed Automata, can be used to verify the corresponding QoS Timeliness property. The method is illustrated by the verification of Throughput in a Video Player systems via the model checker UPPAAL.

show abstract

Verification of an Audio Protocol with bus collision using Uppaal

Cited by 76 publications

References 4 publications

Model checking via reachability testing for timed automata

Model checking via reachability testing for timed automata

Analysis of a biphase mark protocol with U ppaal and PVS

Verification of Timeliness QoS Properties in Multimedia Systems

Contact Info

Product

Resources

About