Abstract. This report describes a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA). We consider bounded TPN, whose underlying net is not necessarily bounded. We prove that the obtained TA is timed-bisimilar to the initial TPN. The number of clocks of the automaton is much lower than with other methods available. We have implemented the method...

In this paper, we consider a deterministic timed continuous Petri net model where conflicts at places are solved by using stationary routing parameters. We show how to compute the stationary firing rate for all transitions via linear programming, so as to determine the optimal routing parameters that maximize user-defined linear functions of the firing rates. Finally, we discuss the relations w...

We give a high-level overview of our recent results which extend and unify the lines of research initiated by Meseguer and Montanari under the motto “Petri nets are monoids”, and by Marti-Oliet, Meseguer and other authors in their linear logic axiomization of Petri nets. In particular, we investigate the use of rewriting logic, which was partially inspired by the two aforementioned approaches, ...

In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in dealing with concurrency and complexity issues. A brief overview of existing results on hybrid systems that are based on Petri nets is first presented. A class of timed Petri nets named programmable timed Petri nets (PTPN)...

This paper deals with fault diagnosis of timed discrete event systems (TDESs), using a nondeterministic model named labeled time Petri net (LTPN). Thanks to a skillful splitting of time intervals assigned to the LTPN transitions, analyzing diagnosability in such a timed context can be performed using techniques from the untimed context. Moreover, a deterministic structure called augmented state...

Priority speciications ooer a convenient description technique to resolve connicts in favour of particular actions. Besides specifying the functional behaviour of a system, priorities have also become important in the eld of performance analysis using stochastic Petri nets, where priorities are implicitly given by separating transitions into immediate and timed. For performance analysis of such...

Due to their appealing conceptual simplicity and availability of computer tools for their analysis, Petri nets are widely used to model discrete-event systems in many areas of engineering. However, the computational resources required to carry out the analysis of a Petri net model are often enormous, hindering their practical impact. In this survey, we consider how symbolic methods based on the...