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: The latest version of Cell Illustrator 4.0 uses Java Web Start technology and is enhanced with new capabilities, including automatic graph grid layout algorithms using ontology information and import from SBML, CellML, and BioPAX.
Abstract: Cell Illustrator is a software platform for Systems Biology that uses the concept of Petri net for modeling and simulating biopathways. It is intended for biological scientists working at bench. The latest version of Cell Illustrator 4.0 uses Java Web Start technology and is enhanced with new capabilities, including: automatic graph grid layout algorithms using ontology information; tools using Cell System Markup Language (CSML) 3.0 and Cell System Ontology 3.0; parameter search module; high-performance simulation module; CSML database management system; conversion from CSML model to programming languages (FORTRAN, C, C++, Java, Python and Perl); import from SBML, CellML, and BioPAX; and, export to SVG and HTML. Cell Illustrator employs an extension of hybrid Petri net in an object-oriented style so that biopathway models can include objects such as DNA sequence, molecular density, 3D localization information, transcription with frame-shift, translation with codon table, as well as biochemical reactions.
85 citations
TL;DR: This paper presents a new prevention method for deadlock issue arising in flexible manufacturing systems modeled with Petri nets based on a characteristic structure of WS^3PR, an extension of System of Simple Sequential Processes with Resources with Resources (S*3PR) with weighted arcs.
85 citations
Journal Article•
TL;DR: This paper presents an algorithm to synthesize a finite place/transition Petri net (p/t-net) from a finite set of labeled partial orders (a finite partial language) and provides an effective algorithm for the synthesis of system models from partial languages.
Abstract: In this paper we present two algorithms that effectively synthesize a finite place/transition Petri net (p/t-net) froma finite set of labeled partial orders (a finite partial language). The synthesized p/t-net either has exactly the non-sequential behavior specified by the partial language, or there is no such p/t-net.
The first algorithm is based on the theory of token flow regions for partial languages developed by Lorenz and Juhas. Thus, this paper shows the applicability of this concept. The second algorithm uses the classical theory of regions applied to the set of step sequences generated by the given partial language. We finally develop an algorithm to test whether the net synthesized by either of the two algorithms has exactly the non-sequential behavior specified by the partial language.
We implemented all algorithms in our framework VipTool. In this paper, the implementations of the first two algorithms are used to compare the algorithms by means of experimental results.
85 citations
TL;DR: UML's Collaboration and Statechart diagrams are shown to allow systematic generation of Generalised Stochastic Petri Net models, which can be solved to find their throughput and other performance measures.
Abstract: As hardware becomes faster and bandwidth greater, the determination of the performance of software based systems during design, known as Software Performance Engineering (SPE), is a growing concern. A recent seminar of experts at Dagstuhl and the First International Workshop on Software and Performance have both highlighted the need to bring performance evaluation into the software design process. The Unified Modelling Language (UML) has emerged in the last two years as a widely accepted standard notation for software design and it is an attractive vehicle for SPE. In this paper UML's Collaboration and Statechart diagrams are shown to allow systematic generation of Generalised Stochastic Petri Net (GSPN) models, which can be solved to find their throughput and other performance measures. Using the example of communication via the alternating bit protocol, such a mapping is demonstrated and the resulting GSPN solved using the SPNP package. The basis of a usable methodology for SPE is explored.
85 citations
01 Jan 1995
TL;DR: The research work presented here belongs in the domain of formal specification of human-software interaction, and uses the Interactive Cooperative Objects (ICO) formalism, in which structural parts are described in an object-oriented framework and dynamic aspects are described with high-level Petri-nets.
Abstract: The research work presented here belongs in the domain of formal specification of human-software interaction. More precisely, we are concerned by the applying a formal specification technique in the various stages of the construction of an user-driven application, the kind supported by most of the current UIMS. We use the Interactive Cooperative Objects (ICO) formalism, in which structural (or static) aspects are described in an object-oriented framework and dynamic (or behavioral) aspects are described with high-level Petri-nets. The formalism, a case study and some of its expected benefits are presented here.
85 citations