Petri net

About: Petri net is a research topic. Over the lifetime, 25039 publications have been published within this topic receiving 406994 citations.

Compositional validation of time-critical systems using communicating time Petri nets

Abstract: An extended Petri net model which considers modular partitioning along with timing restrictions and environment models is presented. Module constructs permit the specification of a complex system as a set of message passing modules with the timing semantics of time Petri nets. The state space of each individual module can be separately enumerated and assessed under the assumption of a partial specification of the intended module operation environment. State spaces of individual modules can be recursively integrated, to permit the assessment of module clusters and of the overall model, and to check the satisfaction of the assumptions made in the separate analysis of elementary component modules. In the intermediate stages between subsequent integration steps, the state spaces of module and module clusters can be projected onto reduced representations concealing local events that are not essential to the purposes of the analysis. The joint use of incremental enumeration and intermediate concealment of local events allows for a flexible management of state explosion, and permits a scalable approach to the validation of complex systems.

A reasoning algorithm for high-level fuzzy Petri nets

Abstract: We introduce an automated procedure for extracting information from knowledge bases that contain fuzzy production rules. The knowledge bases considered here are modeled using the high-level fuzzy Petri nets proposed by the authors in the past. Extensions to the high-level fuzzy Petri net model are given to include the representation of partial sources of information. The case of rules with more than one variable in the consequent is also discussed. A reasoning algorithm based on the high-level fuzzy Petri net model is presented. The algorithm consists of the extraction of a subnet and an evaluation process. In the evaluation process, several fuzzy inference methods can be applied. The proposed algorithm is similar to another procedure suggested by Yager (1983), with advantages concerning the knowledge-base searching when gathering the relevant information to answer a particular kind of query.

Ladder diagram and Petri-net-based discrete-event control design methods

Abstract: Ladder diagrams (LDs) for a programmable logic controller are a dominant method in discrete event control of industrial automated systems. Yet, the ever-increasing functionality and complexity of these systems have challenged the use of LDs to design their discrete-event controllers. Researchers are constantly pursuing integrated tools that eliminate the limitations of LDs. These tools are aimed not only for control but also system analysis, evaluation, and simulation. For the past several decades, Petri nets (PNs) have emerged as an important tool to provide an integrated solution for modeling, analysis, simulation, and control of industrial automated systems. Different types of PN-based controllers are proposed and intended to apply in the industry. There is a need for more benchmark studies of PN and LD methods in order to form a structured and integrated framework for logic control software development. This paper, for the first time, presents a comprehensive survey on the recent methods for discrete event control design.

Termination criteria for model transformation

Abstract: Model Transformation has become central to most software engineering activities. It refers to the process of modifying a (usually graphical) model for the purpose of analysis (by its transformation to some other domain), optimization, evolution, migration or even code generation. In this work, we show termination criteria for model transformation based on graph transformation. This framework offers visual and formal techniques based on rules, in such a way that model transformations can be subject to analysis. Previous results on graph transformation are extended by proving the termination of a transformation if the rules applied meet certain criteria. We show the suitability of the approach by an example in which we translate a simplified version of Statecharts into Petri nets for functional correctness analysis.