20 research outputs found
Reachability Analysis of Time Basic Petri Nets: a Time Coverage Approach
We introduce a technique for reachability analysis of Time-Basic (TB) Petri
nets, a powerful formalism for real- time systems where time constraints are
expressed as intervals, representing possible transition firing times, whose
bounds are functions of marking's time description. The technique consists of
building a symbolic reachability graph relying on a sort of time coverage, and
overcomes the limitations of the only available analyzer for TB nets, based in
turn on a time-bounded inspection of a (possibly infinite) reachability-tree.
The graph construction algorithm has been automated by a tool-set, briefly
described in the paper together with its main functionality and analysis
capability. A running example is used throughout the paper to sketch the
symbolic graph construction. A use case describing a small real system - that
the running example is an excerpt from - has been employed to benchmark the
technique and the tool-set. The main outcome of this test are also presented in
the paper. Ongoing work, in the perspective of integrating with a
model-checking engine, is shortly discussed.Comment: 8 pages, submitted to conference for publicatio
TIME EXTENSIONS OF PETRI NETS FOR MODELLING AND YERIFICATION OF HARD REAL-TIME SYSTEMS
The main aim ofthepaper is apresentation oftime extensions ofPetri nets appropriate for modelling and analysis o f hard real-time systems. It is assumed, that the extensions must provide a model o f time flow, an ability to force a transition to fire within a stated timing constraint (the so-called the strongfiring rule), and timing constraints represented by inte- rvals. The presented survey includes extensions o f classical Place/Transition Petri nets, as well as the ones applied to high-level Petri nets. An expressiveness o f each time extension is illustrated using simple hard real-time system. The paper includes also a brief description o f analysis and verification methods related to the extensions, and a survey o f software tools supporting modelling and analysis o f the considered Petri nets
Architecting Time-Critical Big-Data Systems
Current infrastructures for developing big-data applications are able to process –via big-data analytics- huge amounts of data, using clusters of machines that collaborate to perform parallel computations. However, current infrastructures were not designed to work with the requirements of time-critical applications; they are more focused on general-purpose applications rather than time-critical ones. Addressing this issue from the perspective of the real-time systems community, this paper considers time-critical big-data. It deals with the definition of a time-critical big-data system from the point of view of requirements, analyzing the specific characteristics of some popular big-data applications. This analysis is complemented by the challenges stemmed from the infrastructures that support the applications, proposing an architecture and offering initial performance patterns that connect application costs with infrastructure performance
A unified high-level Petri net formalism for time-critical systems
4The authors introduce a high-level Petri net formalism-environment/relationship (ER) nets-which can be used to specify control, function, and timing issues. In particular, they discuss how time can be modeled via ER nets by providing a suitable axiomatization. They use ER nets to define a time notation that is shown to generalize most time Petri-net-based formalisms which appeared in the literature. They discuss how ER nets can be used in a specification support environment for a time-critical system and, in particular, the kind of analysis supported.reservedGhezzi C.; Mandrioli D.; Morasca S.; Pezze M.Ghezzi, C.; Mandrioli, D.; Morasca, Sandro; Pezze, M