Verification of schedulability of real-time systems with extended time Petri nets

Okawa, Yoichi; Yoneda, Tomohiro

doi:10.1109/wpdrts.1995.470489

Cited by 5 publications

(6 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…When n tasks share a single processor in a round-robin policy, the corresponding progress variable increases with the derivative 1/n. Additionally, in [32], the round-robin scheduling is addressed. In this approach groups of transitions are defined together with execution speeds.…”

Section: Petri Net-based Modelsmentioning

confidence: 99%

Parametric multisingular hybrid Petri nets: Formal definitions and analysis techniques

Motallebi

Azgomi

2015

Information and Computation

View full text Add to dashboard Cite

Section: Petri Net-based Modelsmentioning

confidence: 99%

Parametric multisingular hybrid Petri nets: Formal definitions and analysis techniques

Motallebi

Azgomi

2015

Information and Computation

View full text Add to dashboard Cite

“…TPNs take into account the scheduling of software tasks in a multi-processor system with the assumption that the allocation of tasks to the processors is known and fixed. Scheduling-TPNs [10,30] is an extension of TPNs, proposed for schedulability verification, with the capability of specifying different scheduling policies. Also, in [10], an extension of TPNs is proposed which considers the round-robin scheduling policy.…”

Section: Timed and Hybrid Petri Netsmentioning

confidence: 99%

Translation from Multisingular Hybrid Petri Nets to Multisingular Hybrid Automata

Motallebi

Azgomi

2014

Fundamenta Informaticae

View full text Add to dashboard Cite

In this paper, we investigate some important aspects of a new formalism for modelling and verification of hybrid dynamic systems (HDS), which is called multisingular hybrid Petri nets (MSHPNs). This new hybrid formalism is aimed to bridge the gap between hybrid automata (HA) and hybrid Petri nets (HPNs) by equipping the HPN model with the capabilities of HA to control the execution and firing of timed transitions. Practically, MSHPNs can be considered as the counterpart with the same expressive power as multisingular hybrid automata (MSHA). In order to analyse MSHPN models, a speed-based partitioning technique has been introduced in which the variable space is partitioned based on the balance of continuous places. In this paper, we formalize the notions of conflicts and conflict resolution and the challenging issue of speed computation. Then, we focus on considering a translation from a bounded MSHPN to a multisingular hybrid automaton that preserves the behavioural semantics of the original MSHPN in terms of weak timed bisimulation. The translation algorithm uses the speed-based partitioning method and obtains a speed-based partitioning hybrid automaton for a given bounded MSHPN. Model checking a timed property for an MSHPN amounts to model checking its equivalent property on the obtained speed-based partitioning hybrid automaton, thus MSHPN models can be analysed using the existing tools. The advantages of the proposed method are twofold: (1) hybrid systems can be described more succinctly and therefore more readably as MSHPNs, and (2) one can use the existing tools (like HYTECH) to analyse MSHPN models.

show abstract

“…In [27], when n tasks with the same priority share a single processor in a round-robin policy, the evolution rate of the corresponding variables was 1/n. In order to model round-robin scheduling easily, in the approach proposed in [42], groups of transitions were defined together with execution speeds. The transitions in a group can be executed at the same time and each rate is divided by the sum of the execution speeds.…”

Section: Soundness Of the Translationmentioning

confidence: 99%

A new extension of activity networks for modeling and verification of timed systems

Motallebi¹,

Azgomi²,

MIRZAEI³

et al. 2013

Turk J Elec Eng & Comp Sci

View full text Add to dashboard Cite

Stochastic activity networks (SANs) are a well-known petri net-based formalism used for the performance and dependability modeling of a wide range of systems. On the other hand, the growing complexity of timed systems makes it imperative to apply formal analysis techniques in the early stages of the system's development. Finding a suitable framework for the modeling, evaluation, and verification of these systems is still a great challenge. In this paper, we introduce a new formalism named timed activity networks (TANs), which are based on the activity networks that are the nondeterministic settings of the SANs. The advantages of TANs are 2-fold: 1) allowing the construction of more compact petri net-based models of timed systems and 2) allowing the assignment of time intervals to timed activities where the activity completion rates are marking-dependent, which makes TANs a better model for timed systems.Thanks to the presence of the input/output gates, TANs are capable of describing a situation whose specification using petri net-based formalisms was not practical, due to the naivety of the enabling and firing rules in these models. In addition, a great benefit of TANs is the similarity of their primitives and notations to ordinary SANs, which allows us to easily obtaining these 2 models from each other. Accordingly, SANs can be used for performance, and dependability modeling and evaluation, while TANs can be used for the model checking of timed systems. In this paper, we present the definitions, semantics, and model checking techniques of the proposed formalism. In order to model check TAN models, a transformation procedure is given for translating TAN models into the equivalent linear hybrid automaton, which can then be used with the existing techniques and tools.

show abstract

Verification of schedulability of real-time systems with extended time Petri nets

Cited by 5 publications

References 5 publications

Parametric multisingular hybrid Petri nets: Formal definitions and analysis techniques

Parametric multisingular hybrid Petri nets: Formal definitions and analysis techniques

Translation from Multisingular Hybrid Petri Nets to Multisingular Hybrid Automata

A new extension of activity networks for modeling and verification of timed systems

Contact Info

Product

Resources

About