For the most recent entries see the
Petri Nets Newsletter.
Concurrency Based Transition Refinement for the Verification of Distributed Algorithms.
Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm.
Property preserving transition refinement with concurrent runs: an example.
Integrating Distributed Algorithms into Distributed Systems.
DAWN. Petrinetzmodelle zur Verifikation Verteilter Algorithmen.
Do you need a refined search? Try our search engine
which allows complex field-based queries.
The author's address is provided by the
database of Petri net researchers.
Back to the Petri Nets Bibliography