Decomposition of the supervisory control problem for Petri netsunder preservation of maximal permissiveness

Decomposing the design of supervisory control laws for Petri nets is an efficient way to tackle its complexity. We consider legal sets which are the union of two sets. In general, this can make the control law obtained via decomposition too restrictive, i.e., it disables more transitions than necessary. Generalizing existing results, we give structural conditions under which the control law via decomposition is maximally permissive     

Structuring Acyclic Petri Nets for Reachability Analysis and Control

The incidence matrices—from places to transitions and vice versa—of an acyclic Petri net can obtain a block-triangular structure by reordering their rows and columns. This allows the efficient solution of some reachability problems for acyclic Petri nets. This result is further used in supervisory control of Petri nets; supervisors for Petri nets with uncontrollable transitions are constructed by extending the method of Yamalidou et al. (1996) to Petri nets where transitions can be executed simultaneously. A large class of Petri nets with uncontrollable transitions is given for which the maximally permissive supervisor can be realized by a Petri net. The original specification is algorithmically transformed—by using the results for acyclic Petri nets—into a new specification to take the presence of uncontrollable transitions into account. The supervisor is obtained by simple matrix multiplications and no linear integer programs need to be solved. Furthermore, a class of Petri nets is given for which the supervisor can be realized by extending the enabling rule with OR-logic.     

Influence of mixing procedure and mixer type on fresh and hardened properties of concrete: a review

Mixing concrete is not yet a fully understood issue, with many parameters having an influence on the resulting fresh and hardened concrete properties. Even for the same composition, a somewhat different microstructure can be obtained by changing the mixing procedure and the mixer type. A mixing procedure can differ in mixing time, mixing speed, air pressure in the mixing pan, addition time of the superplasticizer, temperature, etc. The concrete industry shows a great interest in controlling these influences in order to produce a concrete of which the mechanical, rheological and durability properties are well known. In this overview, different concrete mixers, mixing times, mixing speeds, different addition times of the superplasticizer and a different air pressure in the mixing pan will be examined. A review of existing literature is presented, as well as some new experimental results.     

On-Line Monitoring of Large Petri Net Models Under Partial Observation

We consider a Petri Net model of the plant. The observation is given by a subset of transitions whose occurrence is always and immediately sensed by a monitoring agent. Other transitions not in this subset are silent (unobservable). Classical on-line monitoring techniques, which are based on the estimation of the current state of the plant and the detection of the occurrence of undesirable events (faults), are not suitable for models of large systems due to high spatial complexity (exponential in the size of the entire model). In this paper we propose a method based on the explanation of plant observation. A legal trace minimally explains the observation if it includes all unobservable transitions whose firing is needed to enable the observed transitions. To do so, starting from an observable transition, using backward search techniques, a set of minimal explanations is derived, which are sufficient for detecting whether a fault event must have occurred for sure in the plant or not. The technique also allows production of a set of basis markings for the estimation of the current state of the plant. The set of all possible current markings can then be characterized as the unobservable reach of these basis markings. The computational complexity of the algorithm depends on the size of the largest connected subnet which includes only unobservable transitions. This allows monitoring of plants of any size in which there is no large unobservable subnet. We also illustrate the applicability of the method for the monitoring of a class of infinite state systems, unbounded Petri Nets with unobservable trap circuits, and we show how this can be useful for distributed implementations.

Differences in attraction to semiochemicals present in sympatric pine shoot beetles,Tomicus minor andT. piniperda

