union jack
Publikationen
Institut für Informatik

Publikationen des Jahres 2001

Bücher und Konferenzbände

  • Hartmut Ehrig, Wolfgang Reisig, and Herbert Weber, editors. 2nd International Colloquium on Petri Net Technologies for Modelling Communication Based Systems, Tagungsband: Berlin, 14./15. September 2001, 2001. Fraunhofer Gesellschaft ISST. icon 

    @Proceedings{ EhrigRW2001_pntmcbs,
title = {{2nd International Colloquium on Petri Net Technologies for Modelling Communication Based Systems, Tagungsband: Berlin, 14./15. September 2001}},
year = 2001,
editor = {Hartmut Ehrig and Wolfgang Reisig and Herbert Weber},
publisher = {Fraunhofer Gesellschaft ISST},
url = {http://www.cis.cs.tu-berlin.de/~dehnert/Coll/coll.html} 
}

Dissertationen und Habilitationen

  • Ekkart Kindler. Systematische Spezifikation und Verifikation von Konsistenzprotokollen. Habilitationsschrift, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, August 2001. icon 

    @PhDThesis{ Kindler2001_habil,
author = {Ekkart Kindler},
title = {{Systematische Spezifikation und Verifikation von Konsistenzprotokollen}},
school = {Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II},
year = 2001,
type = {Habilitationsschrift},
month = aug,
ps = {http://www.informatik.hu-berlin.de/top/download/publications/Kindler2001_habil.ps} 


}

  • Sibylle Peuker. Halbordnungsbasierte Verfeinerung zur Verifikation verteilter Algorithmen. Dissertation, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, July 2001. icon icon 

    @PhDThesis{ Peuker2001_diss,
author = {Sibylle Peuker},
title = {{Halbordnungsbasierte Verfeinerung zur Verifikation verteilter Algorithmen}},
school = {Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II},
year = 2001,
type = {Dissertation},
month = jul,
pdf = {http://edoc.hu-berlin.de/dissertationen/peuker-sibylle-2001-07-03/PDF/Peuker.pdf},
url = {http://dochost.rz.hu-berlin.de/dissertationen/peuker-sibylle-2001-07-03},
abstract = {In dieser Arbeit geht es um die schrittweise Verfeinerung verteilter Algorithmen. Dabei wird ein einfacher Algorithmus, der einige gewünschte Eigenschaften hat, Schritt für Schritt zu einem komplexen Algorithmus verfeinert, der konkrete Implementationsanforderungen erfüllt, so daß in jedem Schritt die gewünschten Eigenschaften erhalten bleiben. Wir stellen einen neuen eigenschaftserhaltenden Verfeinerungsbegriff vor, der auf der kausalen Ordnung der Aktionen eines Algorithmus basiert. Diesen Begriff definieren wir als Transitionsverfeinerung für elementare Petrinetze und diskutieren Beweiskriterien. Danach definieren und diskutieren wir die simultane Verfeinerung mehrerer Transitionen. Zur Modellierung komplexer verteilter Algorithmen sind elementare Petrinetze oft nicht adäquat. Wir benutzen deshalb algebraische Petrinetze. Wir definieren Transitionsverfeinerung für algebraische Petrinetze und stellen einen Zusammenhang zur simultanen Verfeinerung von Transitionen in elementaren Petrinetzen her. Transitionsverfeinerung ist besonders für Verfeinerungsschritte geeignet, in denen synchrone Kommunikation zwischen Agenten durch asynchronen Nachrichtenaustausch ersetzt wird. Wir zeigen dies am Beispiel eines komplexen verteilten Algorithmus, zur Berechnung des minimalen spannenden Baumes in einem gewichteten Graphen. Wir zeigen die Korrektheit dieses Algorithmus in mehreren Schritten, von denen einige Schritte Transitionsverfeinerungen sind. In anderen Schritten sind klassische Verfeinerungsbegriffe ausreichend. Wir übertragen deshalb auch einen klassischen Verfeinerungsbegriff in unser formales Modell.} 
}

Publikationen in Zeitschriften und Büchern

  • Ekkart Kindler and Michael Weber. Modules in Pictures. Petri Net Newsletter, 61:5-8, October 2001. icon 

    @Article{ KindlerW2001_pnn61,
author = {Ekkart Kindler and Michael Weber},
title = {{Modules in Pictures}},
journal = {Petri Net Newsletter},
year = 2001,
volume = 61,
pages = {5-8},
month = oct,
pdf = {http://wwwcs.uni-paderborn.de/cs/kindler/Publikationen/copies/pnnl61.pdf} 


}

  • Ekkart Kindler and Michael Weber. The Petri Net Kernel - An Infrastructure for Building Petri Net Tools. International Journal on Software Tools for Technology Transfer (STTT), 3(4):486-497, September 2001. icon 

    @Article{ KindlerW2001_sttt,
author = {Ekkart Kindler and Michael Weber},
title = {{The Petri Net Kernel - An Infrastructure for Building Petri Net Tools}},
journal = {International Journal on Software Tools for Technology Transfer (STTT)},
year = 2001,
volume = 3,
number = 4,
pages = {486-497},
month = sep,
url = {http://www.springerlink.com/openurl.asp?genre=article&eissn=1433-2787&volume=3&issue=4&spage=486},
keywords = {Petri Net Kernel},
abstract = {The Petri Net Kernel is an infrastructure for building Petri net tools. It relieves the programmer of a Petri net tool from implementing standard operations on Petri nets and a graphical user interface. In this paper, we discuss the motivation, the concepts, and the implementation of the Petri Net Kernel.} 
}

  • Karsten Schmidt. Narrowing Petri Net State Spaces Using the State Equation. Fundamenta Informaticae, 47(3-4):325-335, October 2001. icon 

    @Article{ Schmidt2001_fi47,
author = {Karsten Schmidt},
title = {{Narrowing Petri Net State Spaces Using the State Equation}},
journal = {Fundamenta Informaticae},
year = 2001,
volume = 47,
number = {3-4},
pages = {325-335},
month = oct,
url = {http://iospress.metapress.com/openurl.asp?genre=article&issn=0169-2968&volume=47&issue=3&spage=325},
abstract = {Given a (possibly partially defined) state, all count vectors of transition sequences reaching that state are solutions to a corresponding Petri net state equation. We propose a search strategy where sequences corresponding to a minimal solution of the state equation are explored first. Then step by step the search space is relaxed to arbitrary count vectors. This heuristics relies on the observation that in many (though provably not in all) cases, minimal solutions of the state equation can be realized as a firing sequence. If no target state is reachable, either the state equation does not have solutions, or our search method would yield the full state space. We study the impact of the state equation on reachability, present an algorithm that exploits information from the state equation and discuss its application in stateless search as well as its combination with stubborn set reduction.} 
}

Konferenzbeiträge und Beiträge auf Workshops

  • Claudia Ermel and Michael Weber. Implementation of Parameterized Net Classes with the Petri Net Kernel of the Petri Net Baukasten. In Hartmut Ehrig, Gabriel Juhas, Julia Padberg, and Grzegorz Rozenberg, editors, Unifying Petri Nets, Advances in Petri Nets, volume 2128 of Lecture Notes in Computer Science, pages 79-102, 2001. Springer-Verlag. icon 

    @InProceedings{ ErmelW2001_lncs2128,
author = {Claudia Ermel and Michael Weber},
title = {{Implementation of Parameterized Net Classes with the Petri Net Kernel of the Petri Net Baukasten}},
editor = {Hartmut Ehrig and Gabriel Juhas and Julia Padberg and Grzegorz Rozenberg},
booktitle = {{Unifying Petri Nets, Advances in Petri Nets}},
year = 2001,
series = {Lecture Notes in Computer Science},
volume = 2128,
pages = {79-102},
publisher = {Springer-Verlag},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2128&spage=79},
keywords = {Petri Net Kernel},
abstract = {We show in this paper how the formalism of Parameterized Net Classes is realized with the Petri Net Kernel. Parameterized Net Classes are an notion of Petri nets using formal parameters to express Petri net type characteristics. This formalism allows the abstract formulation of formal concepts for a large variety of Petri net types. The Petri Net Kernel is a tool infrastructure supporting an easy implementation of Petri net algorithms. Moreover, the Petri Net Kernel is not restricted to a fixed Petri net type. Instead, only the net type has to be implemented as ?net type specification?. It is then used as basis for implemented application algorithms. In our paper we describe an implementation of the formal net type parameters via an interface such that the parameter implementation can be transformed to a net type specification for the Petri Net Kernel. This allows on the one hand a simple change of the net type by selecting a different combination of the actual net type parameters. On the other hand, applications (like simulation or analysis algorithms) can be developed generically, i.e. independently of the Petri net type, thus supporting rapid prototyping for Petri net tools. The implementation is embedded in the development of the Petri Net Baukasten and is therefore closely related to the contributions [3, 8, 24] in this volume.} 
}

  • Ekkart Kindler and Michael Weber. A universal module Concept for Petri nets. In Gabriel Juhas und Robert Lorenz, editor, Proceedings des 8. Workshops AWPN, pages 7-12, October 2001. Katholische Universität Eichstätt. icon 

    @InProceedings{ KindlerW2001_awpn,
author = {Ekkart Kindler and Michael Weber},
title = {{A universal module Concept for Petri nets}},
editor = {Gabriel Juhas und Robert Lorenz},
booktitle = {{Proceedings des 8. Workshops AWPN}},
year = 2001,
pages = {7-12},
month = oct,
publisher = {Katholische Universität Eichstätt},
url = {http://citeseer.ist.psu.edu/491790.html} 
}

  • Axel Martens. Modeling Workflow in Virtual Enterprises. In Herbert Weber, Hartmut Ehrig, and Wolfgang Reisig, editors, Proc. of 2nd Int. Coll. on Petri Net Technologies for Modelling Communication Based Systems, pages 157-162, 2001. DFG Research Group Petri Net Technology. icon 

    @InProceedings{ Martens2001_pntmcbs,
author = {Axel Martens},
title = {{Modeling Workflow in Virtual Enterprises}},
editor = {Herbert Weber and Hartmut Ehrig and Wolfgang Reisig},
booktitle = {{Proc. of 2nd Int. Coll. on Petri Net Technologies for Modelling Communication Based Systems}},
year = 2001,
pages = {157-162},
publisher = {DFG Research Group Petri Net Technology},
ps = {http://www.informatik.hu-berlin.de/top/download/publications/Martens2001_pntmcbs.ps} 


}

  • Sibylle Peuker. Property Preserving Transition Refinement with Concurrent Runs: An Example. In 2nd International Conference on Application of Concurrency to System Design (ACSD 2001), pages 77-86, 2001. IEEE Computer Society. icon 

    @InProceedings{ Peuker2001_acsd,
author = {Sibylle Peuker},
title = {{Property Preserving Transition Refinement with Concurrent Runs: An Example}},
booktitle = {{2nd International Conference on Application of Concurrency to System Design (ACSD 2001)}},
year = 2001,
pages = {77-86},
publisher = {IEEE Computer Society},
url = {http://csdl.computer.org/comp/proceedings/acsd/2001/1071/00/10710077abs.htm} 


}

  • Wolfgang Reisig. Modelling of learning process, using methodology of System Petri Nets. In Tagungsband der International Scientific Conference MANAGEMENT INFORMATION SYSTEMS, Tibilisi, June 2001. 

    @InProceedings{ Reisig2001_mis,
author = {Wolfgang Reisig},
title = {{Modelling of learning process, using methodology of System Petri Nets}},
booktitle = {{Tagungsband der International Scientific Conference MANAGEMENT INFORMATION SYSTEMS}},
year = 2001,
address = {Tibilisi},
month = jun 
}

  • Karsten Schmidt. Using invariants for state space reduction. In Workshop on Concurrency, Specification and Programming, Warsaw, 2001. 

    @InProceedings{ Schmidt2001_wcsp,
author = {Karsten Schmidt},
title = {{Using invariants for state space reduction}},
booktitle = {{Workshop on Concurrency, Specification and Programming}},
year = 2001,
address = {Warsaw} 
}

  • Michael Weber. Die Petrinetz-Schaltregel in 4 Phasen - Zusammenfassung. In Gabriel Juhás and Robert Lorenz, editors, 8. Workshop Algorithmen und Werkzeuge für Petrinetze, October 2001. Katholische Universität Eichstätt. icon 

    @InProceedings{ Weber2001_awpn,
author = {Michael Weber},
title = {{Die Petrinetz-Schaltregel in 4 Phasen - Zusammenfassung}},
editor = {Gabriel Juhás and Robert Lorenz},
booktitle = {{8. Workshop Algorithmen und Werkzeuge für Petrinetze}},
year = 2001,
month = oct,
publisher = {Katholische Universität Eichstätt},
ps = {http://www.informatik.hu-berlin.de/~mweber/Postscript/vierPhasenRegel.ps} 


}

  • Michael Weber. The new Petri Net Kernel. In Tool Demonstrations, 22nd ICATPN, Newcastle upon Tyne, U.K., June 2001. 

    @InProceedings{ Weber2001_icatpn,
author = {Michael Weber},
title = {{The new Petri Net Kernel}},
booktitle = {{Tool Demonstrations, 22nd ICATPN}},
year = 2001,
address = {Newcastle upon Tyne, U.K.},
month = jun,
keywords = {Petri Net Kernel} 
}

  • Michael Weber. Tool Support for Various Types of Petri Nets. In Herberg Weber, Hartmut Ehrig, and Wolfgang Reisig, editors, Proc. of 2nd Int. Coll. on Petri Net Technologies for Modelling Communication Based Systems, pages 171-178, September 2001. DFG Research Group Petri Net Technology. 

    @InProceedings{ Weber2001_pntmcbs,
author = {Michael Weber},
title = {{Tool Support for Various Types of Petri Nets}},
editor = {Herberg Weber and Hartmut Ehrig and Wolfgang Reisig},
booktitle = {{Proc. of 2nd Int. Coll. on Petri Net Technologies for Modelling Communication Based Systems}},
year = 2001,
pages = {171-178},
month = sep,
publisher = {DFG Research Group Petri Net Technology} 
}

Technische Berichte

  • Ekkard Kindler and Michael Weber. A Universal Module Concept for Petri Nets - An Implementation-Oriented Approach. Informatik-Berichte 150, Humboldt-Universität zu Berlin, April 2001. icon 

    @TechReport{ KindlerW2001_hub_tr150,
author = {Ekkard Kindler and Michael Weber},
title = {{A Universal Module Concept for Petri Nets - An Implementation-Oriented Approach}},
institution = {Humboldt-Universität zu Berlin},
year = 2001,
type = {Informatik-Berichte},
number = 150,
month = apr,
ps = {http://www.informatik.hu-berlin.de/top/download/publications/KindlerW2001_hub_tr150.ps} 


}

Studien- und Diplomarbeiten

  • Wolf Richter. Syntaktische Erkennung von Modellierungsfehlern in Web Services. Studienarbeit, Humboldt-Universität zu Berlin, December 2001. icon 

    @MastersThesis{ Richter2001_sa,
author = {Wolf Richter},
title = {{Syntaktische Erkennung von Modellierungsfehlern in Web Services}},
school = {Humboldt-Universität zu Berlin},
year = 2001,
type = {Studienarbeit},
month = dec,
ps = {http://www.informatik.hu-berlin.de/top/download/publications/Richter2001_sa.ps},
keywords = {Geschäftsprozesse} 
}

zurück zur Übersicht zurück zur Übersicht

Theorie der Programmierung | Kontakt | XHTML 1.0 | Wed Nov 5 08:30:01 2008