Results 1  10
of
53
Hybrid Petri nets
 European Control Conference Grenoble
, 1991
"... Abstract. Petri nets (PNs) are widely used to model discrete event dynamic systems (computer systems, manufacturing systems, communication systems, etc). Continuous Petri nets (in which the markings are real numbers and the transition firings are continuous) were defined more recently; such a PN ma ..."
Abstract

Cited by 131 (2 self)
 Add to MetaCart
(Show Context)
Abstract. Petri nets (PNs) are widely used to model discrete event dynamic systems (computer systems, manufacturing systems, communication systems, etc). Continuous Petri nets (in which the markings are real numbers and the transition firings are continuous) were defined more recently; such a PN may model a continuous system or approximate a discrete system. A hybrid Petri net can be obtained if one part is discrete and another part is continuous. This paper is basically a survey of the work of the authors ’ team on hybrid PNs (definition, properties, modeling). In addition, it contains new material such as the definition of extended hybrid PNs and several applications, explanations and comments about the timings in Petri nets, more on the conflict resolution in hybrid PNs, and connection between hybrid PNs and hybrid automata. The paper is illustrated by many examples.
Modeling Urgency in Timed Systems
 In International Symposium: Compositionality  The Significant Difference
, 1997
"... this paper and is the object of an ongoing work. Here, we restrict our attention to 1safe TPNs. ..."
Abstract

Cited by 84 (17 self)
 Add to MetaCart
(Show Context)
this paper and is the object of an ongoing work. Here, we restrict our attention to 1safe TPNs.
Interval Timed Coloured Petri Nets and their Analysis
, 1993
"... . Practical experiences show that only timed and coloured Petri nets are capable of modelling large and complex realtime systems. This is the reason we present the Interval Timed Coloured Petri Net (ITCPN) model. An interval timed coloured Petri net is a coloured Petri net extended with time; time ..."
Abstract

Cited by 47 (9 self)
 Add to MetaCart
. Practical experiences show that only timed and coloured Petri nets are capable of modelling large and complex realtime systems. This is the reason we present the Interval Timed Coloured Petri Net (ITCPN) model. An interval timed coloured Petri net is a coloured Petri net extended with time; time is in tokens and transitions determine a delay for each produced token. This delay is specified by an upper and lower bound, i.e. an interval. The ITCPN model allows the modelling of the dynamic behaviour of large and complex systems, without losing the possibility of formal analysis. In addition to the existing analysis techniques for coloured Petri nets, we propose a new analysis method to analyse the temporal behaviour of the net. This method constructs a reduced reachability graph and exploits the fact that delays are described by an interval. 1 Introduction Petri nets have been widely used for the modelling and analysis of concurrent systems (Reisig [25]). There are several factors whi...
Throughput analysis of synchronous data flow graphs
 In ACSD’06, Proc. (2006), IEEE
, 2006
"... Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for application mapping on platforms. Throughput analysis of these SDFGs is an important step for verifying throughput requir ..."
Abstract

Cited by 41 (16 self)
 Add to MetaCart
(Show Context)
Synchronous Data Flow Graphs (SDFGs) are a useful tool for modeling and analyzing embedded data flow applications, both in a single processor and a multiprocessing context or for application mapping on platforms. Throughput analysis of these SDFGs is an important step for verifying throughput requirements of concurrent realtime applications, for instance within designspace exploration activities. Analysis of SDFGs can be hard, since the worstcase complexity of analysis algorithms is often high. This is also true for throughput analysis. In particular, many algorithms involve a conversion to another kind of data flow graph, the size of which can be exponentially larger than the size of the original graph. In this paper, we present a method for throughput analysis of SDFGs, based on explicit statespace exploration and we show that the method, despite its worstcase complexity, works well in practice, while existing methods often fail. We demonstrate this by comparing the method with stateoftheart cycle mean computation algorithms. Moreover, since the statespace exploration method is essentially the same as simulation of the graph, the results of this paper can be easily obtained as a byproduct in existing simulation tools. 1
A Petri Net Approach for Performance Oriented Parallel Program Design
, 1992
"... Performance orientation in the development process of parallel software is motivated by outlining the misconception of current approaches where performance activies come in at the very end of the development, mainly in terms of measurement or monitoring after the implementation phase. At that time m ..."
Abstract

Cited by 37 (6 self)
 Add to MetaCart
