Topic
Petri net
About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: In this paper, the energy management of a photovoltaic-based power station with storage units with batteries for long-term energy supply and ultracapacitors for fast dynamic power regulation is discussed.
92 citations
01 Jan 1997
TL;DR: This paper studies a formal model for a subclass of concurrent systems with bulk services and arrivals which structurally avoids conflicts and introduces a unified framework for checking general behavioral properties by reasoning solely on the structure.
Abstract: Among discrete event systems, those exhibiting concurrency are especially challenging, requiring the use of formal methods to deal with them. Petri nets are a well-established such formalism. The structure theory aims at overcoming the state space explosion problem, inherent to the analysis of concurrent systems, by bridging structural and behavioral properties. To date, this has been successfully achieved mainly for some subclasses of ordinary nets. However weights are a modeling convenience in many situations. In this paper we study a formal model for a subclass of concurrent systems with bulk services and arrivals which structurally avoids conflicts. Structural results and techniques for dealing with them are introduced. These include structural conditions on properties of correct behavior and a unified framework for checking general behavioral properties by reasoning solely on the structure.
92 citations
Book•
01 Jan 1996
TL;DR: This book presents a coherent description of the theoretical and practical aspects of Coloured Petri Nets (CP-nets or CPN), and shows how CP-nets have been developed from being a promising theoretical model to being a full-fledged system for the design, specification, simulation, validation and implementation of large software systems.
Abstract: Coloured Petri Nets-Kurt Jensen 2010-10-19 This book presents a coherent description of the theoretical and practical aspects of Coloured Petri Nets (CP-nets or CPN). It shows how CP-nets have been de veloped from being a promising theoretical model to being a full-fledged lan guage for the design, specification, simulation, validation and implementation of large software systems (and other systems in which human beings and/or com puters communicate by means of some more or less formal rules). The book contains the formal definition of CP-nets and the mathematical theory behind their analysis methods. However, it has been the intention to write the book in such a way that it also becomes attractive to readers who are more interested in applications than the underlying mathematics. This means that a large part of the book is written in a style which is closer to an engineering textbook (or a users' manual) than it is to a typical textbook in theoretical computer science. The book consists of three separate volumes. The first volume defines the net model (i. e. , hierarchical CP-nets) and the basic concepts (e. g. , the different behavioural properties such as deadlocks, fair ness and home markings). It gives a detailed presentation of many small exam ples and a brief overview of some industrial applications. It introduces the for mal analysis methods. Finally, it contains a description of a set of CPN tools which support the practical use of CP-nets.
92 citations
Journal Article•
TL;DR: In this article, the authors define timed automata with deadlines (TAD), which are a class of automata where time progress conditions depend on deadlines associated with transitions and show that using TAD makes urgency specification easier.
Abstract: We define timed automata with deadlines (TAD) which are a class of timed automata where time progress conditions depend on deadlines associated with transitions. We show that using TAD makes urgency specification easier. We present the model of Petri nets with deadlines (PND), which are (1-safe) Petri nets extended with clocks exactly as TAD are extensions of automata. We compare PND with different classes of timed Petri nets (TPNs) and show that safe TPNs can be modeled as PND. Some applications to modeling systems and in particular to modeling multimedia documents are presented
92 citations
TL;DR: A reduced reachability graph called symbolic reachabilitygraph is presented that can be constructed directly by an efficient algorithm without considering the actual state space of the model and its analysis provides equivalent results as the analysis of the ordinary reachable graph.
92 citations