Timed Sequence Diagrams and Tool-Based Analysis — A Case Study

Firley, Thomas; Huhn, Michaela; Diethers, Karsten; Gehrke, Thomas; Goltz, Ursula

doi:10.1007/3-540-46852-8_45

Cited by 34 publications

(26 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The translation is similar to the construction by Firley et al [8], but includes stuttering states, i.e., states that allow arbitrary stimuli to occur in-between the stimuli that are required by the messages of the UML collaboration. Following the UML, we thus view collaborations as incomplete specifications of possible system runs where arbitrary message exchange may occur between the explicitly specified messages.…”

Section: Representation Of Uml Collaborations In Uppaalmentioning

confidence: 99%

“…A more elaborate scheme checking the sender and receiver stored in additional global variables is easily devised [8]. Note, however, that Firley et al [8] check the originator of a stimulus before communication is accepted which may become problematic when different instances send stimuli for the same signal to the same instance.…”

Section: Representation Of Uml Collaborations In Uppaalmentioning

confidence: 99%

“…The timed state machines of a UML model are compiled into timed automata, as used by the model checker uppaal [13]. A time-annotated collaboration is translated into an observer uppaal timed automaton using basically the same techniques as described by Firley et al [8]. The model checker uppaal is called upon to verify the timed automata representing the model against the observer timed automaton.…”

Section: Introductionmentioning

confidence: 99%

“…Again, the GRC problem serves as a case study. A translation of UML collaborations with time-constraints into uppaal timed automata has been presented by Firley et al [8], though no implementation seems to be available. Also related is the translation of hierarchical timed automata into flat uppaal timed automata by David and Möller [6].…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Model Checking Timed UML State Machines and Collaborations

Knapp

Merz

Rauh

2002

Lecture Notes in Computer Science

157

100

View full text Add to dashboard Cite

Abstract. We describe a prototype tool, hugo/RT, that is designed to automatically verify whether the timed state machines in a UML model interact according to scenarios specified by time-annotated UML collaborations. Timed state machines are compiled into timed automata that exchange signals and operations via a network automaton. A collaboration with time constraints is translated into an observer timed automaton. The model checker uppaal is called upon to verify the timed automata representing the model against the observer timed automaton.

show abstract

Section: Representation Of Uml Collaborations In Uppaalmentioning

confidence: 99%

Section: Representation Of Uml Collaborations In Uppaalmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Model Checking Timed UML State Machines and Collaborations

Knapp

Merz

Rauh

2002

Lecture Notes in Computer Science

157

100

View full text Add to dashboard Cite

show abstract

“…For example, Lilius and Paltor [88] describe a tool for model checking UML state machine diagrams [14], and model checking of system specifications of similar degrees of abstraction has been considered in [5,52].…”

Section: Further Topicsmentioning

confidence: 99%

Model Checking: A Tutorial Overview

Merz¹

2001

Modeling and Verification of Parallel Processes

View full text Add to dashboard Cite

Abstract.We survey principles of model checking techniques for the automatic analysis of reactive systems. The use of model checking is exemplified by an analysis of the Needham-Schroeder public key protocol. We then formally define transition systems, temporal logic, ω-automata, and their relationship. Basic model checking algorithms for linear-and branching-time temporal logics are defined, followed by an introduction to symbolic model checking and partial-order reduction techniques. The paper ends with a list of references to some more advanced topics.

show abstract

Timing analysis of scenario-based specifications using linear programming

Pan

et al. 2012

Softw. Test. Verif. Reliab.

View full text Add to dashboard Cite

Scenario-based specifications (SBSs), such as UML interaction models, offer an intuitive and visual way of describing design requirements, and are playing an increasingly important role in the design of software systems. This paper presents an approach to timing analysis of SBSs expressed by UML interaction models. The approach considers more general and expressive timing constraints in UML sequence diagrams (SDs), and gives a solution to the reachability analysis, constraint conformance analysis and bounded delay analysis problems, which reduces these problems into linear programs. With the synchronous interpretation of the SD compositions, the timing analysis algorithms in the approach form a decision procedure for a class of SBSs where any loop in any path is time-independent of the other parts in the path. These algorithms are also a semi-decision procedure for general SBSs with both the synchronous and asynchronous composition semantics. The approach also supports bounded timing analysis of SBSs, which investigates all the paths in the bound limit one by one, and performs the timing analysis for each finite path by linear programming. A tool prototype has been developed to support this approach. SPIN which supports the design of MSCs, and allows for the creation, debugging, organization and maintenance of MSCs. Peled et al. [14,15] present a tool for searching a hierarchical MSC design for a path that matches a given specification. For SBSs with timing constraints used to describe real-time systems, the verification problems are more difficult and complicated. Some algorithms are presented by Alur et al. [6] for analysing basic MSCs with interval delays. A solution is given to the timed analogue of scenario matching by Akshay et al. [16]. Timing analysis has been extended to check UML SDs and MSC specifications [7,17,18]. However, all those works are about checking SBSs for timing consistency which is a basic property. In view of the practical use, there are a lot of properties about the accumulated delays on the traces of systems. For example, there often is a need to check if all traces of a system satisfy that the separation in time between two given events is within a given time interval, which is called bounded delay analysis. This problem has been considered for timed automata by Courcoubetis and Yannakakis [19], and for a class of Petri nets by Hulgaard and Burns [20].This paper presents an approach to timing analysis of SBSs expressed by UML interaction models. The approach gives a solution to the reachability analysis, constraint conformance analysis and bounded delay analysis problems, which reduces these problems into linear programs. With the synchronous interpretation of the SD compositions, the timing analysis algorithms in the approach form a decision procedure for a class of SBSs where any loop in any path is time-independent of the other parts in the path. These algorithms are also a semi-decision procedure for general SBSs with both the synchronous and asynchronous composition semantics. T...

show abstract

Timed Sequence Diagrams and Tool-Based Analysis — A Case Study

Cited by 34 publications

References 6 publications

Model Checking Timed UML State Machines and Collaborations

Model Checking Timed UML State Machines and Collaborations

Model Checking: A Tutorial Overview

Timing analysis of scenario-based specifications using linear programming

Contact Info

Product

Resources

About