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: This is a survey of some decidability results for Petri nets, covering the last three decades, and the model checking problem for temporal logics is examined.
Abstract: This is a survey of some decidability results for Petri nets, covering the last three decades. The presentation is structured around decidability of specific properties , various behavioural equivalences and finally the model checking problem for temporal logics .
105 citations
TL;DR: This paper extends the correspondence between safe Petri nets and event structures to arbitrary nets without self-loops, under the collective token interpretation, and proposes a more general form of event structure, matching the expressive power of such nets.
105 citations
23 Jun 2003
TL;DR: The paradigm of "nets within nets" is applied since it is well suited to express the dynamics of open, mobile systems, and the results are carried forward to model mobility in the area of agent systems.
Abstract: Mobility creates a new challenge for dynamic systems in all phases of the life cycle, like modelling, execution, and verification. In this work we apply the paradigm of "nets within nets" to this area since it is well suited to express the dynamics of open, mobile systems. The advantages of Petri nets - intuitive graphical representation and formal semantics - are retained and supplemented with a uniform way to model mobility and mobile (agent) systems.
First the modelling of mobility is introduced in general, the results are carried forward to model mobility in the area of agent systems. The usefulness of the approach is shown in a second step by modelling a small case study, the implementation of a household robot system.
105 citations
Proceedings Article•
01 Jan 1993
TL;DR: Stochastic processes generated by the composition of stochastic automata can be analyzed efficiently with a technique based on Kronecker (tensor) algebra for matrices, as shown by Plateau.
Abstract: Stochastic processes generated by the composition of stochastic automata can be analyzed efficiently (both in terms of space and time) with a technique based on Kronecker (tensor) algebra for matrices, as shown by Plateau. The technique is applied in this paper to the analysis of a class of Stochastic Petri nets (SPN) that is named Superposed Stochastic Automata (SSA) an it is used to solve nets of hundreds of thousands states. The evaluation of the steady state probability distribution for this class of models was implemented with sequential as well as parallel algorithms. Although SSA are a rather restricted subclass of SPN, the extension of the analysis methodology to a more general setting appears to be feasible.
105 citations
TL;DR: An event-driven approach is proposed to improve the design of industrial control systems using commercial PLCs by adapting formal models based on supervisory control theory to solve the challenges of widely distributed automation systems.
Abstract: Industrial automation is largely based on PLC-based control systems. PLCs are today mostly programmed in the languages of the IEC 61131 standard which are not ready to meet the new challenges of widely distributed automation systems. Currently, an extension of IEC 61131 which includes object oriented programming as well as the new standard IEC 61499 are available. Moreover, service-oriented paradigms where autonomous and interoperable resources provide their functionalities in the form of services that can be accessed externally by clients without knowing the underlining implementation have been presented in the literature. In the supervisory control theory, methodologies based on formal models have been developed to improve the coordination of concurrent and distributed systems. In this paper, an event-driven approach is proposed to improve the design of industrial control systems using commercial PLCs. At a lower level, basic sequences are coded in elementary software objects, called function blocks, providing their functionalities as services. At an upper level, a Petri Net (PN) controller forces the execution of such services according to desired sequences, while by a PN supervisor constraints on the sequences are satisfied.
105 citations