Name
Abstract | ||
|---|---|---|
These lecture notes cover basic automata-theoretic concepts and logical formalisms for the modeling and verification of concurrent and distributed systems. Many of these concepts naturally extend the classical automata and logics over words, which provide a framework for modeling sequential systems. A distributed system, on the other hand, combines several (finite or recursive) processes, and will therefore be modeled as a collection of (finite or pushdown, respectively) automata. A crucial parameter of a distributed system is the kind of interaction that is allowed between processes. In this lecture, we focus on the message-passing paradigm. In general, communication in a distributed system creates complex dependencies between events, which are hidden when using a sequential, operational semantics. The approach taken here is based on a faithful preservation of the dependencies of concurrent events. That is, an execution of a system is modeled as a partial order, or graph, rather than a sequence of events. |
Year | Venue | DocType |
|---|---|---|
2019 | arXiv: Logic in Computer Science | Journal |
Volume | Citations | PageRank |
abs/1904.06942 | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Benedikt Bollig | 1 | 427 | 35.02 |
| Paul Gastin | 2 | 1165 | 75.66 |