The chemical ecology of host- and mate-finding in the pine shoot beetles,Tomicus minor andT. piniperda, was studied in southern Sweden. Beetles were collected in the field from defined attack phases on Scots pine. Using gas chromatography-mass spectroscopy, a number of oxygen-containing monoterpenes, e.g., 3-carene-10-ol, myrtenol,trans-verbenol, and verbenone, were identified from hindgut extracts of both sexes of both species. Compared toT. minor,T. piniperda contained additional compounds and in larger amounts. The amounts were highest in both species at the time when the beetles had bored into contact with the resin-producing xylem-phloem tissue. The synthesis of (1S,6R)-3-carene-10-ol by photooxidatipn of (+)-(1S,6R)-3-carene is described. In comparative electroantennogram (EAG) measurements on males and females of both species, the most active of the tested compounds wastrans-verbenol. Laboratory bioassays of walking beetles showed thatT. piniperda was attracted to uninfestèd pine logs.T. minor was more strongly attracted to pine logs infested with females than to uninfested pine logs, indicating a female-produced aggregation pheromone. Field tests confirmed thatT. piniperda was strongly attracted to pine logs. The attraction ofT. minor to logs was significant only when logs were combined with racemictrans-verbenol and (1S,6R)-3-carene-10-ol.T. minor was also attracted to a combination of these monoterpene alcohols alone. We suggest that host and mate location inT. piniperda is achieved by means of a kairomone composed of host monoterpenes, whileT. minor utilizes a primitive pheromone synergized by host odors. Evolution of host colonization strategies of the two beetles are discussed.Coleoptera: Scolytidae.This study was made within the project Odour signals for control of pest insects.     

Individual variation in the pheromone of the turnip moth,Agrotis segetum

Female turnip moths (Agrotis segetum) from a laboratory culture inbred for more than 30 generations, and the offspring (first and third generation) from field-collected insects were analyzed individually for acetates and alcohols in the pheromone gland. Quantitative analysis of individual components was performed at the subnanogram level by gas chromatographymass spectrometry (selected ion monitoring). The titer of the pheromone, i.e., the sum of the homologous acetates (Z)-5-decenyl acetate, (Z)-7-dodecenyl acetate, and (Z)-9-tetradecenyl acetate was 2.0 ± 0.3 ng in the laboratory culture and 3.2 ± 0.6 ng in the wild strain. There was no correlation between pheromone titer and female weight. The relative proportion of the pheromone components varied substantially between individuals, but there was no statistically significant difference between the two populations. The percentages of the respective compounds (¯X ± coefficient of variation) were 14.8 ± 127% for Z5-10:OAc, 55.6 ± 32% for Z7-12:OAc, and 29.6 ± 59% forZ9-14:OAc. The pheromone composition varied more in the wild strain than in the laboratory culture. The significance of the pheromone variation to the attraction of males was tested in a field experiment. The ratio of males trapped by the most attractive blend versus the least attractive one was 2.2.Schiff., Lepidoptera: Noctuidae.This study was made within the Swedish project Odour Signals for Control of Pest Insects.     

Distributed routing for load balancing

Some open-loop and closed-loop control algorithms are discussed for an example of a discrete-event system, namely, the routing of arriving tasks from different arrival streams among several possible service stations. It is shown that it is possible to design open-loop policies that give good performance in a way which is very robust with respect to large changes in the arrival rates. This is possible even though it is assumed that there is no online coordination between the routing algorithms for the different arrival streams. Some further improvements of the performance are possible when a simple feedback policy, namely, overflow routing, is implemented. This also gives reasonable robustness of performance with respect to changes in the service rates     

A distributed approach for fault detection and diagnosis based on Time Petri Nets

This paper proposes an algorithm for the model based design of a distributed protocol for fault detection and diagnosis for very large systems. The overall process is modeled as different Time Petri Net (TPN) models (each one modeling a local process) that interact with each other via guarded transitions that becomes enabled only when certain conditions (expressed as predicates over the marking of some places) are satisfied (the guard is true). In order to use this broad class of time DES models for fault detection and diagnosis we derive in this paper the timing analysis of the TPN models with guarded transitions. In this paper we also extend the modeling capability of the faults calling some transitions faulty when operations they represent take more or less time than a prescribed time interval corresponding to their normal execution. We consider here that different local agents receive local observation as well as messages from neighboring agents. Each agent estimates the state of the part of the overall process for which it has model and from which it observes events by reconciling observations with model based predictions. We design algorithms that use limited information exchange between agents and that can quickly decide “questions” about “whether and where a fault occurred?” and “whether or not some components of the local processes have operated correctly?”. The algorithms we derive allow each local agent to generate a preliminary diagnosis prior to any communication and we show that after communicating the agents we design recover the global diagnosis that a centralized agent would have derived. The algorithms are component oriented leading to efficiency in computation.