Extreme Runtimes of Schedules Modelled by Time Petri Nets

Authors:
Louchka Popova-Zeugmann;Matthias Werner
Affiliations:
Logic in Computer Science Group, Department of Computer Science, Humboldt University, Berlin, Germany. E-mail: popova@informatik.hu-berlin.de;Communication and Operating Systems Group, Department for Electrical Engineering and Computer Science, TU Berlin, Germany. E-mail: mwerner@cs.tu-berlin.de
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Year:
2005

Citing 6
Cited 1

Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Introduction to algorithms

Introduction to algorithms
Implications of Classical Scheduling Results for Real-Time Systems

Computer
A study of the recoverability of computing systems.

A study of the recoverability of computing systems.
Timed State Space Analysis of Real-Time Preemptive Systems

IEEE Transactions on Software Engineering
Analyzing Paths in Time Petri Nets

Fundamenta Informaticae

Modeling Group Scheduling Problems in Space and Time by Timed Petri Nets

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a method to determine best-case and worst-case times between two arbitrary markings in a bounded TPN is presented. The method uses a discrete subset of the state space of the net and achieves the results, which are integers, in polynomial time. As an application of the method the solution of a scheduling problem is shown.