The author presents a theory whereby nets, terms and formulas represent concurrent process at three levels of abstractions: Petri nets are used to describe all details of the operational machine behavior of processes. Algebraic process terms such as Calculus of Communicating Systems (CCS) or Communicating Sequential Processes (CSP) two of the main models for parallel programming, are used to describe the architecture of processes, i.e. how they can be composed from subprocesses. Logical formulas of a first-order trace logic are used to describe the safety and liveness aspects of the communication behavior of processes as required by their users. The main emphasis and technical contribution of this theory are transformations for a top-down design of concurrent processes starting with formulas and proceeding through terms to nets.

This book constitutes the proceedings of the 36th International Conference on Application and Theory of Petri Nets and Concurrency, PETRI NETS 2015, held in Brussels, Belgium, in June 2015. The 12 regular papers and 2 tool papers presented in this volume were carefully reviewed and selected from 34 submissions. In addition the book contains 3 invited talks in full paper length. The papers cover various topics in the field of Petri nets and related models of concurrency.

This book is dedicated to Professor Ernst--Rüdiger Olderog on the occasion of his 60th birthday. This volume is a reflection on Professor Olderog's contributions to the scientific community. It provides a sample of research ideas that have been influenced directly by Ernst-Rüdiger Olderog's work. After a laudatio section that provides a brief overview of Ernst-Rüdiger Olderog's research, the book is comprised of five parts with scientific papers written by colleagues and collaborators of Professor Olderog. The papers address semantics, process algebras, logics for verification, program analysis, and synthesis approaches.

Paradigms of Concurrency: Observations, Behaviours, and Systems - a Petri Net View - Ryszard Janicki (McMaster University, CA) Jetty Kleijn (Leiden University, NL) Maciej Koutny (Newcastle University, UK) Lukasz Mikulski (Nicolaus Copernicus University, PL) Concurrency can be studied at different yet consistent levels of abstraction: from individual behavioural observations via more abstract concurrent histories that can be represented by causality structures capturing invariant dependencies between executed actions, to system level constructs such as Petri nets or process algebra expressions. Histories can then be understood as sets of closely related observations. Depending on the nature of the observed relationships between executed actions involved in a single concurrent history, one may identify different concurrency paradigms underpinned by different kinds of causality structures such as partial orders. This book studies fundamental mathematical abstractions to capture and relate observations, histories, and systems. In particular, taking a Petri net view, we present system models fitting various concurrency paradigms and their associated causality structures.

Process Algebra is a formal description technique for complex computer systems, especially those involving communicating, concurrently executing components. It is a subject that concurrently touches many topic areas of computer science and discrete math, including system design notations, logic, concurrency theory, specification and verification, operational semantics, algorithms, complexity theory, and, of course, algebra.This Handbook documents the fate of process algebra since its inception in the late 1970's to the present. It is intended to serve as a reference source for researchers, students, and system designers and engineers interested in either the theory of process algebra or in learning what process algebra brings to the table as a formal system description and verification technique. The Handbook is divided into six parts spanning a total of 19 self-contained Chapters. The organization is as follows. Part 1, consisting of four chapters, covers a broad swath of the basic theory of process algebra. Part 2 contains two chapters devoted to the sub-specialization of process algebra known as finite-state processes, while the three chapters of Part 3 look at infinite-state processes, value-passing processes and mobile processes in particular. Part 4, also three chapters in length, explores several extensions to process algebra including real-time, probability and priority. The four chapters of Part 5 examine non-interleaving process algebras, while Part 6's three chapters address process-algebra tools and applications.

This volume contains the proceedings of the 14th International Conference onApplication and Theory of Petri Nets. The aim of the Petri net conferences is to create a forum for discussing progress in the application and theory of Petri nets. Typically, the conferences have 150-200 participants, one third of whom come from industry, while the rest are from universities and research institutes. The volume includes three invited papers, "Modeling and enactment of workflow systems" (C.A. Ellis, G.J. Nutt), "Interleaving functional and performance structural analysis of net models" (M. Silva), and "FSPNs: fluid stochastic Petri nets" (K.S. Trivedi, V.G. Kulkarni), together with 26 full papers (selected from 102 submissions) and 6 project papers.