It is shown that for some classes of closed timed Petri net models the steady–state behavior can be determined on the basis of structural properties only (i.e., without reachability analysis), using the concept of throughput and simple rules of operational analysis. Throughput analysis is based on the average values of firing times rather than firing time distribution functions, so the same app...

We study fluid analogues of a subclass of Petri Nets, called Continuous Generalized Timed Event Graphs, which are a time extension of weighted TSystems studied in the Petri Net literature. These event graphs can be studied in the algebraic structure called (min,+) algebra. In this paper we deal with the problem of allocating an initial marking in a Continuous Generalized Timed Event Graphs for ...

This paper presents a unified approach for software process management which combines object-oriented (OO) structures with formal models based on (high-level timed) Petri nets. This pairing may be proved beneficial not only for the integrated representation of software development processes, human resources and work products, but also in analysing properties and detecting errors of a software p...

In this paper, we propose Lagrangian relaxation technique for solving scheduling problems by decomposition of timed Petri nets. The scheduling problem is represented by the transition firing sequence problem to minimize a given objective function. The timed Petri net is decomposed into several subnets so that the subproblem for each subnet can be easily solved by a shortest path algorithm. The ...

Thanks to its graphical notation and simplicity, Unified Modeling Language (UML) is a de facto standard and a widespread language used in both industry and academia, despite the fact that its semantics is still informal. The Interaction Overview Diagram (IOD) is introduced in UML2; it allows the specification of the behavior in the hierarchical way. In this paper, we make a contribution towards...

This paper presents an application of Hierarchical Coloured Timed Petri Nets to the modelling and the performance evaluation of a distributed consensus algorithm. We took a top down modular approach to manage the complexity of the considered protocols. The termination time of the consensus algorithm is mainly set by the communications cost, i.e. by the timing characteristics of the communicatio...

AADL is an aerospace standard for model-driven design of complex real-time embedded systems. Currently, behavioral properties of AADL models can be specified inside the system description using AADL concepts or outside it using external textual languages, and verified using schedulability analysis or (Time Petri Net-based) model-checking tools. This paper (1) proposes Visual Timed Scenarios (V ...

The paper proposes a new class of timed Petri nets for the specification of temporal constraints and description of logical behaviour in distributed hypermedia systems. In particular, hierarchical design capabilities are added to the Time Stream Petri Net model developed for the specification of multimedia scenarios. The new model is named HTSPN, and its enhanced firing rules give a precise sem...

A collection of software tools for analysis of timed Petri nets, known as TPN–tools, developed over a number of years, has been extended by a simulation tool, TPNsim. The paper gives a brief characterization of TPNsim, and discusses some implementation aspects in greater detail.

− Ordinary t-timed Petri Nets are used for modeling, analysis and synthesis of random topology production systems and networks. Each production system is first decomposed into production line (transfer chain), assembly, disassembly and parallel machines modules and then their corresponding modular Petri Net models are derived. The overall system PN model is obtained via synthesis of the generic...