7,163 research outputs found
Generic Pipelined Processor Modeling and High Performance Cycle-Accurate Simulator Generation
Detailed modeling of processors and high performance cycle-accurate
simulators are essential for today's hardware and software design. These
problems are challenging enough by themselves and have seen many previous
research efforts. Addressing both simultaneously is even more challenging, with
many existing approaches focusing on one over another. In this paper, we
propose the Reduced Colored Petri Net (RCPN) model that has two advantages:
first, it offers a very simple and intuitive way of modeling pipelined
processors; second, it can generate high performance cycle-accurate simulators.
RCPN benefits from all the useful features of Colored Petri Nets without
suffering from their exponential growth in complexity. RCPN processor models
are very intuitive since they are a mirror image of the processor pipeline
block diagram. Furthermore, in our experiments on the generated cycle-accurate
simulators for XScale and StrongArm processor models, we achieved an order of
magnitude (~15 times) speedup over the popular SimpleScalar ARM simulator.Comment: Submitted on behalf of EDAA (http://www.edaa.com/
Decision Problems for Petri Nets with Names
We prove several decidability and undecidability results for nu-PN, an
extension of P/T nets with pure name creation and name management. We give a
simple proof of undecidability of reachability, by reducing reachability in
nets with inhibitor arcs to it. Thus, the expressive power of nu-PN strictly
surpasses that of P/T nets. We prove that nu-PN are Well Structured Transition
Systems. In particular, we obtain decidability of coverability and termination,
so that the expressive power of Turing machines is not reached. Moreover, they
are strictly Well Structured, so that the boundedness problem is also
decidable. We consider two properties, width-boundedness and depth-boundedness,
that factorize boundedness. Width-boundedness has already been proven to be
decidable. We prove here undecidability of depth-boundedness. Finally, we
obtain Ackermann-hardness results for all our decidable decision problems.Comment: 20 pages, 7 figure
Integration of an object formalism within a hybrid dynamic simulation environment
PrODHyS is a general object-oriented environment which provides common and reusable components designed for the development and the management of dynamic simulation of systems engineering. Its major characteristic is its ability to simulate processes described by a hybrid model. In this framework, this paper focuses on the "Object Differential Petri Net" (ODPN) formalism integrated within PrODHyS. The use of this formalism is illustrated through a didactic example relating to the field of Chemical Process System Engineering (PSE)
Controlling Reversibility in Reversing Petri Nets with Application to Wireless Communications
Petri nets are a formalism for modelling and reasoning about the behaviour of
distributed systems. Recently, a reversible approach to Petri nets, Reversing
Petri Nets (RPN), has been proposed, allowing transitions to be reversed
spontaneously in or out of causal order. In this work we propose an approach
for controlling the reversal of actions of an RPN, by associating transitions
with conditions whose satisfaction/violation allows the execution of
transitions in the forward/reversed direction, respectively. We illustrate the
framework with a model of a novel, distributed algorithm for antenna selection
in distributed antenna arrays.Comment: RC 201
Dependability Analysis of Control Systems using SystemC and Statistical Model Checking
Stochastic Petri nets are commonly used for modeling distributed systems in
order to study their performance and dependability. This paper proposes a
realization of stochastic Petri nets in SystemC for modeling large embedded
control systems. Then statistical model checking is used to analyze the
dependability of the constructed model. Our verification framework allows users
to express a wide range of useful properties to be verified which is
illustrated through a case study
A Petri Nets-based Scheduling Methodology forMultipurpose Batch Plants.
This article presents an optimization methodology of batch production processes assembled by shared resources which rely on a mapping of state-events into time-events allowing in this way the straightforward use of a well consolidated scheduling policies developed for manufacturing systems. A technique to generate the timed Petri net representation from a continuous dynamic representation (Differential-Algebraic Equations systems (DAEs)) of the production system is presented together with the main characteristics of a Petri nets-based tool implemented for optimization purposes. This paper describes also how the implemented tool generates the coverability tree and how it can be pruned by a general purpose heuristic. An example of a distillation process with two shared batch resources is used to illustrate the optimization methodology proposed
- …