Logic Petri nets (LPNs) can describe and analyze batch processing functions and passing value indeterminacy in cooperative systems. Logic Petri workflow nets (LPWNs) are proposed based on LPNs in this paper. Process mining is regarded as an important bridge between modeling and analysis of data mining and business process. Workflow nets (WF-nets) are the extension to Petri nets (PNs), and have ...

Configuring production processes based on process platforms has been well recognized as an effective means for companies to provide product variety while maintainingmass production efficiency. The production processes of product families involve diverse variations in manufacturing and assembly processes resulted from a large variety of component parts and assemblies. This paper develops a multi...

A new distributed algorithm for on-line fault detection and isolation of discreteevent systems modeled by Petri nets is presented. The algorithm is applicable to systems modeled in a modular manner by means of place-bordered Petri nets, i.e., Petri nets with common places but distinct transitions. These Petri nets have transition labeled with events; fault events are modeled as transitions labe...

This extended abstract serves as a support for the plenary address given by the author at the 32nd International Conference on Application and Theory of Petri Nets and Concurrency. Published as: A. Giua, ”State Estimation and Fault Detection Using Petri Nets”, Applications and Theory of Petri Nets: Proc. 32nd Int. Conf. on Applications and Theory of Petri nets 2008 (Newcastle, UK), June 20-24, ...

Reachability analysis is a general approach to analyze Petri nets, but the state space explosion often permits its application. In the eld of performance analysis of stochastic Petri nets, modular representations of reachability graphs using Kronecker algebra have been successfully applied. This paper describes how a Kronecker representation of the reachability graph is employed for exploration...

Bounded model checking has received recent attention as an efficient verification method. The basic idea behind this new method is to reduce the model checking problem to the propositional satisfiability decision problem or SAT. However, this method has rarely been applied to Petri nets, because the ordinary encoding would yield a large formula due to the concurrent and asynchronous nature of P...

Nested Petri nets (NP-nets) is an extension of the Petri nets formalism within the nets-within-nets approach, allowing to model systems of interacting dynamic agents in a natural way. One of the main problems in verifying of such systems is the State Explosion Problem. To tackle this problem for highly concurrent systems the unfolding method has proved to be very helpful. In this paper we conti...

Petri nets are a subject of interest to researchers since more than 30 years. They became popular since they allow the graphic representation of computational structures and have a formal underpinning that allows formal proofs of properties. Their use in engineering, however is limited to a rather small number of applications. Many of the graphic notations used in practice are very similar to t...