Quasar: A New Tool for Concurrent Ada Programs Analysis

Parallel Process. Lett.

2006

Self Cite

Structural model abstraction is a powerful technique for reducing the complexity of a state based enumeration analysis. We present in this paper new efficient Petri nets reductions. First, we define "behavioural" reductions (i.e. based on conditions related to the language of the net) which preserve a fundamental property of a net (i.e. liveness) and any formula of the (action-based) linear time logic that does not observe reduced transitions of the net. We show how to replace these conditions by structural or algebraical ones leading to reductions that can be efficiently checked and applied whereas enlarging the application spectrum of the previous reductions. At last, we illustrate our method on a significant and typical example of a synchronisation pattern of parallel programs.

Section: Resultsmentioning

confidence: 99%

New Efficient Petri Nets Reductions for Parallel Programs Verification

Haddad

Parallel Process. Lett.

2006

Self Cite

“…This formalism remains sufficient for modeling large and complex problems; in particular we use it to model a large subset of Ada programs in order to validate them (see for instance models proposed in [12] or in [11]). As for the original model, we define our formalism by restricting the possible color mapping and the color domain construction.…”

Section: Simple Well-formed Colored Nets and Simple Positive Flowsmentioning

confidence: 99%

A Simple Positive Flows Computation Algorithm for a Large Subclass of Colored Nets

Évangelista

Pajault

Lecture Notes in Computer Science

2007

Abstract. Positive flows provide very useful informations that can be used to perform efficient analysis of a model. Although algorithms computing (a generative family of) positive flows in ordinary Petri nets are well known, computing a generative family of positive flows in colored net remains an open problem. We propose in this paper a pragmatic approach that allows us to define an algorithm that computes a generative family of particular but useful positive flows in a large subclass of colored nets: the simple well-formed nets.

“…We extended these reductions to colored Petri nets (which are an abbreviation of Petri nets) in [7,8] and use them in the Quasar [9] platform that performs verification of concurrent Ada programs by analyzing an intermediate colored Petri net generated from a given program.…”

Section: Introductionmentioning

confidence: 99%

Adapting Petri Nets Reductions to Promela Specifications

Pajault

Formal Techniques for Networked and Distributed Systems – FORTE 2008

Rousseau

2008

Abstract. The interleaving of concurrent processes actions leads to the well-known combinatorial explosion problem. Petri nets theory provides some structural reductions to tackle this phenomenon by agglomerating sequences of transitions into a single atomic transition. These reductions are easily checkable and preserve deadlocks, Petri nets liveness and any LTL formula that does not observe the modified transitions. Furthermore, they can be combined with other kinds of reductions such as partial-order techniques to improve the efficiency of state space reduction. We present in this paper an adaptation of these reductions for Promela specifications and propose simple rules to automatically infer atomic steps in the Promela model while preserving the checked property. We demonstrate on typical examples the efficiency of this approach and propose some perspectives of this work in the scope of software model checking.