Eike Best – författare

This unique text, based on introductory as well as on advanced courses on distributed systems, will serve as an invaluable guide for students and (future) researchers interested in theoretical—as well as in practical—aspects of Petri nets and related system models.

This unique text, based on introductory as well as on advanced courses on distributed systems, will serve as an invaluable guide for students and (future) researchers interested in theoretical—as well as in practical—aspects of Petri nets and related system models.

This book constitutes the proceedings of the 38th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2017, held in Zaragoza, Spain, in June 2017.

Ich mochte mit zwei Behauptungen beginnen: Die formale Semantik gehOrt zu den wichtigen Themen der Informatik. Ein wichtiges Thema der Informatik ist die formale Semantik. Anhand dieser beiden Behauptungen mochte ich Ihnen, lieber Leser, den Gegenstand dieses Buches erkIaren: man sagt, daB die beiden Satze unterschiedliche Syntax, aber gleiche Semantik haben. Unter der Syntax eines Satzes versteht man seinen auBeren Aufbau, zum Beispiel als Folge Subjekt­ Pradikat-Objekt. Vom rein satzbautechnischen Standpunkt aus besteht etwa zwischen den beiden Satzen: Die formale Semantik ist ein Thema der Informatik. Das neue Buch begleitet eine Vorlesung des Studiengangs. 1 kein wesentlicher Unterschied. Der Inhalt, die Bedeutung oder eben die Semantik eines Satzes umfaBt die Bedeutung der Worter, aus denen er besteht. Sie ist jedoch mehr als nur deren Summe. In der Tat gehen zeitliche (z.B.: formal bedeutet heutzutage etwas anderes als vor 1000 Jahren), kontextuelle (z.B.: die Phrase Das neue Buch ist nur aus dem textuellen Zusammenhang heraus zu verstehen) und andere Aspekte, eventuell auch subjektive, in die Semantik eines Satzes ein. Die 'untersuchbare' Bedeutung ist daher stets eine Abstraktion vieler verschiedener Facetten ihrer Gesamtheit. Bei sehr genauer Untersuchung zeigen sich sogar zwischen den beiden Satzen zu Beginn dieser Uberlegungen unterschiedliche semantische Nuancen. Der erste legt starker als der zweite die Idee nahe, daB es eine wohldefinierte Menge von wichtigen Themen der Informatik gibt. Nur wenn Von diesem Unterschied abstrahiert wird, sind die Bedeutungen der beiden Satze gleich.

The refereed proceedings of the 24th International Conference on Applications and Theory of Petri Nets, ICATPN 2003, held in Eindhoven, The Netherlands, in June 2003. The 25 revised full papers presented together with 6 invited contributions were carefully reviewed and selected from 77 submissions. All current issues on research and development in the area of Petri nets are addressed, in particular concurrent systems design and analysis, model checking, networking, business process modeling, formal methods in software engineering, agent systems, systems specification, systems validation, discrete event systems, protocols, and prototyping.

This volume contains the proceedings of CONCUR '93, thefourth in an annual series of conferences devoted to thestudy of concurrency. The basic aim of the CONCURconferences is to communicate advances in concurrency theoryand applications. The volume contains 31 papers selected from 113submissions,together with four invited papers and two abstracts ofinvited talks. The invited talks are: "The lambda-calculuswith multiplicities" (extended abstract) by G rard Boudol,"A pi-calculus semantics for an object-based designnotation" by Cliff B. Jones, "Partial-order methods fortemporal verification" by Pierre Wolper and PatriceGodefroid, "Non-interleaving process algebra" by Jos C. M. Baetenand Jan A. Bergstra, "Loop parallelization in thepolytope model" by Christian Lengauer, and "Structuredoperational semantics for process algebras and equationalaxiom systems" (abstract) by Bard Bloom.

This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from Process Algebra and Petri Nets, two prominent branches of concurrency theory. Added synergistic benefit is derived from combining their respective advantages. Petri nets are treated as composable objects, and as such they are embedded in a general process algebra. On the other hand, a generic process algebra is given an automatic Petri net semantics so that net-based verification techniques, based on structural invariants and causal partial orders, can be applied to the process algebra. The book contains full proofs, carefully chosen examples and several possible directions for further research. A unique aspect is that the development of the Petri net algebra is handled so as to allow for further application-oriented extensions and modifications.

This book presents a step-by-step development of a rigorous framework for the specification and verification of concurrent systems. Petri Net Algebra takes its inspiration and methods from Process Algebra and Petri Nets, two prominent branches of concurrency theory. Added synergistic benefit is derived from combining their respective advantages.Petri nets are treated as composable objects, and as such they are embedded in a general process algebra. On the other hand, a generic process algebra is given an automatic Petri net semantics so that net-based verification techniques, based on structural invariants and causal partial orders, can be applied to the process algebra.The book contains full proofs, carefully chosen examples and several possible directions for further research. A unique aspect is that the development of the Petri net algebra is handled so as to allow for further application-oriented extensions and modifications.