Results 1  10
of
32
Modular analysis of systems composed of semiautonomous subsystems
 In Proc. 4th Int. Conf. on Application of Concurrency to System Design (ACSD’04
, 2004
"... This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factory automation systems. It presents new algorithms to harness this modular analysis in the determination of reachable states with specied partial markings, to determine possible deadlocks, both global ..."
Abstract

Cited by 22 (17 self)
 Add to MetaCart
(Show Context)
This paper reviews a proposal for the modular analysis of Petri nets and its applicability to factory automation systems. It presents new algorithms to harness this modular analysis in the determination of reachable states with specied partial markings, to determine possible deadlocks, both global and local, and also liveness. These algorithms have been implemented in a prototype tool which has then been used to solve a problem in factory automation which, even for relatively simple congurations, can lead to state spaces beyond the capabilities of many analysis tools. 1.
Understanding Network Behavior by Structured Representations of Transition Invariants
 in: Algorithmic Bioprocesses, Natural Computing Series (2009
"... Abstract Petri nets offer a bipartite and concurrent paradigm, and consequently represent a natural choice for modeling and analyzing biochemical networks. We introduce a Petri net structuring technique contributing to a better understanding of the network behavior and requiring static analysis only ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Abstract Petri nets offer a bipartite and concurrent paradigm, and consequently represent a natural choice for modeling and analyzing biochemical networks. We introduce a Petri net structuring technique contributing to a better understanding of the network behavior and requiring static analysis only. We determine a classification of the transitions into abstract dependent transition sets, which induce connected subnets overlapping in interface places only. This classification allows a structured representation of the transition invariants by network coarsening. The whole approach is algorithmically defined, and thus does not involve human interaction. This structuring technique is especially helpful for analyzing biochemically interpreted Petri nets, where it supports model validation of biochemical reaction systems reflecting current comprehension and assumptions of what has been designed by natural evolution. 1
Cover picture story: Experiments with modular state spaces. Petri Net Newsletter, 68:Cover page and 5–10
 Petri Net Newsletter
, 2005
"... Abstract. The main analysis techniques for critical systems use state space exploration. However, one is often quickly limited by the socalled state space explosion problem, even if the systems models are relatively small. Several methods have been proposed to tackle this problem in order to get a ..."
Abstract

Cited by 6 (6 self)
 Add to MetaCart
Abstract. The main analysis techniques for critical systems use state space exploration. However, one is often quickly limited by the socalled state space explosion problem, even if the systems models are relatively small. Several methods have been proposed to tackle this problem in order to get a manageable state space. One of these takes advantage of the modular structure of the model in order to build a modular state space, which is basically a set of local state spaces plus a synchronisation graph indicating the global behaviour. In this paper, we present a few case studies and compare the state space sizes with those of the full state space. The results are discussed, pointing out the criteria the model should satisfy for the technique to be efficient. 1
LTL Model Checking for Modular Petri Nets
 In Proc. 25th Int. Conf. Application and Theory of Petri Nets (ICATPN’04
, 2004
"... We consider the problem of model checking modular Petri nets for the linear time logic LTLX. An algorithm is presented which can use the synchronisation graph from modular analysis as presented by Christensen and Petrucci and perform LTLX model checking. We have implemented our method in the r ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
We consider the problem of model checking modular Petri nets for the linear time logic LTLX. An algorithm is presented which can use the synchronisation graph from modular analysis as presented by Christensen and Petrucci and perform LTLX model checking. We have implemented our method in the reachability analyser Maria and performed experiments. As is the case for modular analysis in general, in some cases the gains can be considerable while in other cases the gain is negligible.
Towards Distributed Verification of Petri Nets Properties
"... The use of distributed or parallel processing gained interest in the recent years to fight the state space explosion problem. Many industrial systems are described with large models, and the state space being even larger, it does not fit completely into the memory of a single computer. In this appro ..."
Abstract

Cited by 5 (2 self)
 Add to MetaCart
The use of distributed or parallel processing gained interest in the recent years to fight the state space explosion problem. Many industrial systems are described with large models, and the state space being even larger, it does not fit completely into the memory of a single computer. In this approach several computers connected over a network cooperate. The state space is then partitionned among these computers, and each of them contributes to the verification by considering its own subspace. In this paper, we address the verification of basic behavioural properties: reachability, liveness and home state and their distributed analysis. In particular, the verification of the latter properties requires the generation of the full state space and the computation of its terminal strongly connected components. Here, we propose to use a distributed Tarjan algorithm to perform this computation. The performance of distributed verification depends on several criteria, e.g. load balancing of the partitionned state space, but also more importantly on a good partitioning. Therefore, choosing an adequate hash function to assign nodes to processors is important.
Studying Multioperational Production Systems with Modular Hybrid Petri Nets
, 2003
"... Modular hybrid timed Petri Nets are used to model and analyze behavior of random topology multioperational production systems. Each such system is decomposed into 3 fundamental modules, followed by derivation of their corresponding modular HPN models. The overall system model is obtained via synthe ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
Modular hybrid timed Petri Nets are used to model and analyze behavior of random topology multioperational production systems. Each such system is decomposed into 3 fundamental modules, followed by derivation of their corresponding modular HPN models. The overall system model is obtained via synthesis of the individual modules, satisfying system constraints (routes, production rates, machine expected up down or idle time and priorities). For any topology multioperational production system, overall HTPN model nodes are calculated, followed by derivation of model invariants. Results show applicability of the proposed methodology and justify its modeling power and generality.
Modular Petri Net Based Modeling, Analysis and SYNTHESIS OF DEDICATED PRODUCTION SYSTEMS
 IEEE INT. CONF. ON ROBOTICS AND AUTOMATION  ICRA
, 2003
"... Ordinary ttimed Petri Nets are used for modeling, analysis and synthesis of random topology production systems and networks. Each production system is first decomposed into production line (transfer chain), assembly, disassembly and parallel machines modules and then their corresponding modular Pe ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
Ordinary ttimed Petri Nets are used for modeling, analysis and synthesis of random topology production systems and networks. Each production system is first decomposed into production line (transfer chain), assembly, disassembly and parallel machines modules and then their corresponding modular Petri Net models are derived. The overall system PN model is obtained via synthesis of the generic modules satisfying system constraints. P and T invariants are calculated and given a random topology production system, the total number of the system PN model nodes (places, transitions) is calculated from the corresponding generic PN modules. Results show the applicability of the proposed methodology.
An incremental and modular technique for checking LTL\X properties of Petri nets
 of LNCS
, 2007
"... Abstract. Modelchecking is a powerful and widespread technique for the verification of finite state concurrent systems. However, the main hindrance for wider application of this technique is the wellknown state explosion problem. Modular verification is a promising natural approach to tackle this ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Modelchecking is a powerful and widespread technique for the verification of finite state concurrent systems. However, the main hindrance for wider application of this technique is the wellknown state explosion problem. Modular verification is a promising natural approach to tackle this problem. It is based on the "divide and conquer" principle and aims at deducing the properties of the system from those of its components analysed in isolation. Unfortunately, several issues make the use of modular verification techniques difficult in practice. First, deciding how to partition the system into components is not trivial and can have a significant impact on the resources needed for verification. Second, when modelchecking a component in isolation, how should the environment of this component be described? In this paper, we address these problems in the framework of modelchecking LTL\X actionbased properties on Petri nets. We propose an incremental and modular verification approach where the system model is partitioned according to the actions occurring in the property to be verified and where the environment of a component is taken into account using the linear place invariants of the system.
Coloured Stochastic Activity Networks: Preliminary Definitions and Properties
 Proc. of ICALP'03 Satellite Workshop on Stochastic Petri Nets and Related Formalisms
, 2003
"... Several highlevel extensions have been introduced for Petri nets (PNs). Coloured Petri nets (CPNs) are the most famous highlevel extensions of PNs. Stochastic activity networks (SANs) are a stochastic generalization of PNs. These models have widely been used for dependability and performability ev ..."
Abstract

Cited by 3 (3 self)
 Add to MetaCart
(Show Context)
Several highlevel extensions have been introduced for Petri nets (PNs). Coloured Petri nets (CPNs) are the most famous highlevel extensions of PNs. Stochastic activity networks (SANs) are a stochastic generalization of PNs. These models have widely been used for dependability and performability evaluation purposes and are supported with a few powerful modeling tools. To provide some highlevel facilities for SANs, we have defined coloured stochastic activity networks (CSANs). CSANs provide the possibility of data manipulation and hierarchical modeling. In this paper, we present the informal and formal definitions, some examples and an introduction to the analysis of these models. ______________________________________________________________________ 1
Modular Verification of Petri Nets Properties: a Structurebased Approach
"... In this paper, we address the modular verification problem for a Petri net obtained by composition of two subnets. At first, we show how to transform an asynchronous composition into a synchronous one where the new subnets are augmented from the original ones by means of linear invariants. Then we ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
In this paper, we address the modular verification problem for a Petri net obtained by composition of two subnets. At first, we show how to transform an asynchronous composition into a synchronous one where the new subnets are augmented from the original ones by means of linear invariants. Then we introduce a nonconstraining relation between subnets based on their behaviour. Whenever this relation is satisfied, standard properties like the liveness and the boundedness and generic properties specified by a linear time logic may be checked by examination of the augmented subnets in isolation. Finally, we give a sufficient condition for this relation which can be detected modularly using an efficient algorithm.