Property Preserving Transition Refinement with Concurrent Runs: An Example

Authors:
Sibylle Peuker
Affiliations:
-
Venue:
ACSD '01 Proceedings of the Second International Conference on Application of Concurrency to System Design
Year:
2001

Citing 0
Cited 1

Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm

ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets

Quantified Score

Hi-index	0.00

Visualization

Abstract

We suggest a new notion of behavior preserving transition refinement based on partial order semantics. Furthermore, we discuss how to prove the correctness of a transition refinement step. Our results are formalized in the setting of Petri nets. We use Petri nets because they have a canonical partial order semantics, which is defined by concurrent runs.