union jack
Publikationen
HU-Logo
Institut für Informatik

Publikationen des Jahres 2003

Dissertationen und Habilitationen

  • Axel Martens. Verteilte Geschäftsprozesse - Modellierung und Verifikation mit Hilfe von Web Services. Dissertation, Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, 2003. Note: Erschienen in WiKi: Stuttgart, Berlin & Paris. icon 

    @PhDThesis{ Martens2003_diss,
author = {Axel Martens},
title = {{Verteilte Geschäftsprozesse - Modellierung und Verifikation mit Hilfe von Web Services}},
school = {Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II},
year = 2003,
type = {Dissertation},
note = {erschienen in WiKi: Stuttgart, Berlin \& Paris},
url = {http://www.wiku-verlagsprogramm.de/5230/23807.html},
keywords = {Geschäftsprozesse} 
}

Publikationen in Zeitschriften und Büchern

  • Axel Martens. On Compatibility of Web Services. Petri Net Newsletter, 65: 12-20, 2003. icon 

    @Article{ Martens2003_pnn65,
author = {Axel Martens},
title = {{On Compatibility of Web Services}},
journal = {Petri Net Newsletter},
year = 2003,
volume = 65,
pages = {12-20},
editor = {Gabriel Juhás and Ekkart Kindler},
pdf = {http://www.informatik.hu-berlin.de/top/download/publications/Martens2003_pnn65.pdf},
keywords = {Geschäftsprozesse} 
}

  • Wolfgang Reisig. On Gurevich's Theorem on Sequential Algorithms. Acta Informatica, 39(5): 273-305, 2003. icon 

    @Article{ Reisig2003_ai395,
author = {Wolfgang Reisig},
title = {{On Gurevich's Theorem on Sequential Algorithms}},
journal = {Acta Informatica},
year = 2003,
volume = 39,
number = 5,
pages = {273-305},
publisher = {Springer-Verlag},
pdf = {http://www.informatik.hu-berlin.de/top/download/publications/Reisig2003_ai395.pdf},
keywords = {ASM},
abstract = {Abstract-State Machines have been introduced as ?a computation model that is more powerful and more universal than standard computation models?, by Yuri Gurevich in 1985 ([Gur85]). ASM gained much attention as a specification method, in particular for the description of the semantics of programming languages, communication protocols, distributed algorithms, etc. Gurevich proved recently that a sequential algorithm must only meet a few, liberal requirements, to be representable as an ASM. We re-formulate Gurevich?s requirements for sequential algorithms, as well as the semantics of ASM-programs and the proof of his main theorem. A couple of examples support and explain intuition and motivation of ASM.} 
}

  • Wolfgang Reisig. The Expressive Power of Abstract State Machines. Computing and Informatics, 22(3): 209-219, 2003. 

    @Article{ Reisig2003_ci223,
author = {Wolfgang Reisig},
title = {{The Expressive Power of Abstract State Machines}},
journal = {Computing and Informatics},
year = 2003,
volume = 22,
number = 3,
pages = {209-219},
keywords = {ASM},
abstract = {Conventional computation models assume symbolic representations of states and actions. Gurevich's "Abstract-State Machine" model takes a more liberal position: Any mathematical structure may serve as a state. This results in "a computational model that is more powerful and more universal than standard computation models". We characterize the Abstract-State Machine model as a special class of transition systems that widely extends the class of "computable" transition systems. This characterization is based on a fundamental Theorem of Y. Gurevich.} 
}

  • Karsten Schmidt. Distributed Verification with LoLA. Fundamenta Informaticae, 54(2-3): 253-262, 2003. icon 

    @Article{ Schmidt2003_fi54,
author = {Karsten Schmidt},
title = {{Distributed Verification with LoLA}},
journal = {Fundamenta Informaticae},
year = 2003,
volume = 54,
number = {2-3},
pages = {253-262},
url = {http://iospress.metapress.com/openurl.asp?genre=article{\&}issn=0169-2968{\&}volume=54{\&}issue=2{\&}spage=253},
keywords = {LoLA},
abstract = {We report work in progress on a distributed version of explicit state space generation in the Petri net verification tool LoLA. We propose a data structure where all available memory of all involved workstations can be fully exploited, and load balancing actions are possible at any time while the verification is running. It is even possible to extend the set of involved workstations while a verification is running.} 
}

Konferenzbeiträge und Beiträge auf Workshops

  • Adrianna Alexander and Wolfgang Reisig. Logic of Involved Variables - System Specification with Temporal Logic of Distributed Actions. In Proc. of the 3rd International Conference on Application of Concurrency to System Design (ACSD'03), Guimaraes, Portugal, pages 167-176, June 2003. IEEE Computer Society. icon icon 

    @InProceedings{ AlexanderR2003_acsd,
author = {Adrianna Alexander and Wolfgang Reisig},
title = {{Logic of Involved Variables - System Specification with Temporal Logic of Distributed Actions}},
booktitle = {{Proc. of the 3rd International Conference on Application of Concurrency to System Design (ACSD'03), Guimaraes, Portugal }},
year = 2003,
pages = {167-176},
month = jun,
publisher = {IEEE Computer Society},
ps = {http://www.informatik.hu-berlin.de/top/download/publications/AlexanderR2003_acsd.ps},
url = {http://doi.ieeecomputersociety.org/10.1109/CSD.2003.1207711},
keywords = {TLDA, Temporale Logik},
abstract = {The Temporal Logic of Distributed Actions (TLDA) is a new temporal logic designed for the specification and verification of distributed systems. TLDA can be syntactically viewed as a slight extension of TLA. We propose a different semantical model based on partial order which evidently increases the expressiveness of the logic. Local variable updates in a system are explicitly modeled and expressed by TLDA formulas. Consequently, we can distinguish between concurrency and nondeterministic choice. All valuable features of TLA (composition is conjunction, implementation is implication) are retained. In addition, we are able to describe some important phenomena and properties typical for distributed systems.} 
}

  • Axel Martens. Compatibility of Web Services. In 10th Workshop on Algorithms and Tools for Petri Nets (AWPN 2003), Eichstätt, Germany, pages 26.-27, September 2003. icon 

    @InProceedings{ Martens2003_awpn,
author = {Axel Martens},
title = {{Compatibility of Web Services}},
booktitle = {{10th Workshop on Algorithms and Tools for Petri Nets (AWPN 2003), Eichstätt, Germany}},
year = 2003,
pages = {26.-27},
month = sep,
pdf = {http://www.informatik.hu-berlin.de/top/download/publications/Martens2003_pnn65.pdf},
keywords = {Geschäftsprozesse},
abstract = {To an increasing extend business processes run across the borders of individual enterprises. Thus, there is a need to map each local subprocess into a self-contained component; a distributed business process arises from composition of such component via standardized communication protocols. The Web service approach provides a standardized, platform independent and widely accepted concept of components and composition for distributed systems of all kinds. This approach comes along together with group of technologies to describe precisely the structure of one Web service and the composition of a set of Web services. Although the technological basement is given, there is a lot of open questions, e. g. semantic compatibility of two Web services. This paper abstracts from concrete syntax of any proposed language definition. Instead, we apply Petri nets to model Web services. Thus, we are able to reason about essential properties, e. g. usability of a Web service - our notion of a quality criterion. Based on this framework, we discuss and define a criterion for semantic compatibility of Web services.} 
}

  • Axel Martens. On Usability of Web Services. In Coral Calero, Oscar Díaz, and Mario Piattini, editors, Proceedings of 1st Web Services Quality Workshop (WQW 2003), Rome, Italy, 2003. icon 

    @InProceedings{ Martens2003_wqw,
author = {Axel Martens},
title = {{On Usability of Web Services}},
editor = {Coral Calero and Oscar Díaz and Mario Piattini},
booktitle = {{Proceedings of 1st Web Services Quality Workshop (WQW 2003)}},
year = 2003,
address = {Rome, Italy},
pdf = {http://www.informatik.hu-berlin.de/top/download/publications/Martens2003_wqw.pdf},
keywords = {Geschäftsprozesse},
abstract = {This paper is concerned with the application of Web services to distributed, cross-organizational business processes. Web services provide a platform independent concept of components and composition. Thus, they seem to be a proper technology to cover the heterogenous structures within distributed business processes: One Web service realizes a local subprocess. A distributed business process is realized by the composition of a set of Web services. Although the technological basement is given, there is a lot of open questions: Do two Web services fit together in a way, that the composition yields a deadlock-free system? - the question of compatibility. Can one Web service be exchanged by another within a composed system without running into problems? - the question of equivalence. Can we reason about the quality of one given Web service without considering the environment it will by used in? In this paper we present the notion of usability - our quality criterion of a Web service. This criterion is intuitive and can be easily proven locally. Moreover, this notion allows to answer the other questions mentioned above. The approach and the results presented in this paper are taken from a larger framework for modeling and analyzing business processes by help of Web services published in my PhD thesis [9].} 
}

  • Wolfgang Reisig. The Computable Kernel of ASM. In Egon Börger, Angelo Gargantini, and Elvinia Riccobene, editors, Abstract State Machines, Advances in Theory and Practice, 10th International Workshop, ASM 2003, Taormina, Italy, volume 2589 of Lecture Notes in Computer Science, pages 421-422, 2003. icon 

    @InProceedings{ Reisig2003_lncs2589,
author = {Wolfgang Reisig},
title = {{The Computable Kernel of ASM}},
editor = {Egon Börger and Angelo Gargantini and Elvinia Riccobene},
booktitle = {{Abstract State Machines, Advances in Theory and Practice, 10th International Workshop, ASM 2003, Taormina, Italy}},
year = 2003,
series = {Lecture Notes in Computer Science},
volume = 2589,
pages = {421-422},
url = {http://link.springer.de/link/service/series/0558/bibs/2589/25890421.htm},
keywords = {ASM},
abstract = {A rich variety of system models for sequential, deterministic systems has been suggested during recent decades, including automata, process algebras, many versions of Petri Nets, and models to describe the semantics of Programming languages. All models for sequential, deterministic systems assume a set S of states, or configurations, and a next state function $\upsilon: S \rightarrow S$.} 
}

  • Karsten Schmidt. Using Petri Net Invariants in State Space Construction. In Hubert Garavel and John Hatcliff, editors, Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2003), 9th International Conference, Part of ETAPS 2003, volume 2619 of Lecture Notes in Computer Science, Warsaw, Poland, 2003. icon 

    @InProceedings{ Schmidt2003_lncs2619,
author = {Karsten Schmidt},
title = {{Using Petri Net Invariants in State Space Construction}},
editor = {Hubert Garavel and John Hatcliff},
booktitle = {{Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2003), 9th International Conference, Part of ETAPS 2003}},
year = 2003,
series = {Lecture Notes in Computer Science},
volume = 2619,
address = {Warsaw, Poland},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2619&spage=473},
abstract = {The linear algebraic invariant calculus is a powerful technique for the verification of Petri nets. Traditionally it is used for structural verification, i.e. for avoiding the explicit construction of a state space. In this paper, we study the use of Petri net invariants for reducing the memory resources required during state space construction. While place invariants help to reduce the amount of memory needed for each single state (without reducing the number of states as such), transition invariants can be used to reduce the number of states to be stored. Interestingly, our approach does not require computing invariants in full, let alone storing them permanently. All information we need can be deduced from an upper triangular form of the Petri net's incidence matrix. Experiments prove that the place invariant technique leads to improvements in both memory and run time costs while transition invariants lead to a space/time tradeoff that can be controlled heuristically.} 
}

  • Herbert Weber, Hartmut Ehrig, Wolfgang Reisig, Alexander Borusan, Sabine Lembke, Juliane Dehnert, Michael Weber, Axel Martens, Julia Padberg, Claudia Ermel, and A. Qemali. The Petri Net Baukasten of the DFG Forschergruppe PETRI NET TECHNOLOGY. In Hartmut Ehrig, Wolfgang Reisig, Grzegorz Rozenberg, and Herbert Weber, editors, Petri Net Technology for Communication-Based Systems, volume 2472 of Lecture Notes in Computer Science, pages 1-21, 2003. Springer-Verlag. icon 

    @InProceedings{ WeberERBLDWMPEQ2003_lncs2472,
author = {Herbert Weber and Hartmut Ehrig and Wolfgang Reisig and Alexander Borusan and Sabine Lembke and Juliane Dehnert and Michael Weber and Axel Martens and Julia Padberg and Claudia Ermel and A. Qemali},
title = {{The Petri Net Baukasten of the DFG Forschergruppe PETRI NET TECHNOLOGY}},
editor = {Hartmut Ehrig and Wolfgang Reisig and Grzegorz Rozenberg and Herbert Weber},
booktitle = {{Petri Net Technology for Communication-Based Systems}},
year = 2003,
series = {Lecture Notes in Computer Science},
volume = 2472,
pages = {1-21},
publisher = {Springer-Verlag},
url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2472&spage=1},
abstract = {In the long history of Petri nets a universe of Petri nets has evolved consisting of an enormously rich theory, a wide variety of tools, and numerous successful applications and case studies in various application domains. This vast variety is not any more handable for anyone working with Petri nets, which results in the strong need of a structured access to Petri nets. This structured access has been the main aim of the DFG-Forschergruppe PETRI NET TECHNOLOGY, which has developed the so-called Petri Net Baukasten for this purpose. It is designed to support Petri net experts, application developers and tool developers alike in their specific work with Petri nets. This paper presents an overview of the concepts, initial and 2nd installment of the Petri Net Baukasten, which have been presented at the 1st and 2nd International Colloquium on Petri Net Technologies for Modelling Communication Based Systems in 1999 and 2001, respectively.} 
}

  • Michael Weber and Ekkart Kindler. The Petri Net Kernel. In Hartmut Ehrig, Wolfgang Reisig, Grzegorz Rozenberg, and Herbert Weber, editors, Petri Net Technology for Communication-Based Systems, volume 2472 of Lecture Notes in Computer Science, pages 109-124, 2003. Springer-Verlag. icon 

    @InProceedings{ WeberK2003_lncs2472_2,
author = {Michael Weber and Ekkart Kindler},
title = {{The Petri Net Kernel}},
editor = {Hartmut Ehrig and Wolfgang Reisig and Grzegorz Rozenberg and Herbert Weber},
booktitle = {{Petri Net Technology for Communication-Based Systems}},
year = 2003,
series = {Lecture Notes in Computer Science},
volume = 2472,
pages = {109-124},
publisher = {Springer-Verlag},
url = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2472{\&}spage=109},
keywords = {Petri Net Kernel},
abstract = {The Petri Net Kernel (PNK) is an infrastructure for building Petri net tools. It relieves the programmer of a Petri net tool of implementing standard functionality on Petri nets. Moreover, it allows users to customize and to extend a PNK based tool according to their needs. In this paper, we discuss the goals, the concepts, and the realization of the Petri Net Kernel.} 
}

  • Michael Weber and Ekkart Kindler. The Petri Net Markup Language. In Hartmut Ehrig, Wolfgang Reisig, Grzegorz Rozenberg, and Herbert Weber, editors, Petri Net Technology for Communication-Based Systems, volume 2472 of Lecture Notes in Computer Science, pages 124-144, 2003. Springer-Verlag. icon 

    @InProceedings{ WeberK2003_lncs2472_1,
author = {Michael Weber and Ekkart Kindler},
title = {{The Petri Net Markup Language}},
editor = {Hartmut Ehrig and Wolfgang Reisig and Grzegorz Rozenberg and Herbert Weber},
booktitle = {{Petri Net Technology for Communication-Based Systems}},
year = 2003,
series = {Lecture Notes in Computer Science},
volume = 2472,
pages = {124-144},
publisher = {Springer-Verlag},
url = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=2472{\&}spage=124},
abstract = {The Petri Net Markup Language (PNML) is an XML-based interchange format for Petri nets. PNML supports any version of Petri net since new Petri net types can be defined by so-called Petri Net Type Definitions (PNTD). In this paper, we present the syntax and the semantics of PNML as well as the principles underlying its design. Moreover, we present an extension called modular PNML, which is a type independent module concept for Petri nets.} 
}

Studien- und Diplomarbeiten

  • Andreas Glausch. Abstract-State Machines - Eine Sammlung didaktischer Beispiele. Studienarbeit, Humboldt-Universität zu Berlin, February 2003. icon 

    @MastersThesis{ Glausch2003_sa,
author = {Andreas Glausch},
title = {{Abstract-State Machines - Eine Sammlung didaktischer Beispiele}},
school = {Humboldt-Universität zu Berlin},
year = 2003,
type = {Studienarbeit},
month = feb,
pdf = {http://www.informatik.hu-berlin.de/top/download/publications/Glausch2003_sa.pdf},
keywords = {ASM},
abstract = {Diese Studienarbeit versucht durch eine Vielzahl von Beispielen den Begriff Abstract-State Machine und sequenzieller Algorithmus didaktisch sinnvoll darzustellen. Es werden dabei sowohl Beispiele als auch Gegenbeispiele angegeben, um Umfang und Grenzen dieser Begriffe aufzuzeigen.} 
}

  • Dirk Hain and Christian Stahl. Komposition von Web Services. Studienarbeit, Humboldt-Universität zu Berlin, April 2003. icon 

    @MastersThesis{ HainS2003_sa,
author = {Dirk Hain and Christian Stahl},
title = {{Komposition von Web Services}},
school = {Humboldt-Universität zu Berlin},
year = 2003,
type = {Studienarbeit},
month = apr,
pdf = {http://www.informatik.hu-berlin.de/top/download/publications/HainS2003_sa.pdf},
keywords = {Geschäftsprozesse},
abstract = {Verteilte Systeme haben in den letzten Jahren in der Informatik immer mehr an Bedeutung gewonnen. Die Web-Service-Architektur ist eine Software-Architektur zur Modellierung und Implementierung verteilter Systeme. Sie ist als eine der zukunftsträchtigsten Technologien angesehen, die aber noch in der Erprobungsphase steckt. Unter anderem ist die Kompatibilität von Web Services eine offene Frage, wobei weniger syntaktische als vielmehr sematischen Kompatibilität problematisch ist. Diese Arbeit soll Ansätze zur Bestimmung semantischer Kompatibilität von Web Services liefern.} 
}

  • Thomas Heidinger. Statische Analyse von BPEL4WS-Prozessmodellen. Studienarbeit, Humboldt-Universität zu Berlin, December 2003. icon 

    @MastersThesis{ Heidinger2003_sa,
author = {Thomas Heidinger},
title = {{Statische Analyse von BPEL4WS-Prozessmodellen}},
school = {Humboldt-Universität zu Berlin},
year = 2003,
type = {Studienarbeit},
month = dec,
pdf = {http://www.informatik.hu-berlin.de/top/download/publications/Heidinger2003_sa.pdf},
keywords = {BPEL, Geschäftsprozesse} 
}

  • Peter Massuthe. Parallele Komposition in TLA. Studienarbeit, Humboldt-Universität zu Berlin, September 2003. icon 

    @MastersThesis{ Massuthe2003_sa,
author = {Peter Massuthe},
title = {{Parallele Komposition in TLA}},
school = {Humboldt-Universität zu Berlin},
year = 2003,
type = {Studienarbeit},
month = sep,
ps = {http://www.informatik.hu-berlin.de/top/download/publications/Massuthe2003_sa.ps},
keywords = {Temporale Logik},
abstract = {TLA ist eine temporale Logik zur Spezifikation verteilter Systeme. Aufgrund der Stotterinvarianz von TLA-Formeln erlaubt sie eine einfache parallele Komposition von Systemen. In dieser Studienarbeit werden unterschiedliche Arten der parallelen Komposition in TLA betrachtet und hierüber ein systematischer Überblick gegeben. Es wird eine Klassifikation der parallelen Komposition in TLA entwickelt und für jede Klasse ein Kompositionsschema angegeben. Dies ermöglicht eine automatische Komposition und erleichtert die Analyse.} 
}

  • Lars Münzberg. Komposition von Web Services. Studienarbeit, Humboldt-Universität zu Berlin, June 2003. icon 

    @MastersThesis{ Muenzberg2003_sa,
author = {Lars Münzberg},
title = {{Komposition von Web Services}},
school = {Humboldt-Universität zu Berlin},
year = 2003,
type = {Studienarbeit},
month = jun,
pdf = {http://www.informatik.hu-berlin.de/top/download/publications/Muenzberg2003_sa.pdf},
keywords = {Geschäftsprozesse},
abstract = {Verteilte Systeme haben im letzten Jahrzehnt stetig an Bedeutung gewonnen, so sind sie aus dem täglichen Leben nicht mehr weg zu denken. Ein Beispiel hierfür ist das Bezahlen mit der EC-Karte oder die Buchbestellung über das Internet. Die Web-Service-Softwarearchitektur soll die Grundlage einer neuen zukunftsträchtigen Generation verteilter Systeme bilden. Momentan befindet sich die Technologie aber noch in der Entwicklungsphase, unter anderem ist die Komponierbarkeit von Web Services eine offene Frage. In dieser Arbeit soll ein Ansatz zur Entscheidung der als problematisch geltenden semantischen Kompatibilität entworfen werden.} 
}

  • Daniela Weinberg. Graphische Repräsentation von BPEL. Studienarbeit, Humboldt-Universität zu Berlin, August 2003. icon 

    @MastersThesis{ Weinberg2003_sa,
author = {Daniela Weinberg},
title = {{Graphische Repräsentation von BPEL}},
school = {Humboldt-Universität zu Berlin},
year = 2003,
type = {Studienarbeit},
month = aug,
pdf = {http://www.informatik.hu-berlin.de/top/download/publications/Weinberg2003_sa.pdf},
keywords = {BPEL, Geschäftsprozesse} 
}

Sonstiges

  • Lars Michael Kristensen, Karsten Schmidt, and Antii Valmari. Question Guided Stubborn Set Methods for State Properties, 2003. Note: Submitted to a journal. 

    @Misc{ KristensenSV2003__qgssmsp,
author = {Lars Michael Kristensen and Karsten Schmidt and Antii Valmari},
title = {{Question Guided Stubborn Set Methods for State Properties}},
year = 2003,
note = {submitted to a journal} 
}

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

Theorie der Programmierung | Kontakt | XHTML 1.0 | Fri Sep 11 16:30:32 2009