Results 1 
4 of
4
Analyzing Paths in Time Petri Nets
, 1999
"... . In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the min/max path passes only integerstates. A necessary condition for the reachability of an ..."
Abstract

Cited by 14 (7 self)
 Add to MetaCart
. In this paper, a parametric description of a transition sequence in a Time Petri net is introduced. The minimal and maximal time duration of a transition sequence are shown to be integers and furthermore the min/max path passes only integerstates. A necessary condition for the reachability of an arbitrary state is given. Keywords: Time Petri Net, integer state, reachability of a state, parametric description of a transition sequence 1. Introduction One of the most adequate ways of modeling and analyzing concurrent systems with an infinite state space is given by the theory of Petri nets. For studying systems in which local time dependencies between actions are relevant, a large variety of time dependent Petri nets have been defined and widely applied. For some of them, analyzing methods have emerged, Address for correspondence: Department of Computer Science, Humboldt University, 10099 Berlin, Germany 2 Popova, Schlatter / Analyzing Paths in Time Petri Nets whereas for others ...
Verification of Nonfunctional Properties of a Composable Architecture with Petrinets
, 2001
"... In this paper, we introduce our concept of composability and present the MSS architecture as an example for a composable architecture. MSS claims to be composable with respect to timing properties. We discuss, how to model and prove properties in such an architecture with timeextended Petrinets. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In this paper, we introduce our concept of composability and present the MSS architecture as an example for a composable architecture. MSS claims to be composable with respect to timing properties. We discuss, how to model and prove properties in such an architecture with timeextended Petrinets. As a result, the rst step of a proof of composability is presented as well as a new kind of Petrinet, which is more suitable for modeling architectures like MSS.
Using Integer Time Steps for Checking Branching Time Properties of Time Petri Nets
"... Abstract. Verification of timed systems is an important subject of research, and one of its crucial aspects is the efficiency of the methods developed. Extending the result of Popova which states that integer time steps are sufficient to test reachability properties of time Petri nets [5, 8], in our ..."
Abstract
 Add to MetaCart
Abstract. Verification of timed systems is an important subject of research, and one of its crucial aspects is the efficiency of the methods developed. Extending the result of Popova which states that integer time steps are sufficient to test reachability properties of time Petri nets [5, 8], in our work we prove that the discretetime semantics is also sufficient to verify ECTL ∗ and ACTL ∗ properties of TPNs with the dense semantics. To show that considering this semantics instead of the dense one is profitable, we compare the results for SATbased bounded model checking of ACTL−X properties and the class of distributed time Petri nets. 1
Modular Discrete PseudoState Graphs for Time Petri Nets
"... Summary. This paper aims at extending modular state space analysis to time Petri nets. The basic model is time Petri nets, where the timing is a firing interval attached to each transition. They are here extended to allow for modules. A state is composed by both a marking and a clock valuation funct ..."
Abstract
 Add to MetaCart
(Show Context)
Summary. This paper aims at extending modular state space analysis to time Petri nets. The basic model is time Petri nets, where the timing is a firing interval attached to each transition. They are here extended to allow for modules. A state is composed by both a marking and a clock valuation function. The state spaces of time Petri nets are in general infinite even if the net is bounded, because the transitions fire in a continuous time domain. For the analysis some techniques are necessary to reduce the state space to a finite one. In this paper, we consider state spaces obtained by restricting the behaviour of time Petri nets so that transitions fire only at integer times. A modular version of such a graph is proposed as well as an algorithm for its construction. 1