Verification of Non-functional Properties of a Composable Architecture with Petrinets

Authors:
Jan Richling;Louchka Popova-Zeugmann;Matthias Werner
Affiliations:
Humboldt-Universität zu Berlin, Institut für Informatik, Rudower Chaussee 25, 12489 Berlin, Germany;Humboldt-Universität zu Berlin, Institut für Informatik, Rudower Chaussee 25, 12489 Berlin, Germany;Humboldt-Universität zu Berlin, Institut für Informatik, Rudower Chaussee 25, 12489 Berlin, Germany
Venue:
Fundamenta Informaticae - Concurrency Specification and Programming Workshop (CS&P'2001)
Year:
2002

Citing 9
Cited 3

Safety analysis of timing properties in real-time systems

IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
TTP-A Protocol for Fault-Tolerant Real-Time Systems

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

Journal of the ACM (JACM)
Real-Time Systems: Design Principles for Distributed Embedded Applications

Real-Time Systems: Design Principles for Distributed Embedded Applications
Real-Time Systems

Real-Time Systems
Distributed Fault-Tolerant Real-Time Systems: The Mars Approach

IEEE Micro
ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS

ANALYSIS OF ASYNCHRONOUS CONCURRENT SYSTEMS BY TIMED PETRI NETS
A study of the recoverability of computing systems.

A study of the recoverability of computing systems.
Analyzing Paths in Time Petri Nets

Fundamenta Informaticae

A Method to Prove Non-Reachability in Priority Duration Petri Nets

Fundamenta Informaticae
Using State Equation to Prove Non-Reachability in Timed Petrinets

Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
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, we introduce our concept of composability and present the MSS architecture as an example for a composable architecture. MSS claims to be composable with respect to timing properties. We discuss, how to model and prove properties in such an architecture with time-extended Petrinets. As a result, the first step of a proof of composability is presented as well as a new kind of Petrinet, which is more suitable for modeling architectures like MSS.