The 15th volume of ToPNoC contains revised and extended versions of a selection of the best workshop and tutorial papers presented at the 40th International Conference on Application and Theory of Petri Nets and Concurrency, Petri Nets 2019, and the 19th International Conference on Application of Concurrency to System Design, ACSD 2019. The 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: process mining, verification, formal semantics, communication protocols, business processes, distributed systems, and net synthesis. Thus, this volume gives a good overview of ongoing research on concurrent systems and Petri nets.
Maciej Koutny Livres




The 8th volume of ToPNoC contains revised and extended versions of a selection of the best workshop papers presented at the 33rd International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (Petri Nets 2012).
This book constitutes the thoroughly refereed proceedings of the 23rd International Conference on Concurrency Theory, CONCUR 2012, held in Newcastle upon Tyne, UK, September 4-7, 2012. The 35 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 97 submissions. The papers are organized in topics such as reachability analysis; qualitative and timed systems; behavioural equivalences; temporal logics; session types; abstraction; mobility and space in process algebras; stochastic systems; probabilistic systems; Petri nets and non-sequential semantics; verification; decidability.
Petri net algebra
- 378pages
- 14 heures de lecture
In modern society, computer-based systems have become essential, fundamentally changing how people conduct business. Among the various technologies available, concurrent systems play a crucial role due to the prevalence of concurrent phenomena in applications like control systems, computer networks, digital hardware, business computing, and multimedia systems. These systems exhibit increasing complexity as numerous active components interact. This complexity has been recognized and addressed within the computing science community, leading to the development of several formal models for concurrent systems. This work brings together two widely used formalisms for describing and analyzing these systems: Petri nets and process algebras. Process algebras enable the specification and reasoning about complex concurrent computing system designs using algebraic operators that reflect common programming constructs. In contrast, Petri nets offer a graphical representation of these systems, facilitating efficient verification of correctness and expressing properties related to causality and concurrency in system behavior. This integration of methodologies provides a comprehensive framework for understanding and managing the intricacies of concurrent systems in computing.