Javier Esparza

Jorg Desel

Petri nets are a popular and powerful formal model for the analysis and modelling of concurrent systems, and a rich theory has developed around them. Petri nets are taught to undergraduates, and also used by industrial practitioners. This book focuses on a particular class of petri nets, free choice petri nets, which play a central role in the theory. The text is very clearly organised, with every notion carefully explained and every result proved. Clear exposition is given for place invariants, siphons, traps and many other important analysis techniques. The material is organised along the lines of a course book, and each chapter contains numerous exercises, making this book ideal for graduate students and research workers alike.

Free Choice Petri Nets

Yu-Fang Chen

Chih-Hong Cheng

This book constitutes the refereed proceedings of the 17th International Symposium on Automated Technology for Verification and Analysis, ATVA 2019, held in Taipei, Taiwan in October 2019. The 24 regular papers presented together with 3 tool papers were carefully reviewed and selected from 65 submissions. The symposium is dedicated to the promotion of research on theoretical and practical aspects of automated analysis, verification and synthesis by providing a forum for interaction between the regional and the international research communities and industry in the field. The papers focus on cyber-physical systems; runtime techniques; testing; automata; synthesis; stochastic systems and model checking.

17th International Symposium, ATVA 2019, Taipei, Taiwan, October 28–31, 2019, Proceedings

Automated Technology for Verification and Analysis

Charles Lakos

This book constitutes the refereed proceedings of the 23rd International Conference on Application and Theory of Petri Nets, ICATPN 2002, held in Adelaide, Australia, in June 2002. The 18 regular papers and one tool presentation presented together with six invited paper were carefully reviewed and selected from 45 submissions. All current issues on research and development of Petri nets are addressed, in particular concurrent systems analysis, model validation, business process management, reactive systems, workflow processes, wireless transaction protocols.

23rd International Conference, ICATPN 2002, Adelaide, Australia, June 24-30, 2002. Proceedings

Application and Theory of Petri Nets 2002

Keijo Heljanko

In this book the authors introduce unfoldings, an approach to model checking which alleviates the state explosion problem by means of concurrency theory. They offer an introduction to the basics of the method and detail an unfolding-based algorithm for model checking concurrent systems against properties specified as formulas of linear temporal logic (LTL). The book will be of value to researchers and graduate students engaged in automatic verification and concurrency theory.

A Partial-Order Approach to Model Checking

Unfoldings

Petri nets are a popular and powerful model for analyzing and modeling concurrent systems, and a rich theory has developed around them. This book focuses on a particular class of Petri nets, free choice Petri nets, which plays a central role in the theory. The text is organized very clearly, with every notion carefully explained and every result proved. The authors give clear exposition of place invariants, siphons, traps and many other important analysis techniques. The book contains classical results of free-choice theory as well as more recent results. The material is organized along the lines of a course, and each chapter contains numerous exercises, making this text ideal for graduate students and research workers alike.

Pierre Fraigniaud

Thore Husfeldt

Elias Koutsoupias

This two-volume set of LNCS 8572 and LNCS 8573 constitutes the refereed proceedings of the 41st International Colloquium on Automata, Languages and Programming, ICALP 2014, held in Copenhagen, Denmark, in July 2014. The total of 136 revised full papers presented together with 4 invited talks were carefully reviewed and selected from 484 submissions. The papers are organized in three tracks focussing on Algorithms, Complexity, and Games, Logic, Semantics, Automata, and Theory of Programming, Foundations of Networked Computation.

41st International Colloquium, ICALP 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings

Automata, Languages, and Programming

Andrzej S. Murawski

This book constitutes the proceedings of the 20th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2017, which took place in Uppsala, Sweden in April 2017, held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017. The 32 papers presented in this volume were carefully reviewed and selected from 101 submissions. They were organized in topical sections named: coherence spaces and higher-order computation; algebra and coalgebra; games and automata; automata, logic and formal languages; proof theory; probability; concurrency; lambda calculus and constructive proof; and semantics and category theory.

20th International Conference, FOSSACS 2017, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2017, Uppsala, Sweden, April 22-29, 2017, Proceedings

Foundations of Software Science and Computation Structures

Bernd Spanfelner

Software-intensive systems are today an integral part of many everyday products. Whilst they provide great benefits regarding ease of use and allow for new applications, they also impose enormous responsibilities. It is vital to ensure that such applicati

Javier Esparza

About

Books

Join the club