Results 1 
8 of
8
A survey of Petri nets methods for controlled discrete event systems. Discrete Event Dynamic Systems: Theory and Applications
, 1997
"... Abstract. This paper surveys recent research on the application of Petri net models to the analysis and synthesis of controllers for discrete event systems. Petri nets have been used extensively in applications such as automated manufacturing, and there exists a large body of tools for qualitative a ..."
Abstract

Cited by 102 (3 self)
 Add to MetaCart
(Show Context)
Abstract. This paper surveys recent research on the application of Petri net models to the analysis and synthesis of controllers for discrete event systems. Petri nets have been used extensively in applications such as automated manufacturing, and there exists a large body of tools for qualitative and quantitative analysis of Petri nets. The goal of Petri net research in discrete event systems is to exploit the structural properties of Petri net models in computationally efficient algorithms for computing controls. We present an overview of the various models and problems formulated in the literature focusing on two particular models, the controlled Petri nets and the labeled nets. We describe two basic approaches for controller synthesis, based on state feedback and event feedback. We also discuss two efficient techniques for the online computation of the control law, namely the linear integer programming approach which takes advantage of the linear structure of the Petri net state transition equation, and pathbased algorithms which take advantage of the graphical structure of Petri net models. Extensions to timed models are briefly described. The paper concludes with a discussion of directions for future research.
Independence of Net Transformations and Token Firing in Reconfigurable Place/Transition Systems
"... Abstract. Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to new requirements of the environment. In this paper we use transformation rules for place/transition systems in ..."
Abstract

Cited by 14 (11 self)
 Add to MetaCart
(Show Context)
Abstract. Reconfigurable place/transition systems are Petri nets with initial markings and a set of rules which allow the modification of the net during runtime in order to adapt the net to new requirements of the environment. In this paper we use transformation rules for place/transition systems in the sense of the double pushout approach for graph transformation. The main problem in this context is to analyze under which conditions net transformations and token firing can be executed in arbitrary order. This problem is solved in the main theorems of this paper. Reconfigurable place/transition systems then are applied in a mobile network scenario.
Petri Nets for Control and Monitoring: Specification, Verification, Implementation
, 1995
"... The purpose of this paper 1 is to illustrate the benefits of a Petri net based approach for control and monitoring of eventdriven operations in process systems. A Petri net based specification contains structural information which is absent from a simple state transition graph. The verificatio ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
The purpose of this paper 1 is to illustrate the benefits of a Petri net based approach for control and monitoring of eventdriven operations in process systems. A Petri net based specification contains structural information which is absent from a simple state transition graph. The verification scheme is not necessarily based on a state enumeration and many results can be obtained by analysing particular subnets. In particular the use of redundant places and siphons is illustrated. Finally the implementation by means of the token player approach can be easily complemented to guarantee monitoring functions. 1 Introduction The control issue of discreteevent chemical processes is complex because of its hybrid nature. Various approaches have been proposed or are under development [6, 9, 14, 15, 20, 22], many of them are Petri net based. The purpose of this paper is not to present a survey of Petri net theory. A very good introduction can be found in [16], for more detail the ...
A Comparative Study of Methods for Efficient Reachability Analysis
 DIGITAL SYSTEMS LABORATORY, HELSINKI UNIVERSITY OF TECHNOLOGY
, 1990
"... Six recently proposed methods for efficient reachability analysis of distributed systems are studied and compared: symmetry method (Huber et al), parameterising method (Lindqvist), stubborn set method (Valmari), reduction theory (Berthelot, Haddad), symbolic model checking (Burch et al) and incomple ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
Six recently proposed methods for efficient reachability analysis of distributed systems are studied and compared: symmetry method (Huber et al), parameterising method (Lindqvist), stubborn set method (Valmari), reduction theory (Berthelot, Haddad), symbolic model checking (Burch et al) and incomplete statespace generation (Holzmann). Petri systems are used as the main presentation formalism. The methods are evaluated by how well they are suited for practical reachability graph generation by computer. One can summarise in brief that the stubborn set method, reduction theory and incomplete statespace generation are found very promising and they provide useful aid to practical reachability analysis. The symmetry method yields a significant reduction in memory space but hardly in generation time. Symbolic model checking is a very general method and immense sample statespaces have been analysed with it but it is likely that for most practical systems the method performs far worse tha...
On the Compositionality and Analysis of Algebraic HighLevel Nets
 RESEARCH REPORT A16, DIGITAL SYSTEMS LABORATORY
, 1991
"... This work discusses three aspects of net theory: compositionality of nets, analysis of nets and highlevel nets. Net theory has often been criticised for the difficulty of giving a compositional semantics to a net. In this work we discuss this problem form a category theoretic point of view. In cate ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
This work discusses three aspects of net theory: compositionality of nets, analysis of nets and highlevel nets. Net theory has often been criticised for the difficulty of giving a compositional semantics to a net. In this work we discuss this problem form a category theoretic point of view. In category theory compositionality is represented by colimits. We show how a highlevel net can be mapped into a lowlevel net that represents its behaviour. This construction is functorial and preserves colimits, giving a compositional semantics for these highlevel nets. Using this semantics we propose some proof rules for compositional reasoning with highlevel nets. Linear logic is a recently discovered logic that has many interesting properties. From a net theoretic point of view its interest lies in the fact that it is able to express resources in an analogous manner to nets. Several interpretations of Petri nets in terms of linear logic exist. In this work we study a model theoretic inter...
State Estimation of Petri Nets by Transformation
"... Abstract — In this paper we propose four transformation rules to estimate the marking of a net, discrete or continuous, satisfying the following assumptions: the set of transitions is partitioned into observable and unobservable transitions; the net structure and the initial marking is known. For ea ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract — In this paper we propose four transformation rules to estimate the marking of a net, discrete or continuous, satisfying the following assumptions: the set of transitions is partitioned into observable and unobservable transitions; the net structure and the initial marking is known. For each rule we derive a set of linear algebraic constraints that characterize the set of markings of the original net that are consistent with the observed firing sequence. I.
1.2.1 Discrete Event Systems and Models.................... 1
, 1992
"... Este, que ves, engaño colorido, que del arte ostentando los primores, con falsos silogismos de colores es cauteloso engaño del sentido. This coloured counterfeit that thou beholdest, vainglorious with the excellencies of art, is, in fallacious syllogisms of colour, ..."
Abstract
 Add to MetaCart
Este, que ves, engaño colorido, que del arte ostentando los primores, con falsos silogismos de colores es cauteloso engaño del sentido. This coloured counterfeit that thou beholdest, vainglorious with the excellencies of art, is, in fallacious syllogisms of colour,
Article On Functional Module Detection in Metabolic Networks
, 2013
"... metabolites ..."
(Show Context)