Membrane computing is a branch of Natural computing aiming to abstract computing models from the structure and functioning of the living cell. A comprehensive introduction to membrane computing is meant to offer both computer scientists and non-computer scientists an up-to date overview of the field. In this paper, we consider a uniform way of treating objects and rules in P Systems with the he...

[Extended Abstract] The formal verification of embedded systems is becoming a key research area due to the ever increasing design complexity involved in the modelling and validation of embedded systems. Traditional methods of validation, such as simulation and testing, are practically becoming an infeasible solution for large design models. Nowadays, only a small part of a real-life embedded sy...

In this paper, a general approach is proposed for the computation of a liveness enforcing supervisor for the Petri net model of a flexible manufacturing system (FMS) prone to deadlocks. The proposed method is applicable to a lot of PN classes. A global sink/source place (GP) is used temporarily in the design steps and is finally removed when the liveness of the system is achieved. The aim is to...

The dynamics analysis for linear systems described by state-space representations in max-plus algebra is addressed within the context of the software facilities offered by the Petri Net Toolbox (PN Toolbox) running under MATLAB. By developing this toolbox, the application field of the MATLAB environment (extremely popular among control engineers) is considerably enlarged towards covering event ...

The class of Independent, Increasing, Free-Choice Petri nets (II-FCPNs) was introduced in reference Sre97c], where it is shown that any II-FCPN can be made live via supervision using a readily available policy. In a live Petri net (PN) Pet81, Rei85], it is possible to re any transition from every reachable marking, although not necessarily immediately. In this paper we identify a class of PNs, ...

Given a Petri net PN = (P, T, E), a siphon is a set S of places such that the set of input transitions to S is included in the set of output transitions from S. Concerning extraction of minimal siphons containing a given specified set Q of places, the paper proposes three algorithms based on the branch-and-bound method for enumerating, if any, all minimal siphons containing Q, as well as for ex...

This paper presents a transformation scheme from Boolean-controlled dataflow (BDF) networks to Petri nets (PN) that has the following properties. A BDF has a bounded length schedule, if and only if the transformed Petri net has a bounded length schedule. A BDF has a bounded memory schedule if the transformed PN has a bounded memory schedule. The existence of bounded memory schedule of BDF is pr...

This paper reviews the research work on Petri nets representations and the AI based search approaches. It coves the following contents: 1) Petri nets (PN) and PN modeling of manufacturing systems; 2) Scheduling using PN and AI search and PN based scheduling of flexible manufacturing systems using hybrid heuristic search; 3) PN based planning; 4) Closed-loop control using PN; 5) Rule-based PN an...

This paper addresses the design of Petri net (PN) supervisor using the theory of regions for forbidden state problem with a set of general mutual exclusion constraints. In fact, as any method of supervisory control based on reachability graph, the theory of regions suffers from a technical obstacle in control synthesis, which is the necessity of computing the graph at each iteration step. Moreo...

This paper presents techniques that enable the modeling and analysis of redundancy in remote monitoring and control systems. Hardware redundancy and software redundancy are both implemented in the proposed system organically. To model and analyze the redundancy, a formalism to derive Petri net (PN) model from state transition diagram is constructed and the monitor compatible condition is consid...