Semantics and Verification of Object-Oriented Languages

Icon

NII Shonan Meeting Seminar 063

Julian Rathke: Compositional Reachablility in Petri Nets

We consider a compositional approach to deciding reachability for 1-bounded Petri Nets. We introduce a novel notion of Petri Nets with boundaries in order to capture the requirements on interactions between the composed subnets. This approach allows for a new divide and conquer style algorithm for the problem. We also describe a tool based implementation of the approach and compare its performance against other state-of-the-art reachability checkers.

Slides

Category: Talks

Tagged:

Comments are closed.