A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Local Model Checking in a Logic for True Concurrency
[chapter]
2017
Lecture Notes in Computer Science
We provide a model-checking technique for a logic for true concurrency, whose formulae predicate about events in computations and their causal dependencies. The logic, that represents the logical counterpart of history-preserving bisimilarity, is naturally interpreted over event structures. It includes minimal and maximal fixpoint operators and thus it can express properties of infinite computations. Global algorithms are not convenient in this setting, since the event structure associated with
doi:10.1007/978-3-662-54458-7_24
fatcat:3wf3mlxqmrewxjp5wk6dpw4mjy