Visualisation of reduced abstracted behaviour as a design tool

Valmari, Antti; Karsisto, Konsta; Setälä, Mikko

doi:10.1109/empdp.1996.500586

Cited by 6 publications

(8 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A datastructure for a compact representation of state spaces of hierarchical CP-nets was presented and statistics given, demonstrating the applicability of the datastructure. The recognition of graphical representations of the state space as a means to analyse the behaviour of systems has also been considered in a process algebraic setting in [130]. The approaches presented in this paper and in [130] are, however, different.…”

Section: Discussionmentioning

confidence: 99%

“…The approaches taken in the OG tool and in [130] are, however, different. In [130], the view of the system is specified at the syntactical level, and the state space is generated and reduced according to this view. In contrast, we generate the state space once, and then define different views on the system at the semantic (state space) level.…”

Section: Visualisationmentioning

confidence: 99%

Section: Visualisationmentioning

confidence: 99%

“…The recognition of visualisation of the state space as a means to analyse the behaviour of systems has also been considered in a process algebraic setting in [130]. The approaches taken in the OG tool and in [130] are, however, different. In [130], the view of the system is specified at the syntactical level, and the state space is generated and reduced according to this view.…”

Section: Visualisationmentioning

confidence: 99%

See 3 more Smart Citations

State Space Methods for Coloured Petri Nets

Kristensen¹

2000

DPB

View full text Add to dashboard Cite

Preface SummaryAn increasing number of system development projects are concerned with distributed and concurrent systems. There are numerous examples, ranging from large scale systems, in the areas of telecommunication and applications based on WWW technology, to medium or small scale systems, in the area of embedded systems. A typical distributed or concurrent system consists of a number of independent but communicating processes. This means that the execution of such systems may proceed in many different ways, e.g., depending on whether messages are lost, the speed of the processes involved, and the time at which input is received from the environment. As a result, distributed and concurrent systems are, by nature, complex and difficult to design and test. This has motivated the development of methods which support computer-aided analysis, validation, and verification of the behaviour of concurrent and distributed systems.State space methods are some of the most prominent approaches in this field. The basic idea underlying state spaces is (in its simplest form) to compute all reachable states and state changes of the system, and represent these as a directed graph. The virtue of a constructed state space is that it makes it possible to algorithmically reason about the behaviour of a system, e.g., verify that the system possesses certain desired properties or locate errors in the system. The main disadvantage of using state spaces is the state explosion problem: even relatively small descriptions/systems may have an astronomically or even infinite number of reachable states, and it is a serious limitation on the use of state space methods in the analysis of real-life systems. The development of reduction methods to alleviate this inherent complexity problem is, therefore, a central topic in the development of state space methods. Reduction methods avoid representing the entire state space of the system or represent the state space in a compact form. The reduction is done in such a way that properties of the system can still be derived from the reduced state space.In this thesis we study state space methods in the framework of Coloured Petri Nets which is a graphical language for modelling and analysis of concurrent and distributed systems. The thesis consists of two parts. Part I is the mandatory overview paper which summarises the work which has been done. Part II is composed of five individual papers and constitutes the core of this thesis. Four of the these papers have been published elsewhere as conference papers, journal papers, or book chapters. The fifth paper is submitted to an international conference. v vi The overview paper introduces the research field of state space methods for Coloured Petri Nets and summarises the contents and contributions of the five individual papers. A substantial part of the overview paper has also been devoted to putting the results presented in the five individual papers in a broader perspective in the form of a discussion of related work.The first paper considers state sp...

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Visualisationmentioning

confidence: 99%

Section: Visualisationmentioning

confidence: 99%

Section: Visualisationmentioning

confidence: 99%

See 2 more Smart Citations

State Space Methods for Coloured Petri Nets

Kristensen¹

2000

DPB

View full text Add to dashboard Cite

show abstract

“…The protocol that we will use in the following two sections is taken from [22]. It is an improved version of the well-known alternating bit protocol [3], with an additional error recovery/synchronization mechanism.…”

Section: Self-synchronizing Alternating Bit Protocolmentioning

confidence: 99%

Compositional construction of protocol behaviours with arbitrary channel capacities

Puhakka

Proceedings Seventh IEEE International Conference on Engineering of Complex Computer Systems

View full text Add to dashboard Cite

Formal, automated ver$cation methods for parallel systems suffer from the state explosion problem, which prevents analysis of large systems with many components. However, with compositional methods we can sometimes take advantage of regularities in the system structure, enabling verification of even arbitrarily large systems. In this paper we present a case study where we use compositional methods for communication protocol veriJication. The aim is to determine the externally observable behaviour of protocols that have arbitrarily large (but finite) channel capacities. We construct the behaviour of an example protocol by choosing suitable abstractions and by composing the system in an appropriate order. We also extend the result to protocol families with arbitrary finite numbers of retransmissions. The protocol behaviour thus obtained can be used as a component in any larger system, as well as f o r verijication and visualisation purposes. However, we also show that a similar approach is not possible for the classical alternating bit protocol with reliable or fair channels. Namely, we show that no finite-state invariant can prove that the behaviour is independent of channel capacities.

show abstract

Visual verification of safety and liveness

Valmari

Setälä

1996

FME'96: Industrial Benefit and Advances in Formal Methods

View full text Add to dashboard Cite

An exceptionally user-friendly approach to computer-aided validation / verification of concurrent and reactive systems is presented. In it, the user needs not express his verification questions formally in detail. Instead, he specifies a point of view to the system by choosing a subset of its externally observable actions. An automaton abstracts and reduces the behaviour of the system according to the choice, and shows the result graphically on a computer screen. The resulting picture represents all executions of the system, as seen from the chosen point of view. Thus the information in it is as comprehensive as that obtained by ordinary verification. On the other hand, like ordinary testing, the method makes it possible for a system designer to get rapid feedback with ease, to "just try the system and see how it behaves". The article concentrates on practical and philosophical issues regarding the method and contains a detailed example.

show abstract

Visualisation of reduced abstracted behaviour as a design tool

Cited by 6 publications

References 6 publications

State Space Methods for Coloured Petri Nets

State Space Methods for Coloured Petri Nets

Compositional construction of protocol behaviours with arbitrary channel capacities

Visual verification of safety and liveness

Contact Info

Product

Resources

About