Abstract: IRIS (increasing reward with increasing service) realtime scheduling appears frequently in real-time control applications such as heuristic control. IRIS requires not only meeting deadlines, but also finding the schedule with the best result (highest reward). In this paper, a framework is presented that uses Timed Petri nets (TPN) to transform an IRIS problem into a dynamic programmin...

Time Petri Nets (TPN) and Timed Automata (TA) are widely-used formalisms for the modeling and analysis of timed systems. A recently-developed approach for the analysis of TPNs concerns their translation to TAs, at which point efficient analysis tools for TAs can then be applied. One feature of much of this previous work has been the use of timed reachability analysis on the TPN in order to cons...

This presentation is based on joint work with F. Cassez*, S. Haddad**, D. Lime* and O. H. Roux* (*IRCCyN, Nantes and **LSV, Cachan), published in the proceedings of ATVA’05, CONCUR’05, FSTTCS’05, with an extended version of the third paper to appear in Theoretical Computer Science. The aim of this work was to compare the expressive power of Timed Automata (TA) and Time Petri Nets (TPN). Time Pe...

RT-Studio (Real Time Studio) is an integrated environment for modeling, simulation and automatic verification of realtime systems modeled as networks of Interpreted Time Petri Nets (ITPNs). The tool allows to construct several abstractions for ITPNs suitable to verify reachability, linear and branching properties, in addition to a TCTL model checker. In this paper we describe the ITPN model as ...

In this paper, we propose a method for building a Timed Transition Graph (TTG) that uses a single clock from the state class graph of a bounded time Petri Net (TPN). To build this TTG a special state class construction available in Tina is used. This structure can be used to calculate “quantitative” temporal properties for the worst case scenario. It is possible to check efficiently several pro...

Abstract. This paper deals with model checking of timed systems modeled by Time Petri nets (TPN). We propose a new finite graph, called Timed Aggregate Graph (TAG), abstracting the behavior of bounded TPNs with strong time semantics. The main feature of this abstract representation compared to existing approaches is the encoding of the time information. This is done in a pure way within each no...

In this paper we consider the model of Time Petri Nets (TPN) where time is associated with transitions. We also consider Timed Automata (TA) as defined by Alur & Dill, and compare the expressiveness of the two models w.r.t. timed language acceptance and (weak) timed bisimilarity. We first prove that there exists a TA A s.t. there is no TPN (even unbounded) that is (weakly) timed bisimilar to A....

Abstract. This paper presents a real-time property specific reduction approach for Time Petri Net (TPN). It divides TPN models into sub-nets of smaller size, and constructs an abstraction of reducible ones, which exhibits the same property specific behavior, but has less transitions and states. This directly reduces the amount of computation needed to generate the whole state space. This method...

This paper describes an approach to the analysis of time-critical systems which combines discreteevent simulation and model-checking techniques. The approach rests on Merlin and Farber’s Time Petri Nets (TimePNs) and is supported by a Java toolbox −TPN/DESIGNER− which enables graphical modelling and simulation of modular TimePN models. The toolbox also allows translation of a TimePN model into ...

Business processes are usually defined by business experts who require intuitive and informal graphical notations such as BPMN (Business Process Management Notation) for documenting and communicating their organization activities and behavior. However, BPMN has not been provided with a formal semantics, which limits the analysis of BPMN models to using solely informal techniques such as simulat...