Dr. Harro Wimmel

Anschrift:	Dr. Harro Wimmel Universität Oldenburg Fakultät II Department für Informatik 26111 Oldenburg
E-Mail:	Harro.Wimmel

Ehemaliger wissenschaftlicher Mitarbeiter in der Abteilung Parallele Systeme der Theoretischen Informatik.

 

Publikationen

[BDW07]

Eike Best, Philippe Darondeau, and Harro Wimmel. Making Petri Nets Safe and Free of Internal Transitions. Fundamenta Informaticae, 80:75-90, 2007.

[BEWW06]

Eike Best, Javier Esparza, Harro Wimmel, and Karsten Wolf. Separability in Conflict-free Petri Nets. In I. Virbitskaite und A. Voronkov, editor, Perspectives of Systems Informatics, volume 4378 of Lecture Notes in Computer Science, pages 1-18. Springer-Verlag, 2006.

[Wim04b]

Harro Wimmel. Infinity of Intermediate States is Decidable for Petri Nets. In Wolfgang Reisig and Jordi Cortadella, editors, 25th International Conference on Theory and Application of Petri nets, Lecture Notes in Computer Science, pages 426-435. Springer-Verlag, 2004.

[Wim04a]

Harro Wimmel. Eliminating Internal Behaviour in Petri Nets. In Wolfgang Reisig and Jordi Cortadella, editors, 25th International Conference on Theory and Application of Petri nets, Lecture Notes in Computer Science, pages 411-425. Springer-Verlag, 2004.

[DW03]

Philippe Darondeau and Harro Wimmel. From bounded T-systems to 1-safe T-systems up to language equivalence. Technical Report INRIA-RR-4708, INRIA, Rennes, France, 2003.
[ .html ]

[PW02]

Lutz Priese and Harro Wimmel. Theoretische Informatik: Petri-Netze. Springer-Verlag, 2002. Lehrbuch, 376 Seiten.

[BW00]

Eike Best and Harro Wimmel. Reducing k-Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets. In Mogens Nielsen and Dan Simpson, editors, Application and Theory of Petri Nets, volume 1825 of Lecture Notes in Computer Science, pages 63-82. Springer-Verlag, 2000.
[ .ps.gz ]

[Wim00]

Harro Wimmel. Algebraische Semantiken für Petri-Netze. PhD thesis, Universität Koblenz-Landau, 2000. 212 pages.

[PW98]

Lutz Priese and Harro Wimmel. A Uniform Approach to True-Concurrency and Interleaving Semantics for Petri Nets. Theoretical Computer Science, 206:219-256, 1998.