Reset Petri nets are a particular class of Petri nets where transition firings can remove all tokens from a place without checking if this place actually holds tokens or not. In this paper we look at partial order semantics of such nets. In particular, we propose a pomset bisimulation for comparing their concurrent behaviours. Building on this pomset bisimulation we then propose a generalization of the standard finite complete prefixes of unfolding to the class of safe reset Petri nets.

No abstract

No abstract

The specification of temporal properties covers two issues : the ezpression and the validation in a machine-independent way. The common sense associates Real-time to fast computing though Real-time contains two aspects : the problem of the coherence of Temporal Constraints between themselves and with performance constraints of fhe system. We propose a method that makes that distinction in order to decrease the complezity of Real-Time application and replaces each problem at the good step of the life cycle of the application. The originality of this specification method is to express temporal properties in a formal manner that handles the time in a qualitative and pseudo-quantitative way.