Performance orientation in the development process of parallel software is motivated by outlining the misconception of current approaches where performance activies come in at the very end of the development, mainly in terms of measurement or monitoring after the implementation phase. At that time major part of the development work is already done, and performance pitfalls are very hard to repair  if this is possible at all. A development process for parallel programs that launches performance engineering in the early design phase is proposed, based on a Petri net specification methodology for the performance critical parts of a parallel system. The Petri net formalism is used to define Program Resource Mappingnet (PRMnet) models, that serve as an integrated performance model of parallel processing systems, combining performance characteristics of parallel programs (Pnet), parallel hardware (Rnet) and the assignment of programs to hardware (Mapping) into a single performance model...
Properties and Performance Bounds for Closed Free Choice Synchronized Monoclass Queueing Networks
 IEEE Transactions on Automatic Control
, 1991
"... Several proposals exist for the introduction of synchronization constraints into Queueing Networks (QN). We show that many monoclass QN with synchronizations can naturally be modelled with a subclass of Petri Nets (PN) called Free Choice nets (FC), for which a wide gamut of qualitative behavioural a ..."
Abstract

Cited by 32 (21 self)
 Add to MetaCart
(Show Context)
Several proposals exist for the introduction of synchronization constraints into Queueing Networks (QN). We show that many monoclass QN with synchronizations can naturally be modelled with a subclass of Petri Nets (PN) called Free Choice nets (FC), for which a wide gamut of qualitative behavioural and structural results have been derived. We use some of these net theoretic results to characterize the ergodicity, boundedness and liveness of closed Free Choice Synchronized Queueing Networks (FCSQN). Moreover we define upper and lower throughput bounds based on the mean value of the service times, without any assumption on the probability distributions (thus including both the deterministic and the stochastic cases). We show that monotonicity properties exist between the throughput bounds and the parameters of the model in terms of population and service times. We propose (theoretically polynomial and practically linear complexity) algorithms for the computation of these bounds, based on ...
Implementing Synchronous Models on Loosely Time Triggered Architectures
 IEEE Transactions on Computers
"... Synchronous systems offer a clean semantics and an easy verification path at the expense of often inefficient implementations. Capturing design specifications as synchronous models and then implementing the specifications in a less restrictive platform allow to address a much larger design space. Th ..."
Abstract

Cited by 24 (9 self)
 Add to MetaCart
(Show Context)
Synchronous systems offer a clean semantics and an easy verification path at the expense of often inefficient implementations. Capturing design specifications as synchronous models and then implementing the specifications in a less restrictive platform allow to address a much larger design space. The key issue in this approach is maintaining semantic equivalence between the synchronous model and its implementation. We address this problem by showing how to map a synchronous model onto a loosely timetriggered architecture that is fairly straightforward to implement as it does not require global synchronization or blocking communication. We show how to maintain semantic equivalence between specification and implementation using an intermediate model (similar to a Kahn process network but with finite queues) that helps in defining the transformation. Performance of the semantic preserving implementation is studied for the general case as well as for a few special cases. 1
Decidability of Properties of TimedArc Petri Nets
 In ICATPN’00
, 2000
"... Timedarc Petri nets (TAPN's) are not Turing powerful, because, in particular, they cannot simulate a counter with zero testing. Thus, we could think that this model does not increase ... ..."
Abstract

Cited by 23 (0 self)
 Add to MetaCart
Timedarc Petri nets (TAPN's) are not Turing powerful, because, in particular, they cannot simulate a counter with zero testing. Thus, we could think that this model does not increase ...
Properties and Performance Bounds for Timed Marked Graphs
 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS  I: FUNDAMENTAL THEORY AND APPLICATIONS
, 1992
"... A class of synchronized queueing networks with deterministic routing is identified to be equivalent to a subclass of timed Petri nets called marked graphs. First some structural and behavioral properties of marked graphs are recalled and used to show interesting properties of this class of performan ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
(Show Context)
A class of synchronized queueing networks with deterministic routing is identified to be equivalent to a subclass of timed Petri nets called marked graphs. First some structural and behavioral properties of marked graphs are recalled and used to show interesting properties of this class of performance models. In particular, ergodicity is derived from boundedness and liveness of the underlying Petri net representation, which can be efficiently computed in polynomial time on the net structure. In case of unbounded (i.e., nonstronglyconnected) marked graphs, ergodicity is computed as a function of the average transition firing delays. Then the problem of computing both upper and lower bounds for the steadystate performance of timed and stochastic marked graphs is studied. In particular, linear programming problems defined on the incidence matrix of the underlying Petri nets are used to compute tight (i.e., attainable) bounds for the throughput of transitions for marked graphs with dete...