We study the model-checking problem 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 or any formalism which can be given a causal semantics, like Petri nets. It includes least and greatest fixpoint operators and thus it can express properties of infinite computations. Since the event structure associated with a system is typically infinite (even if the system is finite state), already the decidability of model-checking is non-trivial.
Along the lines of some classical work for the modal mu-calculus, we first develop a local model-checking technique based on a tableau system, for which, over a class of event structures satisfying a suitable regularity condition, referred to as strong regularity, we prove termination, soundness and completeness. The tableau system allows for a clean and intuitive proof of decidability, but a direct implementation of the procedure can be extremely inefficient.
For easing the development of a more efficient model-checking technique, we move to an automata-theoretic framework. Given a formula and a strongly regular event structure, we show how to construct a parity tree automaton whose language is non-empty if and only if the event structure satisfies the formula. The automaton is usually infinite. We discuss how it can be quotiented to an equivalent finite automaton, where emptiness can be checked effectively. In order to show the applicability of the approach, we discuss how it instantiates to finite safe Petri nets, providing also a corresponding proof-of-concept model-checking tool.
Tue 15 JanDisplayed time zone: Belfast change
13:50 - 15:30
Algebra, Coalgebra, Model CheckingOPCT at Sala VII
Chair(s): Barbara König University of Duisburg-Essen
|Bayes meets Dijkstra: Verifying Bayes Networks by Program Verification|
Joost-Pieter Katoen RWTH Aachen UniversityFile Attached
|Model Checking True Concurrency Properties|
Paolo Baldan University of PadovaFile Attached
|A (Co)algebraic Approach to Hennessy-Milner Theorems for Weakly Expressive Logics|
Helle Hvid Hansen Delft University of TechnologyFile Attached
|Weak Bisimulation Metrics in Models with Nondeterminism and Continuous States Space: A Logical Characterization|
Simone Tini University of Insubria