Publikationen des Jahres 1997
Bücher und Konferenzbände
Hartmut Ehrig, Wolfgang Reisig, and Herbert Weber, editors. Move-On-Workshop der DFG-Forschergruppe 'Petri Net Technology', number 97-21 of Forschungsberichte des Fachbereichs Informatik, April 1997. Technische Universität Berlin.
@Proceedings{ EhrigRW1997_tub_fb21, title = {{Move-On-Workshop der DFG-Forschergruppe 'Petri Net Technology'}}, year = 1997, editor = {Hartmut Ehrig and Wolfgang Reisig and Herbert Weber}, number = {97-21}, series = {Forschungsberichte des Fachbereichs Informatik}, month = apr, publisher = {Technische Universität Berlin}, url = {http://www.informatik.hu-berlin.de/PNT/pub_move.html} }
Publikationen in Zeitschriften und Büchern
Hartmut Ehrig and Wolfgang Reisig. An Algebraic View on Petri Nets.. Bulletin of the EATCS, 61:52-58, February 1997.
@Article{ Ehrigr1997_eatcs, author = {Hartmut Ehrig and Wolfgang Reisig}, title = {{An Algebraic View on Petri Nets.}}, journal = {Bulletin of the EATCS}, year = 1997, volume = 61, pages = {52-58}, month = feb }Ekkard Kindler. Inhibitor arcs: A philosophical view. Petri Net Newsletter, 53, October 1997. Note: Cover Picture Story.
@Article{ Kindler1997_pnn53, author = {Ekkard Kindler}, title = {{Inhibitor arcs: A philosophical view}}, journal = {Petri Net Newsletter}, year = 1997, volume = 53, month = oct, note = {Cover Picture Story}, ps = {http://www.informatik.hu-berlin.de/~kindler/PostScript/Inhib-PNNL.ps} }Ekkard Kindler, Wolfgang Reisig, Hagen Völzer, and Rolf Walter. Petri Net Based Verification of Distributed Algorithms: An Example. Formal Aspects of Computing, 9(4):409-424, 1997.
@Article{ KindlerRVW1997_fac94, author = {Ekkard Kindler and Wolfgang Reisig and Hagen Völzer and Rolf Walter}, title = {{Petri Net Based Verification of Distributed Algorithms: An Example}}, journal = {Formal Aspects of Computing}, year = 1997, volume = 9, number = 4, pages = {409-424}, publisher = {Springer-Verlag} }Ekkard Kindler and Rolf Walter. Mutex Needs Fairness. Information Processing Letters, 62(1):31-39, 1997.
@Article{ KindlerW1997_ipl621, author = {Ekkard Kindler and Rolf Walter}, title = {{Mutex Needs Fairness}}, journal = {Information Processing Letters}, year = 1997, volume = 62, number = 1, pages = {31-39}, publisher = {ELSEVIER}, url = {http://dx.doi.org/10.1016/S0020-0190(97)00033-1} }
Konferenzbeiträge und Beiträge auf Workshops
Claudia Ermel, Magdalena Gajewski, Tobias Vesper, and Michael Weber. Verifikation strukturierter Netze. In Hartmut Ehrig, Wolfgang Reisig, and Herbert Weber, editors, Move-On-Workshop der DFG-Forschergruppe 'Petri Net Technology', number 97-21 of Forschungsberichte des Fachbereichs Informatik, April 1997. Technische Universität Berlin.
@InProceedings{ ErmelGVW1997_tub_fb21, author = {Claudia Ermel and Magdalena Gajewski and Tobias Vesper and Michael Weber}, title = {{Verifikation strukturierter Netze}}, year = 1997, ps = {http://www.tfs.cs.tu-berlin.de/~petri/Allpublications/Year1997/Verif_Strukt_Netze.MoveOn.ps.gz}, crossref = {EhrigRW1997_tub_fb21} }Olaf Fricke, Alexander Borusan, Tobias Vesper, and Ekkard Kindler. Verifikation im Vorgehensmodell anhand eines Beispiels. In Hartmut Ehrig, Wolfgang Reisig, and Herbert Weber, editors, Move-On-Workshop der DFG-Forschergruppe 'Petri Net Technology', number 97-21 of Forschungsberichte des Fachbereichs Informatik, April 1997. Technische Universität Berlin.
@InProceedings{ FrickeBVK1997_tub_fb21, author = {Olaf Fricke and Alexander Borusan and Tobias Vesper and Ekkard Kindler}, title = {{Verifikation im Vorgehensmodell anhand eines Beispiels}}, year = 1997, ps = {http://www.informatik.hu-berlin.de/PNT/Postscript/FBVK97_viv.ps.gz}, crossref = {EhrigRW1997_tub_fb21} }Ekkard Kindler. A compositional partial order semantics for Petri net components. In Pierre Azéma and Gianfranco Balbo, editors, Application and Theory of Petri Nets 1997, 18th International Conference, ICATPN '97, Proceedings, volume 1248 of Lecture Notes in Computer Science, pages 235-252, June 1997. Springer-Verlag.
@InProceedings{ Kindler1997_lncs1248, author = {Ekkard Kindler}, title = {{A compositional partial order semantics for Petri net components}}, editor = {Pierre Azéma and Gianfranco Balbo}, booktitle = {{Application and Theory of Petri Nets 1997, 18th International Conference, ICATPN '97, Proceedings}}, year = 1997, series = {Lecture Notes in Computer Science}, volume = 1248, pages = {235-252}, month = jun, publisher = {Springer-Verlag}, ps = {http://www.informatik.hu-berlin.de/top/download/publications/Kindler1997_lncs1248.ps} }Ekkard Kindler. Der Petrinetz-Kern: Ein Traum wird wahr. In Hartmut Ehrig, Wolfgang Reisig, and Herbert Weber, editors, Move-On-Workshop der DFG-Forschergruppe 'Petri Net Technology', number 97-21 of Forschungsberichte des Fachbereichs Informatik, April 1997. Technische Universität Berlin.
@InProceedings{ Kindler1997_tub_fb21, author = {Ekkard Kindler}, title = {{Der Petrinetz-Kern: Ein Traum wird wahr}}, year = 1997, ps = {http://www.informatik.hu-berlin.de/PNT/Postscript/Kin97_pnkern.ps.gz}, keywords = {Petri Net Kernel}, crossref = {EhrigRW1997_tub_fb21} }Ekkard Kindler and Wolfgang Reisig. Verification of Distributed Algorithms with Algebraic Petri Nets. In Christian Freksa, Matthias Jantzen, and Rüdiger Valk, editors, Foundations of Computer Science: Potential - Theory - Cognition, volume 1337 of Lecture Notes in Computer Science, pages 261-270, 1997. Springer-Verlag.
@InProceedings{ KindlerR1997_lncs1337, author = {Ekkard Kindler and Wolfgang Reisig}, title = {{Verification of Distributed Algorithms with Algebraic Petri Nets}}, editor = {Christian Freksa and Matthias Jantzen and Rüdiger Valk}, booktitle = {{Foundations of Computer Science: Potential - Theory - Cognition}}, year = 1997, series = {Lecture Notes in Computer Science}, volume = 1337, pages = {261-270}, publisher = {Springer-Verlag}, url = {http://link.springer.de/link/service/series/0558/bibs/1337/13370261.htm} }Ekkart Kindler and Tobias Vesper. A temporal logic for events and states in Petri nets. In B. Farwer, D. Moldt, and M.-O. Stehr, editors, Petri Nets in System Engineering (PNSE'97) Modelling, Verification, and Validation, number FBI-HH-B-205/97 of Fachberichte, pages 101-110, September 1997. Universität Hamburg, Fachbereich Informatik.
@InProceedings{ KindlerV1997_pnse, author = {Ekkart Kindler and Tobias Vesper}, title = {{A temporal logic for events and states in Petri nets}}, editor = {B. Farwer and D. Moldt and M.-O. Stehr}, booktitle = {{Petri Nets in System Engineering (PNSE'97) Modelling, Verification, and Validation}}, year = 1997, series = {Fachberichte}, pages = {101-110}, month = sep, publisher = {Universität Hamburg, Fachbereich Informatik}, number = {FBI-HH-B-205/97}, ps = {http://www.informatik.hu-berlin.de/~kindler/PostScript/PNSE97-TL-Events.ps}, url = {http://citeseer.ist.psu.edu/kindler97temporal.html} }Sibylle Peuker. Invariant property preserving extensions of elementary Petri nets. In Hartmut Ehrig, Wolfgang Reisig, and Herbert Weber, editors, Move-On-Workshop der DFG-Forschergruppe 'Petri Net Technology', number 97-21 of Forschungsberichte des Fachbereichs Informatik, April 1997. Technische Universität Berlin.
@InProceedings{ Peuker1997_tub_fb21, author = {Sibylle Peuker}, title = {{Invariant property preserving extensions of elementary Petri nets}}, year = 1997, ps = {http://www.informatik.hu-berlin.de/PNT/Postscript/Peu97_invar.ps.gz}, crossref = {EhrigRW1997_tub_fb21} }Wolfgang Reisig. Interleaved progress, concurrent progress, and local progress. In D. A. Peled, V. R. Pratt, and G. J. Holzmann, editors, Proceedings of the DIMACS workshop on Partial order methods in verification (POMIV '96), volume 29, New York, NY, USA, pages 99-115, 1997. AMS Press, Inc..
@InProceedings{ Reisig1997_pomiv, author = {Wolfgang Reisig}, title = {{Interleaved progress, concurrent progress, and local progress}}, editor = {D. A. Peled and V. R. Pratt and G. J. Holzmann}, booktitle = {{Proceedings of the DIMACS workshop on Partial order methods in verification (POMIV '96)}}, year = 1997, volume = 29, pages = {99-115}, address = {New York, NY, USA}, publisher = {AMS Press, Inc.}, isbn = {0-8218-0579-7} }Wolfgang Reisig. Verteilte Algorithmen: Nutzen sie der Forschergruppe?. In Hartmut Ehrig, Wolfgang Reisig, and Herbert Weber, editors, Move-On-Workshop der DFG-Forschergruppe 'Petri Net Technology', number 97-21 of Forschungsberichte des Fachbereichs Informatik, April 1997. Technische Universität Berlin.
@InProceedings{ Reisig1997_tub_fb21, author = {Wolfgang Reisig}, title = {{Verteilte Algorithmen: Nutzen sie der Forschergruppe?}}, year = 1997, ps = {http://www.informatik.hu-berlin.de/PNT/Postscript/Rei97_vertalgo.ps.gz}, crossref = {EhrigRW1997_tub_fb21} }Karsten Schmidt. Modelchecking on Symbolic Reachability Graphs of Petri nets. In Workshop Algorithmen und Werkzeuge für Petrinetze, Berlin, pages 43-48, 1997.
@InProceedings{ Schmidt1997_awpn, author = {Karsten Schmidt}, title = {{Modelchecking on Symbolic Reachability Graphs of Petri nets}}, booktitle = {{Workshop Algorithmen und Werkzeuge für Petrinetze}}, year = 1997, pages = {43-48}, address = {Berlin} }Karsten Schmidt. Modelchecking with Coverability Graphs. In Workshop on Concurrency, Specification and Programming, Warsaw, Poland, pages 112-123, 1997.
@InProceedings{ Schmidt1997_csp, author = {Karsten Schmidt}, title = {{Modelchecking with Coverability Graphs}}, booktitle = {{Workshop on Concurrency, Specification and Programming}}, year = 1997, pages = {112-123}, address = {Warsaw, Poland} }Karsten Schmidt. Siphons, Traps, and High-Level nets with Infinite Color Domains. In Pierre Azéma and Gianfranco Balbo, editors, Application and Theory of Petri Nets 1997, 18th International Conference, ICATPN '97, Proceedings, volume 1248 of Lecture Notes in Computer Science, pages 271-289, June 1997. Springer-Verlag.
Abstract: Commoner's Theorem establishes a relation between siphons, traps and liveness in free choice systems. Most proofs of this theorem do explicitly involve the finiteness of the net. Therefore we cannot apply the theorem directly to high level nets with infinite color domains. We prove generalisations of both the `if' and the `only if' direction to the infinite case which unfortunately cannot be combined to an `iff' statement. We present examples which show that there are both live and non-live nets in the grey zone left by our generalisations. Our approach enlarges the application area of Commoner's theorem to infinite Petri nets, compared with an earlier generalisation to a class of free choice predicate event system, but does not cover the other approach completely. @InProceedings{ Schmidt1997_lncs1248_1, author = {Karsten Schmidt}, title = {{Siphons, Traps, and High-Level nets with Infinite Color Domains}}, editor = {Pierre Azéma and Gianfranco Balbo}, booktitle = {{Application and Theory of Petri Nets 1997, 18th International Conference, ICATPN '97, Proceedings}}, year = 1997, series = {Lecture Notes in Computer Science}, volume = 1248, pages = {271-289}, month = jun, publisher = {Springer-Verlag}, abstract = {Commoner's Theorem establishes a relation between siphons, traps and liveness in free choice systems. Most proofs of this theorem do explicitly involve the finiteness of the net. Therefore we cannot apply the theorem directly to high level nets with infinite color domains. We prove generalisations of both the `if' and the `only if' direction to the infinite case which unfortunately cannot be combined to an `iff' statement. We present examples which show that there are both live and non-live nets in the grey zone left by our generalisations. Our approach enlarges the application area of Commoner's theorem to infinite Petri nets, compared with an earlier generalisation to a class of free choice predicate event system, but does not cover the other approach completely.} }Karsten Schmidt. Verification of Siphons and Traps for Algebraic Petri nets. In Pierre Azéma and Gianfranco Balbo, editors, Application and Theory of Petri Nets 1997, 18th International Conference, ICATPN '97, Proceedings, volume 1248 of Lecture Notes in Computer Science, pages 427-446, June 1997. Springer-Verlag.
Abstract: Siphons and traps are structures which allow for some implications on the net's behaviour and can be used in manual correctness proofs for concurrent systems. We introduce symbolic representations of siphons and traps which work quite well even in infinite cases and are still intuitively readable. The verification of symbolic siphons and traps is traced back to unification and structural induction on the terms. This approach is motivated by some additional considerations. For unification and other proposed structural reasoning mechanisms tool support is given by completeness proof tools studied in the theorem-proving community. @InProceedings{ Schmidt1997_lncs1248_2, author = {Karsten Schmidt}, title = {{Verification of Siphons and Traps for Algebraic Petri nets}}, editor = {Pierre Azéma and Gianfranco Balbo}, booktitle = {{Application and Theory of Petri Nets 1997, 18th International Conference, ICATPN '97, Proceedings}}, year = 1997, series = {Lecture Notes in Computer Science}, volume = 1248, pages = {427-446}, month = jun, publisher = {Springer-Verlag}, abstract = {Siphons and traps are structures which allow for some implications on the net's behaviour and can be used in manual correctness proofs for concurrent systems. We introduce symbolic representations of siphons and traps which work quite well even in infinite cases and are still intuitively readable. The verification of symbolic siphons and traps is traced back to unification and structural induction on the terms. This approach is motivated by some additional considerations. For unification and other proposed structural reasoning mechanisms tool support is given by completeness proof tools studied in the theorem-proving community.} }
Technische Berichte
Jörg Desel and Ekkard Kindler. Proving correctness of distributed algorithms: A Petrinet approach. Bericht 348, AIFB, Universität Karlsruhe, February 1997.
@TechReport{ Deselk1997_uk_tr348, author = {Jörg Desel and Ekkard Kindler}, title = {{Proving correctness of distributed algorithms: A Petrinet approach}}, institution = {Universität Karlsruhe}, year = 1997, type = {Bericht}, number = {348, AIFB}, month = feb }Jörg Desel, Ekkard Kindler, and Andreas Oberweis. Algorithmen und Werkzeuge für Petrinetze, 4. Workshop. Informatik-Berichte 85, Humboldt-Universität zu Berlin, September 1997.
@TechReport{ DeselKO1997_hub_tr85, author = {Jörg Desel and Ekkard Kindler and Andreas Oberweis}, title = {{Algorithmen und Werkzeuge für Petrinetze, 4. Workshop}}, institution = {Humboldt-Universität zu Berlin}, year = 1997, type = {Informatik-Berichte}, number = 85, month = sep }Ekkard Kindler and Tobias Vesper. ESTL: A temporal logic for events and states. Informatik-Berichte 87, Humboldt-Universität zu Berlin, November 1997.
@TechReport{ Kindlerv1997_hub_tr87, author = {Ekkard Kindler and Tobias Vesper}, title = {{ESTL: A temporal logic for events and states}}, institution = {Humboldt-Universität zu Berlin}, year = 1997, type = {Informatik-Berichte}, number = 87, month = nov }Ekkard Kindler and Hagen Völzer. Flexibility in algebraic nets. Informatik-Berichte 89, Humboldt-Universität zu Berlin, November 1997.
@TechReport{ Kindlerv1997_hub_tr89, author = {Ekkard Kindler and Hagen Völzer}, title = {{Flexibility in algebraic nets}}, institution = {Humboldt-Universität zu Berlin}, year = 1997, type = {Informatik-Berichte}, number = 89, month = nov }Karsten Schmidt. Applying Reduction Rules to Algebraic Petri nets. Technical Report A44, Helsinki University of Technology, 1997.
@TechReport{ Schmidt1997_hut_tra44, author = {Karsten Schmidt}, title = {{Applying Reduction Rules to Algebraic Petri nets}}, institution = {Helsinki University of Technology}, year = 1997, type = {Technical Report}, number = {A44} }Karsten Schmidt. Model Checking on Symbolic Reachability Graphs of Petri nets. Technical Report MATH-AL-10-1997, Dresden University of Technology, 1997.
@TechReport{ Schmidt1997_tud_trmathal10, author = {Karsten Schmidt}, title = {{Model Checking on Symbolic Reachability Graphs of Petri nets}}, institution = {Dresden University of Technology}, year = 1997, type = {Technical Report}, number = {MATH-AL-10-1997} }Hagen Völzer. Verifying fault tolerance of distributed algorithms formally: A case study. Informatik-Berichte 84, Humboldt-Universität zu Berlin, May 1997.
@TechReport{ Voelzer1997_hub_tr84, author = {Hagen Völzer}, title = {{Verifying fault tolerance of distributed algorithms formally: A case study}}, institution = {Humboldt-Universität zu Berlin}, year = 1997, type = {Informatik-Berichte}, number = 84, month = may }Michael Weber, Rolf Walter, Hagen Völzer, Tobias Vesper, Wolfgang Reisig, Sibylle Peuker, Ekkard Kindler, Jörn Freiheit, and Jörg Desel. DAWN: Petrinetzmodelle zur Verifikation Verteilter Algorithmen. Informatik-Berichte 88, Humboldt-Universität zu Berlin, December 1997. Note: Errata: http://www.informatik.hu-berlin.de/top/download/publications/WeberWVVRPKFD1997_hub_tr88-errata.ps.
@TechReport{ WeberWVVRPKFD1997_hub_tr88, author = {Michael Weber and Rolf Walter and Hagen Völzer and Tobias Vesper and Wolfgang Reisig and Sibylle Peuker and Ekkard Kindler and Jörn Freiheit and Jörg Desel}, title = {{DAWN: Petrinetzmodelle zur Verifikation Verteilter Algorithmen}}, institution = {Humboldt-Universität zu Berlin}, year = 1997, type = {Informatik-Berichte}, number = 88, month = dec, note = {Errata: http://www.informatik.hu-berlin.de/top/download/publications/WeberWVVRPKFD1997_hub_tr88-errata.ps}, ps = {http://www.informatik.hu-berlin.de/top/download/publications/WeberWVVRPKFD1997_hub_tr88.ps}, keywords = {DAWN} }
Studien- und Diplomarbeiten
Jörn Freiheit. Arc-Typed-Petrinetze. Verifikation eines Datenbankmanagementsystems mit Datenreplikation. Diplomarbeit, Humboldt-Universität zu Berlin, May 1997.
@MastersThesis{ Freiheit1997_da, author = {Jörn Freiheit}, title = {{Arc-Typed-Petrinetze. Verifikation eines Datenbankmanagementsystems mit Datenreplikation}}, school = {Humboldt-Universität zu Berlin}, year = 1997, type = {Diplomarbeit}, month = may }Axel Martens. Software-Engineering von Workflow-Applikationen mit Petrinetzen. Diplomarbeit, Humboldt-Universität zu Berlin, August 1997.
@MastersThesis{ Martens1997_da, author = {Axel Martens}, title = {{Software-Engineering von Workflow-Applikationen mit Petrinetzen}}, school = {Humboldt-Universität zu Berlin}, year = 1997, type = {Diplomarbeit}, month = aug, url = {http://www.informatik.hu-berlin.de/top/download/publications/Martens1997_da.zip} }Michael Weber. unless-Aspekte und ihr Beitrag zur Verifikation von mit Petrinetzen modellierten Systemen. Diplomarbeit, Humboldt-Universität zu Berlin, January 1997.
@MastersThesis{ Weber1997_da, author = {Michael Weber}, title = {{unless-Aspekte und ihr Beitrag zur Verifikation von mit Petrinetzen modellierten Systemen}}, school = {Humboldt-Universität zu Berlin}, year = 1997, type = {Diplomarbeit}, month = jan, ps = {http://www.informatik.hu-berlin.de/top/download/publications/Weber1997_da.ps} }
Theorie der Programmierung | | XHTML 1.0 | Wed Nov 5 08:30:01 2008

