Results 1  10
of
18
Verification of safety properties using integer programming: Beyond the state equation
, 1997
"... . The state equation is a verification technique that has been applied  not always under this name  to numerous systems modelled as Petri nets or communicating automata. Given a safety property P, the state equation is used to derive a necessary condition for P to hold which can be mechanically c ..."
Abstract

Cited by 19 (1 self)
 Add to MetaCart
. The state equation is a verification technique that has been applied  not always under this name  to numerous systems modelled as Petri nets or communicating automata. Given a safety property P, the state equation is used to derive a necessary condition for P to hold which can be mechanically checked. The necessary conditions derived from the state equation are known to be of little use for systems communicating by means of shared variables, in the sense that many of these systems satisfying the property but not the conditions. In this paper, we use traps, a wellknown notion of net theory, to obtain stronger conditions that can still be efficiently checked. We show that the new conditions significantly extend the range of verifiable systems. Keywords: State equation, traps, approximation techniques, linear programming 1. Introduction The application of linear algebra and integer programming techniques to verification problems has been the subject of a large number of papers [3,...
How to calculate symmetries of Petri nets
 Acta Informatica
, 1997
"... A definition of Petri net symmetries is given and an algorithm is introduced, which computes these symmetries. Then three examples are given how algorithms from different fields of Petri net analysis can be improved using symmetries, namely computation of reachability graphs, semipositive place inva ..."
Abstract

Cited by 15 (5 self)
 Add to MetaCart
A definition of Petri net symmetries is given and an algorithm is introduced, which computes these symmetries. Then three examples are given how algorithms from different fields of Petri net analysis can be improved using symmetries, namely computation of reachability graphs, semipositive place invariants and structural deadlocks,
PROD 3.2  An Advanced Tool for Efficient Reachability Analysis
, 1997
"... PROD is a reachability analyzer for Predicate/Transition nets. The tool incorporates several advanced reduced reachability graph generation methods. The tool also includes a CTL model checker and supports onthefly verification of LTL formulas. PROD is being used in industrial projects at the Digit ..."
Abstract

Cited by 11 (5 self)
 Add to MetaCart
PROD is a reachability analyzer for Predicate/Transition nets. The tool incorporates several advanced reduced reachability graph generation methods. The tool also includes a CTL model checker and supports onthefly verification of LTL formulas. PROD is being used in industrial projects at the Digital Systems Laboratory.
Distributed and structured analysis approaches to study large and complex systems
 Lectures on Formal Methods and Performance Analysis, LNCS 2090
, 2001
"... Abstract. Both the logic and the stochastic analysis of discretestate systems are hindered by the combinatorial growth of the state space underlying a highlevel model. In this work, we consider two orthogonal approaches to cope with this “statespace explosion”. Distributed algorithms that make us ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
Abstract. Both the logic and the stochastic analysis of discretestate systems are hindered by the combinatorial growth of the state space underlying a highlevel model. In this work, we consider two orthogonal approaches to cope with this “statespace explosion”. Distributed algorithms that make use of the processors and memory overall available on a network of N workstations can manage models with state spaces approximately N times larger than what is possible on a single workstation. A second approach, constituting a fundamental paradigm shift, is instead based on decision diagrams and related implicit data structures that efficiently encode the state space or the transition rate matrix of a model, provided that it has some structure to guide its decomposition; with these implicit methods, enormous sets can be managed efficiently, but the numerical solution of the stochastic model, if desired, is still a bottleneck, as it requires vectors of the size of the state space. 1
Modeling Multivalued Genetic Regulatory Networks Using HighLevel Petri Nets
 In: G. Ciardo and P. Darondeau (eds), Proc. of the Int. Conf. on the Application and Theory of Petri Nets, Lecture Notes in Computer Science 3536
, 2005
"... Abstract. Regulatory networks are at the core of all biological functions from biochemical pathways to gene regulation and cell communication processes. Because of the complexity of the interweaving retroactions, the overall behavior is difficult to grasp and the development of formal methods is ne ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Abstract. Regulatory networks are at the core of all biological functions from biochemical pathways to gene regulation and cell communication processes. Because of the complexity of the interweaving retroactions, the overall behavior is difficult to grasp and the development of formal methods is needed in order to confront the supposed properties of the biological system to the model. We revisit here the tremendous work of R. Thomas and show that its binary and also its multivalued approach can be expressed in a unified way with highlevel Petri nets. A compact modeling of genetic networks is proposed in which the tokens represent gene’s expression levels and their dynamical behavior depends on a certain number of biological parameters. This allows us to take advantage of techniques and tools in the field of highlevel Petri nets. A developed prototype lets a biologist to verify systematically the coherence of the system under various hypotheses. These hypotheses are translated into temporal logic formulae and the modelchecking techniques are used to retain only the models whose behavior is coherent with the biological knowledge. 1
Model Checking LTL Properties of HighLevel Petri Nets with Fairness Constraints
 In Proc. APN'01, LNCS 2075
, 2001
"... Latvala and Heljanko have presented how model checking of linear temporal logic properties of P/T nets with fairness constraints on the transitions can be done efficiently. In this work the procedure is extended to highlevel Petri Nets, Coloured Petri Nets in particular. The model checking procedur ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Latvala and Heljanko have presented how model checking of linear temporal logic properties of P/T nets with fairness constraints on the transitions can be done efficiently. In this work the procedure is extended to highlevel Petri Nets, Coloured Petri Nets in particular. The model checking procedure has been implemented in the MARIA tool. As a case study, a liveness property of a sliding window protocol is model checked. The results indicate that the procedure can cope well with many fairness constraints, which could not have been handled by specifying the constraints as a part of the property to be verified.
Automatic Verification of Concurrent Ada Programs
"... The behavior of concurrent Ada programs is very difficult to understand because of the complexity introduced by multitasking. This complexity makes classical test techniques unusable and correctness can only be obtained with the help of formal methods. In this paper we present a work based on c ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
The behavior of concurrent Ada programs is very difficult to understand because of the complexity introduced by multitasking. This complexity makes classical test techniques unusable and correctness can only be obtained with the help of formal methods. In this paper we present a work based on colored Petri nets formalism that automates the verification of concurrent Ada program properties. The Petri net is automatically produced by a translation step and the verification is automatically performed on the net with classical related techniques. A prototype has been developed and first results obtained allow us to think that we will be able in a near future to analyze realistic Ada programs. 1
A Unified Approach to the Study of Asynchronous Communication Mechanisms in Real Time Systems.
, 2000
"... This thesis presents a new application of analyzing Asynchronous Communication Mechanisms (ACMs) using Petri nets. This technique facilitates the testing of essential ACM operating properties: data coherence (concurrent reading and writing of data at the same location should not happen), data freshn ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
This thesis presents a new application of analyzing Asynchronous Communication Mechanisms (ACMs) using Petri nets. This technique facilitates the testing of essential ACM operating properties: data coherence (concurrent reading and writing of data at the same location should not happen), data freshness (not reading out of date data) and data sequencing (not reading data in a newoldnew order). The technique allows for analysis under metastable conditions which cannot be avoided in an asynchronous environment, but have usually been omitted in the analysis of published ACM algorithms. The modelling techniques are described, along with the analysis methods and optimizations which allow the ACM models to be as compact as possible without omitting necessary detail. The method allows for fast automated analysis of ACMs therefore allowing design changes in the algorithms to be quickly analyzed, without the need to perform long formal proofs. The use of a common analysis method allows compari...
Model checking based on Kronecker algebra
 Universität Dortmund, Fachbereich Informatik, Forschungsbericht Nr. 669
, 1998
"... Reachability analysis is a general approach to analyze Petri nets, but the state space explosion often permits its application. In the field of performance analysis of stochastic Petri nets, modular representations of reachability graphs using Kronecker algebra have been successfully applied. This p ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Reachability analysis is a general approach to analyze Petri nets, but the state space explosion often permits its application. In the field of performance analysis of stochastic Petri nets, modular representations of reachability graphs using Kronecker algebra have been successfully applied. This paper describes how a Kronecker representation of the reachability graph is employed for exploration of the reachability set and subsequent model checking of ordinary Petri nets and Computational Tree Logic. A new and space efficient representation of the reachability set is given. A nontrivial model of a production cell is exercised to demonstrate the usefulness of the approach. Extensions towards certain colored Petri nets are briefly sketched.
Compositionality in the GreatSPN tool and its application to the modelling of industrial applications
 University of Aarhus (Denmark
, 2000
"... An implementation of compositionality for Generalized Stochastic Petri Nets (GSPN) and for Stochastic Wellformed Nets (SWN) has been recently included in the GreatSPN tool. Given two GSPNs (or SWNs), and a labelling function for places and transitions, it is possible to produce a third one as su ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
An implementation of compositionality for Generalized Stochastic Petri Nets (GSPN) and for Stochastic Wellformed Nets (SWN) has been recently included in the GreatSPN tool. Given two GSPNs (or SWNs), and a labelling function for places and transitions, it is possible to produce a third one as superposition of places and transitions of equal label, for SWN color domains and arc functions have to be treated appropriately.