A method to prove non-reachability in priority duration Petri nets

Authors:
Matthias Werner;Louchka Popova-Zeugmann;Jan Richling
Affiliations:
Communication and Operating Systems Group, Department for Electrical Engineering and Computer Science, TU Berlin, Germany;Automata and System Theory Group, Department of Computer Science, Humboldt University of Berlin, Germany;Computer Architecture and Communication Group, Department of Computer Science, Humboldt University of Berlin, Germany
Venue:
Fundamenta Informaticae
Year:
2003

Citing 4
Cited 0

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

Journal of the ACM (JACM)
Verification of non-functional properties of a composable architecture with Petri nets

Fundamenta Informaticae
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
Using state equation to prove non-reachability in timed Petrinets

Fundamenta Informaticae - Concurrency specification and programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a process algebra obtained by adapting the process algebra with continuous relative timing from Baeten and Middelburg [Process Algebra with Timing, Springer, 2002, Chap. 4] to spatially located actions. This process algebra makes it possible ...