Abstruct-We address the problem of formally analyzing the properties of real-time systems. We propose a method based on modeling the system as a timed Petri net and on specifying its properties in TRIO, an extension of temporal logic suitable for dealing explicitly with time and for measuring it. Timed Petri nets are axiomatized in terms of TRIO, so that their properties can be derived as theor...

This paper addresses a sampling problem for timed continuous Petri nets under infinite servers semantics. Different representations of the continuous Petri net system are given, the first two in terms of piecewise linear system and the third one, for the controlled continuous Petri nets systems, in terms of a particular linear constrained system with null dynamic matrix. The last one is used to...

In M–timed Petri nets, firing times are exponentially distributed random variables associated with transitions of a net. Several classes of M–timed Petri nets are discussed in this paper to show increasing “modelling power” of different nets. Conflict–free nets can model M and Ek–type queueing systems. Free—choice nets can also represent Hk–type systems. Systems with several classes of users an...

In this paper, we present an online algorithm for state estimation of timed choicefree Petri nets. We assume that the net structure and initial marking are known, and that the set of transitions is divided in observable and unobservable one. Given an observed word and assuming that the time durations associated to the unobservable transitions are unknown, our problem is to estimate the possible...

In this paper, we show that the evolution equations for timed free choice Petri net can be used to prove logical properties of the underlying un-timed net. For example, this approach leads to new methods and algorithms to check liveness and several other basic properties, such as absence or presence of deadlocks. The main tools for proving these properties are graph theory and idempotent algebr...

There is a lack of new verification methods that overcome the limitations of traditional validation techniques and are, at the same time, suitable for real-time embedded systems. This paper presents an approach to formal verification of real-time embedded systems modeled in a timed Petri net representation. We translate the Petri net model into timed automata and use model checking to prove whe...

In this paper, we present an online algorithm for state estimation of timed choice-free Petri nets. We assume that the net structure and initial marking are known, and that the set of transitions is divided in observable and unobservable one. Given an observed word and assuming that the time durations associated to the unobservable transitions are unknown, our problem is to estimate the possibl...

Distributed{memory multithreaded multiprocessors are composed of a number of (multithreaded) processors, each with its memory, and an interconnecting network. The long memory latencies and synchronization delays are tolerated by context switching, i.e., by suspending the current thread and switching the processor to another `ready' thread provided such a thread is available. Because of very sim...

Abstract Timed Petri nets and max-plus automata are well known modelling frameworks for timed discrete-event systems. In this paper we present an iterative procedure that constructs a automaton from net while retaining the behaviour. Regarding net, essentially impose three assumptions: (a) must be bounded, i.e, reachability graph finite; (b) interpret with single server semantics; (c) operates ...

The Petri net theory has been used to model many types of systems and many net analysis methods have been devised to study their behavioural properties. Safeness or boundedness is one such property, which, in its usual sense, sets a bound on the maximum number of tokens that can be assembled in a place. In a type of standard Petri nets with simple tokens, the Elementary net system, to be safe i...