To carry out performance evaluation of an asynchronous system, the system is modeled as Time Petri Net (TPN) and an iteration of Petri net simulations produces its performance index. The TPN model needs to satisfy required properties such as deadlock freeness. We proposed a symbolic representation of TPN for SAT-based bounded model checking. In the proposed encoding scheme, firing of transition...

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 ...

This paper considers time Petri nets (TPN model) for model checking. The main challenge in model checking techniques is to construct, with lesser resources (time and space), a much coarser abstraction preserving properties of interest. These properties can be verified using standard model checking techniques. In this paper, we review some techniques, proposed in the literature, to model check u...

This paper proposes an optimal solution to large-scale Flexible Manufacturing System (FMS) scheduling problems under availability constraints based on Timed Petri Nets (TPNs). First a decomposition method of TPNs is proposed, then a mathematical model is derived based on their properties. The mathematical model is built to determine the optimal firing sequence of TPN transitions to minimize the...

Yao (1994) has presented a unified time Petri net model (TPN) for temporal knowledge representation and reasoning, where the TPN model presented has a good contribution to the aspect of temporal knowledge representation and reasoning. However, there are a number of errors which should be corrected. The purpose of the paper is to identify these errors, and the corrections provided permit the rea...

This paper presents Timed Petri Nets (TPN) as an analytical approach for verification of computerized queueing network simulation models at steady state. It introduces a generic approach to decomposing a queueing network into separate and independent TPNs, each representing a resource of specific type, such as a processing resource or a transporting resource. A decomposed TPN model enables a qu...

The most important challenge in the region-based abstraction method as an approach to compute the state space of time Petri Nets (TPNs) for model checking is that the method results in a huge number of regions, causing a state explosion problem. Thus, region-based abstraction methods are not appropriate for use in developing practical tools. To address this limitation, this paper applies a modi...

Timed Petri nets (TPN) or Duration Petri nets (DPN) is a well-know approach to extend “classic” Petri nets in order to allow the modeling of time [1]. In [2], a state equation for TPN was provided that describes the net’s marking in an algebraic manner, but not its transitions clocks. Hence, proofing the nonreachability of a marking is mainly done by symbolic manipulation of the state equation,...

Petri nets (Murata, 1989) (Peterson, 1991) have been widely used to model various discrete event systems (Moody & Antsaklis, 1998). Characterized as concurrent, asynchronous, distributed, parallel, nondeterministic, and/or stochastic (Murata, 1989), Petri nets have gained more and more applications. However, when they are used to analyze and model systems of different domains, the shortages of ...

In this paper, we consider bounded Time Petri Nets where time intervals (strict and large) are associated with places (P-TPN), arcs (A-TPN) or transitions (T-TPN). We give the formal strong and weak semantics of these models in terms of Timed Transition Systems. We compare the expressiveness of the six models w.r.t. (weak) timed bisimilarity (behavioral semantics). The main results of the paper...