Correctness verification and performance analysis of real-time systems using stochastic preemptive time Petri nets

Bucci, G.; Sassoli, L.; Vicario, Enrico

doi:10.1109/tse.2005.122

Cited by 35 publications

(22 citation statements)

References 38 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The radar data collection process contains 23 activities which are modeled by Petri Nets [3]. For simplicity, we denote these activities as a 1 to a 23 .…”

Section: Motivating Examplementioning

confidence: 99%

“…On the contrary, probability-based methods are often applied together with stochastic Petri nets SPN [3] and thus the workflow execution time can be better analyzed and estimated based on probability models [1], [26]. However, the accuracy of the probability-based methods may be affected by the error of the assumption on distribution models.…”

Section: Preliminaries On the Temporal Consistency Modelmentioning

confidence: 99%

See 1 more Smart Citation

Preventing Temporal Violations in Scientific Workflows: Where and How

Liu

Yang

Jiang

et al. 2011

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

Abstract-Due to the dynamic nature of the underlying high-performance infrastructures for scientific workflows such as grid and cloud computing, failures of timely completion of important scientific activities, namely, temporal violations, often take place. Unlike conventional exception handling on functional failures, nonfunctional QoS failures such as temporal violations cannot be passively recovered. They need to be proactively prevented through dynamically monitoring and adjusting the temporal consistency states of scientific workflows at runtime. However, current research on workflow temporal verification mainly focuses on runtime monitoring, while the adjusting strategy for temporal consistency states, namely, temporal adjustment, has so far not been thoroughly investigated. For this issue, two fundamental problems of temporal adjustment, namely, where and how, are systematically analyzed and addressed in this paper. Specifically, a novel minimum probability time redundancy-based necessary and sufficient adjustment point selection strategy is proposed to address the problem of where and an innovative genetic-algorithm-based effective and efficient local rescheduling strategy is proposed to tackle the problem of how. The results of large-scale simulation experiments with generic workflows and specific real-world applications demonstrate that our temporal adjustment strategy can remarkably prevent the violations of both local and global temporal constraints in scientific workflows.

show abstract

“…The radar data collection process contains 23 activities which are modeled by Petri Nets [3]. For simplicity, we denote these activities as a 1 to a 23 .…”

Section: Motivating Examplementioning

confidence: 99%

Section: Preliminaries On the Temporal Consistency Modelmentioning

confidence: 99%

Preventing Temporal Violations in Scientific Workflows: Where and How

Liu

Yang

Jiang

et al. 2011

IIEEE Trans. Software Eng.

View full text Add to dashboard Cite

show abstract

“…activity durations and temporal constraints to facilitate temporal verification. One of the classical modelling methods is the Stochastic Petri Nets [32,33] probability attributes into workflow processes that can be employed to facilitate scientific workflow modelling. Activity duration, as one of the basic elements to measure the system performance, is of significant value to workflow scheduling, performance analysis and temporal verification [9,19,28,39].…”

Section: Related Workmentioning

confidence: 99%

A probabilistic strategy for temporal constraint management in scientific workflow systems

Liu

Chen

et al. 2011

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYIn scientific workflow systems, it is critical to ensure the timely completion of scientific workflows. Therefore, temporal constraints as a type of QoS (Quality of Service) specification are usually required to be managed in scientific workflow systems. Specifically, temporal constraint management includes two basic tasks: setting temporal constraints at workflow build-time and updating temporal constraints at workflow run-time. For constraint setting, the current work mainly adopts user-specified temporal constraints without considering the system performance. Hence, it may result in frequent temporal violations which deteriorate the overall workflow execution effectiveness. As regards constraint updating, although not well investigated, so far is in fact of great importance to workflow management tasks such as workflow scheduling and exception handling. In this paper, with a systematic analysis of the above issues, we propose a probabilistic strategy for temporal constraint management which utilizes a novel probability-based temporal consistency model. Specifically for constraint setting, a negotiation process between the client and the service provider is designed to support the setting of coarse-grained temporal constraints and then automatically derive the fine-grained temporal constraints; for constraint updating, the probability time deficit/redundancy propagation process is proposed to update run-time fine-grained temporal constraints when workflow execution is either ahead of or behind the schedule. The effectiveness of our strategy is demonstrated through a case study on an example scientific workflow process in our scientific workflow system.

show abstract

“…PTPNs [5] extend Time Petri Nets (TPNs) [25], [3] with a concept of resource assignment that makes the progress of timed transitions dependent on the availability of a set of preemptable resources, enabling the representation of suspension in the advancement of clocks and thus providing an expressivity that effectively supports the specification of real-time task-sets. In [8], the theory of pTPNs is cast in a V-Model SW process supporting all the steps of development Application Task Release Deadline Chunk Priority Exec.…”

Section: Ptpn Model Of the Hs Systemmentioning

confidence: 99%

A Formal Approach to Design and Verification of Two-Level Hierarchical Scheduling Systems

Carnevali

Lipari

Pinzuti

et al. 2011

Reliable Software Technologies - Ada-Europe 2011

View full text Add to dashboard Cite

Abstract. Hierarchical scheduling (HS) systems manage a set of realtime applications through a scheduling hierarchy, enabling partitioning and reduction of complexity, confinement of failure modes, and temporal isolation among system applications. This plays a crucial role in all industrial areas where high-performance microprocessors allow growing integration of multiple applications on a single platform. We propose a formal approach to the development of real-time applications with non-deterministic Execution Times and local resource sharing managed by a Time Division Multiplexing (TDM) global scheduler and preemptive Fixed Priority (FP) local schedulers, according to the scheduling hierarchy prescribed by the ARINC-653 standard. The methodology leverages the theory of preemptive Time Petri Nets (pTPNs) to support exact schedulability analysis, to guide the implementation on a Real-Time Operating System (RTOS), and to drive functional conformance testing of the real-time code. Computational experience is reported to show the feasibility of the approach.

show abstract

Correctness verification and performance analysis of real-time systems using stochastic preemptive time Petri nets

Cited by 35 publications

References 38 publications

Preventing Temporal Violations in Scientific Workflows: Where and How

Preventing Temporal Violations in Scientific Workflows: Where and How

A probabilistic strategy for temporal constraint management in scientific workflow systems

A Formal Approach to Design and Verification of Two-Level Hierarchical Scheduling Systems

Contact Info

Product

Resources

About