|
Showing 1 - 12 of
12 matches in All Departments
The 11th volume of ToPNoC contains revised and extended versions of
a selection of the best workshop papers presented at the 36th
International Conference on Application and Theory of Petri Nets
and Concurrency, Petri Nets 2015, and the 15th International
Conference on Application of Concurrency to System Design, ACSD
2014. It also contains one paper submitted directly to ToPNoC. The
16 papers cover a diverse range of topics including model checking
and system verification, refinement and synthesis; foundational
work on specific classes of Petri nets; and innovative applications
of Petri nets and other models of concurrency. Application areas
covered in this volume are: security, service composition,
communication protocols, business processes, distributed systems,
and multi-agent systems. Thus, this volume gives a good overview of
ongoing research on concurrent systems and Petri nets.
This book constitutes the refereed proceedings of the 34th
International Conference on Applications and Theory of Petri Nets
and Concurrency, PETRI NETS 2013, held in Milan, Italy, in June
2013. The 18 regular papers and 2 tool papers presented were
carefully reviewed and selected from 56 submissions. The book also
contains 2 invited talks. All current issues on research and
development in the area of Petri nets and related models of
concurrent systems are addressed.
This volume is a documentation of the main results in the research
area "In- gration of Software Speci?cation Techniques for
Applications in Engineering." On one hand it is based on the
Priority Program "Integration von Techniken der
Softwarespezi?kation fur ] ingenieurwissenschaftliche Anwendungen,"
short Soft- Spez, oftheGermanResearchCouncil(DFG).
Ontheotherhanditcontainsnew contributions of international experts
in this research area, some of which were presented at the third
international workshop INT 2004 on "Integration of Sp- i?cation
Techniques for Applications in Engineering." INT 2004 was launched
as a satellite event of ETAPS in Barcelona, the "European Joint
Conferences on Theory and Practice of Software." The Priority
Program SoftSpez was initiated by W. Brauer, M. Broy, H. Ehrig, H.
J. Kreowski, H. Reichel, and H. Weber concerning di?erent aspects
from computer science, and by E. Schnieder and E. Westk] amper
concerning two main application areas in engineering, namely "Tra?c
Control Systems" and "Production Automation." After acceptance of
SoftSpez by the German Research Council for the period of 1998-2004
a call for speci?c projects within this priority program was
launched, where 11 projects from about 75 project proposals were
accepted for a period of two years. Since 1998 each year the main
research proposals and results of the projects have been presented
at an annual colloquium of the priority program, and every two
years the projects have been evaluated by an independent group of
referees appointed by the G- man Research Council. At this point we
would like to thank A."
The very ?rst model of concurrent and distributed systems was
introduced by C.A. Petri in his seminal Ph.D. thesis in 1964. Petri
nets has remained a central model for concurrentsystemsfor40
years,andthey areoften usedasa yardstick for other models of
concurrency. As a matter of fact, many other models have been
developed since then, and this research area is ?ourishing today.
The goal of the 4th Advanced Course on Petri Nets held in Eichsta
..tt, Germany in September 2003 was to present applications and the
theory of Petri Nets in the context of a whole range of other
models. We believe that in this way the participants of the course
received a broad and in-depth picture of research in concurrent and
distributed systems. It is also the goal of this volume to convey
this picture. The volume is based on lectures given at the Advanced
Course, but in order to provide a balanced p- sentation of the
?eld, some of the lectures are not included, and some material not
presented in Eichst. att is covered here. In particular, a series
of introductory lectures was not included in this volume, as the
material they covered is well - tablishedby
now,andwellpresentedelsewhere (e.g.,inW. ReisigandG. Roz- berg,
eds., "Lectures on Petri Nets," LNCS 1491, 1492, Springer-Verlag,
1997 - these two volumes are based on the 3rd Advanced Course on
Petri Nets).
|
Business Process Management - Second International Conference, BPM 2004, Potsdam, Germany, June 17-18, 2004, Proceedings (Paperback, 2004 ed.)
Joerg Desel, Barbara Pernici, Mathias Weske
|
R1,675
Discovery Miles 16 750
|
Ships in 10 - 15 working days
|
In recent years the management of business processes has emerged as
one of the major developments to ease the understanding of,
communication about, and evolution of process-oriented information
systems in a variety of appli- tion domains. Based on explicit
representations of business processes, process stakeholders can
communicate about process structure, content, and possible
improvements. Formal analysis, veri?cation and simulation
techniques have the potential to show de?cits and to e?ectively
lead to better and more ?exible processes. Process mining
facilitates the discovery of process speci?cations from process
logs that are readily available in many organizations. This volume
of Springer's Lecture Notes in Computer Science contains the papers
presented at the 2nd International Conference on Business Process
M- agement (BPM 2004) which took place in Potsdam, Germany, in June
2004. From more than 70 submissions BPM 2004 received, 19
high-quality research papers were selected. BPM 2004 is part of a
conference series that provides a forum for researchers and
practitioners in all aspects of business process management. In
June 2003, the 1st International Conference on Business Process
Management took place in Eindhoven, The Netherlands. Its
proceedings were published as Volume 2678 of Lecture Notes in
Computer Science by Springer-Verlag. A previous volume
(LNCS1806)onBusinessProcessManagementwasbasedonfoureventsdevoted to
this topic.
Business processes are among today's hottest topics in the science and practice of information systems. Business processes and workflow management systems attract a lot of attention from R&D professionals in software engineering, information systems, business-oriented computer science, and management sciences.The carefully reviewed chapters contributed to this state-of-the-art survey by internationally leading scientists consolidate work presented at various workshops on the topic organized by the editors of the book in the past few years. The book spans the whole spectrum of business process management ranging from theoretical aspects, conceptual models, and application scenarios to implementation issues. It will become a valuable source of reference and information for R&D professionals active in the fascinating interdisciplinary area of business process management and for ambitious practitioners.
This volume contains the proceedings of the 19th annual
International Conference on Application and Theory of Petri Nets.
The aim of the Petri net conference is to create a forum for the
dissemination of the latest results in the application and theory
of Petri nets. It always takes place in the last week of June.
Typically there are 150 - 200 participants. About one third of
these come from industry while the rest are from universities and
research institutions. The conferences and a number of other
activities are coordinated by a steering committee with the
following members: G. Balbo (Italy), J. Billington (Australia), G.
DeMichelis(Italy),C. Girault(France),K. Jensen (Denmark), S.
Kumagai (Japan), T. Murata (USA), C. A. Petri (Germany; honorary
member), W. Reisig (Germany), G. Roucairol (France), G. Rozenberg
(The Netherlands; chairman), M. Silva (Spain). The 19th conference
has been organized for the rst time in Portugal, by the Department
of Electrical Engineering of the Faculty of Sciences and Technology
of the New University of Lisbon, together with the Center for
Intelligent Robotics of UNINOVA. It takes place in Lisbon at the
same time as EXPO'98, the last world exhibition of the 20th
century.
This book is the proceedings of the Structures in Concurrency
Theory workshop (STRICT) that was held from 11 th to l3th May 1995
in Berlin, Germany. It includes three invited contributions - by J.
de Bakker, E. Best et aI, and E. R. Olderog and M. Schenke - and
all papers which were submitted and accepted for presentation.
Concurrency Theory deals with formal aspects of concurrent systems.
It uses partly competing and partly complementary formalisms and
structures. The aim of this workshop was to present and compare
different formalisms and results in Concurrency Theory. STRICT was
organized by the Humboldt-University Berlin and the ESPRIT Basic
Research Working Group CALIBAN. Original papers had been sought
from all scientists in the field of Concurrency Theory. The
Programme Committee selected twenty contributions with various
different topics, including Petri Nets, Process Algebras,
Distributed Algorithms, Formal Semantics, and others. I am grateful
to the Programme Committee and to the other referees for the
careful evaluation of the submitted papers.
These Transactions publish archival papers in the broad area of
Petri nets and other models of concurrency, ranging from
theoretical work to tool support and industrial applications.
ToPNoC issues are published as LNCS volumes, and hence are widely
distributed and indexed. This Journal has its own Editorial Board
which selects papers based on a rigorous two-stage refereeing
process. ToPNoC contains: - Revised versions of a selection of the
best papers from workshops and tutorials at the annual Petri net
conferences- Special sections/issues within particular subareas
(similar to those published in the Advances in Petri Nets series)-
Other papers invited for publication in ToPNoC- Papers submitted
directly to ToPNoC by their authors The 10th volume of ToPNoC
contains revised and extended versions of a selection of the best
workshop papers presented at the 35th International Conference on
Application and Theory of Petri Nets and Concurrency, Petri Nets
2014, and the 14th International Conference on Application of
Concurrency to System Design, ACSD 2014. It also contains one paper
submitted directly to ToPNoC.The 8 papers cover a diverse range of
topics including model checking and system verification,
refinement, and synthesis; foundational work on specific classes of
Petri nets; and innovative applications of Petri nets and other
models of concurrency.
Bei der Entwicklung von Software- und Informationssystemen werden
verschiedene Aspekte von Struktur und Verhalten eines Systems
modelliert. Dazu stehen unterschiedliche Modellierungssprachen zur
Verfugung. Das Fachgebiet Modellierung befasst sich mit derartigen
Modellen sowie mit ihren Beziehungen untereinander und auch mit dem
Prozess der Modellerstellung. Der Workshop Modellierung wird 1999
zum zweiten Mal von sieben Fachgruppen der Gesellschaft fur
Informatik veranstaltet. Dieser Tagungsband enthalt 11
Fachbeitrage, die reprasentativ fur die verschiedenen Aspekte des
Themas Modellierung stehen. Zusatzlich sind Diskussionsbeitrage zu
drei sehr aktuellen Fragestellungen im Zusammenhang mit
Modellierung enthalten."
Der Titel dieser Arbeit ist bereits ei ne kurze Inhaltsangabe. Es
geht darum, die Matrixreprasentation von Petrinetzen in Gleichungs-
und Ungleichungs- systemen auszunutzen, urn Aussagen uber das
Verhalten eines Netzmodells gewinnen oder beweisen zu koennen. Die
Motivation fur die Verwendung linear-algebraischer Verfahren liegt
in der Komplexitat des Verhaltens von Petrinetzen. So explodiert
die Anzahl erreich- barer Markierungen eines markierten Petrinetzes
sowohl mit wachsender GroeBe des Netzes als auch mit wachsender
Zahl anfangs verteilter Marken. Eine di- rekte Aufzahlung aller
erreichbarer Markierungen ist deshalb praktisch nicht moeglich. Mit
Hilfe von Gleichungs- und Ungleichungssystemen lassen sich aber
haufig wenigstens hinreichende oder notwendige Bedingungen fur
dynamische Eigenschaften ei nes markierten Netzes formulieren; ei
ne linear-algebraische Analyse erlaubt so, Informationen uber das
Verhalten eines markierten Netzes zu gewinnen. Zur UEberprufung der
Gultigkeit derartiger linear-algebraischer Bedingungen existieren
effiziente Algorithmen. Ihre Komplexitat hangt we- sentlich davon
ab, ob rationale, ganzzahlige oder naturlichzahlige Loesungen
gesucht werden. Oftmals gibt es einen Trade-off: Alle Loesungen
haben ei ne Bedeutung, aber die effizienteren Algorithmen haben ei
ne geringere Aussage- kraft als die komplexeren. Optimierte
Routinen fur Matrixoperationen koennen mit proprietaren
Analyseverfahren fur Petrinetze kombiniert werden. Das Thema dieser
Arbeit ist annahernd so alt wie Petrinetze selbst. Schon Mitte der
siebziger Jahre wurden erste einschlagige Arbeiten veroeffentlicht.
Leider verwenden Autoren seitdem immer wieder neue Notationen, so
daB ein einheitliches Bild des State-of-the-art nur schwer zu
bekommen ist. Auch be- ziehen sich viele Veroeffentlichungen auf
eingeschrankte Netzklassen.
Die statische Struktur eines markierten Petrinetzes ist durch das
Netz selbst und die anfangliche Verteilung der Marken gegeben. Sein
Verhalten wird durch die Menge seiner Ablaufe oder durch seinen
Erreichbarkeitsgraphen beschrie ben. Struktur und Verhalten hiingen
eng zusammenj so lassen sich dynamische Systemeigenschaften oft mit
Hilfe struktureller Methoden wie Deadlocks oder S-Invarianten
beweisen. Fur die Analyse eines markierten Petrinetzes auf
dynamische Eigenschaften reichen strukturelle Methoden dagegen
meist nicht aus. So sind die meisten dynamischen Eigenschaften -wie
z.B. die Erreich-., barkeit einer gegebenen Markierung - zwar
entscheidbar, doch haben diese Entscheidungsprobleme sehr groBe
untere Komplexitatsschranken, die wenig stens dem
Konstruktionsaufwand des Erreichbarkeitsgraphen entsprechen. Eine
effiziente Analyse basiert notwendigerweise auf der Struktur eines
mar kierten Netzes. Sie ist also nur fur Netze moglich, deren
relevante dynamische Eigenschaften durch strukturelle Eigenschaften
charakterisiert werden. Fur Free-Choice-Petrindze wurde Anfang der
70er Jahren von Fred Commoner (damals ein Student am MIT) eine
entsprechende Charakterisierung der dyna mischen Eigenschaft
Lebendigkeit angegeben: ein Free-Choice-Netz ist genau dann
lebendig, wenn jeder Deadlock einen markierten Trap enthiilt.
Leider ermoglicht dieses Ergebnis aber keine effiziente
Lebendigkeitsanalyse, denn das Nicht-Lebendigkeitsproblem fur
Free-Choice-Netze wurde als NP-vollstandig nachgewiesen."
|
You may like...
Not available
Loot
Nadine Gordimer
Paperback
(2)
R398
R330
Discovery Miles 3 300
|