Petri Nets
Springer Verlag, Singapore
978-981-19-6308-7 (ISBN)
Dr. Guanjun Liu received his Ph.D. in Computer Software and Theory from Tongji University, China, in 2011. He was Post-Doctoral Research Fellow with the Singapore University of Technology and Design from 2011 to 2013 and Post-Doctoral Research Fellow with the Humboldt University of Berlin, Germany, from 2013 to 2014 (supported by the Alexander von Humboldt Foundation). He is currently Professor at the Department of Computer Science, Tongji University, China. He has authored over 120 articles and three monographs (two in Chinese and one in English). His research interests include Petri net theory, model checking, machine learning, information security, credit card fraud detection, real-time concurrent systems, and multi-agent systems.
Chapter 1 Elementary Net Systems.- Chapter 2 Structural Characteristics of Petri Nets.- Chapter 3 Petri Nets with Special Structures.- Chapter 4 Petri Nets Modeling Massage Passing and Resource.- Chapter 5 Verifying Computation Tree Logic Based on Petri Nets.- Chapter 6 Knowledge-oriented Petri Nets and Computation Tree Logic of Knowledge.- Chapter 7 Petri Nets with Insecure Places and Secure Bisimulation.- Chapter 8 Time Petri Nets and Time-soundness.- Chapter 9 Timed Computation Tree Logic and Plain Time Petri Nets with Priorities.
“This book focuses on the basic theory of Petri nets as well as the Petri-nets-based model-checking methods. … Each Chapter ends with a set of references. … The book is meant for beginners as well as senior researchers.” (T. C. Mohan, zbMATH 1512.68001, 2023)
Erscheinungsdatum | 09.11.2022 |
---|---|
Zusatzinfo | 9 Illustrations, color; 63 Illustrations, black and white; XI, 279 p. 72 illus., 9 illus. in color. |
Verlagsort | Singapore |
Sprache | englisch |
Maße | 155 x 235 mm |
Themenwelt | Mathematik / Informatik ► Informatik ► Software Entwicklung |
Mathematik / Informatik ► Informatik ► Theorie / Studium | |
Mathematik / Informatik ► Mathematik ► Angewandte Mathematik | |
ISBN-10 | 981-19-6308-8 / 9811963088 |
ISBN-13 | 978-981-19-6308-7 / 9789811963087 |
Zustand | Neuware |
Haben Sie eine Frage zum Produkt? |
aus dem Bereich