For the most recent entries see the
Petri Nets Newsletter.
Peuker, S.
-
Peuker, Sibylle:
Concurrency Based Transition Refinement for the Verification of Distributed Algorithms.
2003.
-
Peuker, Sibylle:
Transition Refinement for Deriving a Distributed Minimum Weight Spanning Tree Algorithm.
2002.
-
Peuker, S.:
Property preserving transition refinement with concurrent runs: an example.
2000.
-
Kindler, Ekkart;
Peuker, Sibylle:
Integrating Distributed Algorithms into Distributed Systems.
1998.
-
Weber, M.;
Walter, R.;
Völzer, H.;
Vesper, T.;
Reisig, W.;
Peuker, S.;
Kindler, E.;
Freiheit, J.;
Desel, J.:
DAWN. Petrinetzmodelle zur Verifikation Verteilter Algorithmen.
1997.
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