Decidability of Parameterized Verification / Synthesis Lectures on Distributed Computing Theory (PDF)
(Sprache: Englisch)
While the classic model checking problem is to decide whether a finite system satisfies a specification, the goal of parameterized model checking is to decide, given finite systems ¿¿¿¿(n) parameterized by n ¿ N, whether, for all n ¿ N, the system ¿¿¿¿(n)...
sofort als Download lieferbar
eBook (pdf)
Fr. 53.50
inkl. MwSt.
- Kreditkarte, Paypal, Rechnung
- Kostenloser tolino webreader
Produktdetails
Produktinformationen zu „Decidability of Parameterized Verification / Synthesis Lectures on Distributed Computing Theory (PDF)“
While the classic model checking problem is to decide whether a finite system satisfies a specification, the goal of parameterized model checking is to decide, given finite systems ¿¿¿¿(n) parameterized by n ¿ N, whether, for all n ¿ N, the system ¿¿¿¿(n) satisfies a specification. In this book we consider the important case of ¿¿¿¿(n) being a concurrent system, where the number of replicated processes depends on the parameter n but each process is independent of n. Examples are cache coherence protocols, networks of finite-state agents, and systems that solve mutual exclusion or scheduling problems. Further examples are abstractions of systems, where the processes of the original systems actually depend on the parameter.
The literature in this area has studied a wealth of computational models based on a variety of synchronization and communication primitives, including token passing, broadcast, and guarded transitions. Often, different terminology is used in the literature, and results are based on implicit assumptions. In this book, we introduce a computational model that unites the central synchronization and communication primitives of many models, and unveils hidden assumptions from the literature. We survey existing decidability and undecidability results, and give a systematic view of the basic problems in this exciting research area.
The literature in this area has studied a wealth of computational models based on a variety of synchronization and communication primitives, including token passing, broadcast, and guarded transitions. Often, different terminology is used in the literature, and results are based on implicit assumptions. In this book, we introduce a computational model that unites the central synchronization and communication primitives of many models, and unveils hidden assumptions from the literature. We survey existing decidability and undecidability results, and give a systematic view of the basic problems in this exciting research area.
Autoren-Porträt von Roderick Bloem, Swen Jacobs, Ayrat Kalimov, Igor Konnov
Roderick Bloem is a professor at Graz University of Technology. He received an M.Sc. in computer science from Leiden University in the Netherlands (1996) and a Ph.D. from the University of Colorado at Boulder (2001). His thesis work, under the supervision of Fabio Somenzi, was on formal verification using Linear Temporal Logic. Since 2002, he has been an assistant professor at Graz University of Technology and a full profesor since 2008. His research interests are in formal methods for the design and verification of digital systems, including hardware, software, and combinations such as embedded systems. He studies applications of game theory to the automatic synthesis of systems from their specifications, connections between temporal logics and omega-automata, model checking, and automatic fault localization and repair. Swen Jacobs is a postdoc at Saarland University. He received his Ph.D. (Dr. Ing.) from Saarland University for his work on decision procedures for the verification of complex systems at the Max-Planck-Institute for Informatics. He worked at Ecole Polytechnique Federale de Lausanne (EPFL), at Technical University Graz, and has been a visiting professor at the University of Ljubljana. His current work focuses on the automated verification and synthesis of distributed systems, based on a combination of logical and game-theoretic methods. Ayrat Khalimov is a Ph.D. student at Technical University of Graz, Austria. He received his Master's degree in applied physics and Mathematics at Moscow Insitute of Physics and Technology (MIPT), with the thesis focusing on a method of calculation of current leakages in hardware circuits. Later, he joined Dependable Systems Lab at Ecole Polytechnique Federale de Lausanne (EPFL) for an internship where he researched symbolic execution techniques for software verification. His current area of research is parameterized synthesis and verification. Igor Konnov is a postdoc at the Formal Methods in Systems Engineering Group,
... mehr
Institute of Information Systems of TU Wien (Vienna University of Technology). His research interests include model checking, parameterized model checking, and verification of distributed algorithms. He received his Specialist (comparable to M.Sc.) and Ph.D. degrees in applied mathematics and computer science from Lomonosov Moscow State University. In his Ph.D. thesis, he introduced new techniques for parameterized model checking.
... weniger
Bibliographische Angaben
- Autoren: Roderick Bloem , Swen Jacobs , Ayrat Kalimov , Igor Konnov
- 2022, 1. Auflage, 158 Seiten, Englisch
- Verlag: Springer International Publishing
- ISBN-10: 3031020111
- ISBN-13: 9783031020117
- Erscheinungsdatum: 31.05.2022
Abhängig von Bildschirmgrösse und eingestellter Schriftgrösse kann die Seitenzahl auf Ihrem Lesegerät variieren.
eBook Informationen
- Dateiformat: PDF
- Grösse: 2.14 MB
- Ohne Kopierschutz
- Vorlesefunktion
Sprache:
Englisch
Kommentar zu "Decidability of Parameterized Verification / Synthesis Lectures on Distributed Computing Theory"
0 Gebrauchte Artikel zu „Decidability of Parameterized Verification / Synthesis Lectures on Distributed Computing Theory“
| Zustand | Preis | Porto | Zahlung | Verkäufer | Rating |
|---|
Schreiben Sie einen Kommentar zu "Decidability of Parameterized Verification / Synthesis Lectures on Distributed Computing Theory".
Kommentar verfassen