Buch, Englisch, 422 Seiten, Previously published in hardcover, Format (B × H): 156 mm x 234 mm, Gewicht: 640 g
Calculi an Automata for Modelling Untimed and Timed Concurrent Systems
Buch, Englisch, 422 Seiten, Previously published in hardcover, Format (B × H): 156 mm x 234 mm, Gewicht: 640 g
ISBN: 978-1-84996-951-2
Verlag: Springer
The field of concurrency theory is becoming increasingly important, with the problem of formally verifying concurrent distributed systems a critical consideration and a major topic for the software industries. This book, with its extensive applications of the techniques involved in the field of concurrency theory, is the first to adopt this new approach.
Zielgruppe
Research
Autoren/Hrsg.
Fachgebiete
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Programmierung: Methoden und Allgemeines
- Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Software Engineering Objektorientierte Softwareentwicklung
- Mathematik | Informatik EDV | Informatik Informatik Mathematik für Informatiker
- Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
Weitere Infos & Material
Background on Concurrency Theory.- Concurrency Theory — Untimed Models.- Process Calculi: LOTOS.- Basic Interleaved Semantic Models.- True Concurrency Models: Event Structures.- Testing Theory and the Linear Time — Branching Time Spectrum.- Concurrency Theory — Further Untimed Notations.- Beyond pbLOTOS.- Comparison of LOTOS with CCS and CSP.- Communicating Automata.- Concurrency Theory — Timed Models.- Timed Process Calculi, a LOTOS Perspective.- Semantic Models for tLOTOS.- Timed Communicating Automata.- Timelocks in Timed Automata.- Discrete Timed Automata.
