To avoid conflict and deadlock states in waterway with multiple locks and canals, a computer based traffic management system with proper control policy must be applied. The paper proposes a formal method for design of deadlock prevention supervisor by using discrete event theory, multiple reentrant flowlines class of Petri net and P-invariants control places calculation. By using and/or matrix ...

Effective scheduling of hybrid system in industry has a high economic return. However, a hybrid system contains continuous dynamics and discrete dynamics so that the modeling and scheduling of hybrid system become more and more complex and difficult. This paper presented a new approach integrating decomposition of timed hybrid Petri net (THPN) and multi-core cluster to scheduled hybrid system. ...

Fluidification constitutes a relaxation technique for studying discrete event systems through fluidified approximated models, thus avoiding the state explosion problem. Moreover, the class of continuous models thus obtained may be interesting in itself. In Petri nets, fluidification leads to the so called continuous Petri nets, that are technically hybrid models. Under infinite server semantics...

This work deals with the firing sequences estimation for transitions timed Petri nets by measurement of the places marking. Firing durations are unknown, but supposed not to be null. In fact, the Petri net marking is measured, on line, with a sampling period ∆t small enough such that each transition is fired, at the most, one time during ∆t. The estimation problem has exact and approximated sol...

Stochastic activity networks (SANs) are a well-known petri net-based formalism used for the performance and dependability modeling of a wide range of systems. On the other hand, the growing complexity of timed systems makes it imperative to apply formal analysis techniques in the early stages of the system’s development. Finding a suitable framework for the modeling, evaluation, and verificatio...

Timed-Arc Petri Nets (TAPN) are an extension of the classical P/T nets with continuous time. Tokens in TAPN carry an age and arcs between places and transitions are labelled with time intervals restricting the age of tokens available for transition firing. The TAPN model posses a number of interesting theoretical properties distinguishing them from other time extensions of Petri nets. We shall ...

The Cell-DEVS formalism allows defining a cell space [11] seen as a lattice of cells holding a computing apparatus in charge of updating the cell state according to a local rule. This is done using the present cell state and the cell’s neighborhood information using a discrete-event approach and explicit timing delays. Cell-DEVS is based on DEVS (Discrete EVent systems Specifications), a techni...

Energy games have recently attracted a lot of attention. These are games played on finite weighted automata and concern the existence of infinite runs subject to boundary constraints on the accumulated weight, allowing e.g. only for behaviours where a resource is always available (nonnegative accumulated weight), yet does not exceed a given maximum capacity. We extend energy games to a multiwei...

Automata with weights (multiplicities) in (max,+) algebra form a class of timed automata. Determinism is a crucial property for numerous results on (max,+) automata and, in particular, for applications to performance evaluation and control of a large class of timed discrete event systems. In this paper, we show how to build a deterministic (max,+) automaton equivalent to a live and safe timed P...

Formal methods among them the model checking techniques play an important role in the design and production of both systems and software. In this paper we deal with an adaptation of the bounded model checking methods for timed systems, developed for timed automata, to the case of time Petri nets. We consider distributed time Petri nets and parametric reachability checking, but the approach can ...