Handbook of logic in computer science (vol. 4)
Modal and temporal properties of processes
Modal and temporal properties of processes
Separation Logic: A Logic for Shared Mutable Data Structures
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Event Structure Semantics for CCS and Related Languages
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Model-Checking for a Subclass of Event Structures
TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Model-checking Trace Event Structures
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Logics and Bisimulation Games for Concurrency, Causality and Conflict
FOSSACS '09 Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Model-checking games for fixpoint logics with partial order models
Information and Computation
Concurrent logic games on partial orders
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
| Hi-index | 0.00 |
We introduce model-checking games that allow local second-order power on sets of independent transitions in the underlying partial order models where the games are played. Since the one-step interleaving semantics of such models is not considered, some problems that may arise when using interleaving semantics are avoided and new decidability results for partial orders are achieved. The games are shown to be sound and complete , and therefore determined. While in the interleaving case they coincide with the local model-checking games for the μ -calculus (Lμ ), in a noninterleaving setting they verify properties of Separation Fixpoint Logic (SFL), a logic that can specify in partial orders properties not expressible with Lμ . The games underpin a novel decision procedure for model-checking all temporal properties of a class of infinite and regular event structures, thus improving previous results in the literature.