Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
From MaRDI portal
Publication:2996153
DOI10.1007/3-540-45653-8_4zbMath1275.68089OpenAlexW1503402770MaRDI QIDQ2996153
Publication date: 6 May 2011
Published in: Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-45653-8_4
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Temporal logic (03B44)
Related Items (3)
Local temporal logic is expressively complete for cograph dependence alphabets ⋮ Natural Specifications Yield Decidability for Distributed Synthesis of Asynchronous Systems ⋮ LTL is expressively complete for Mazurkiewicz traces
This page was built for publication: Local Temporal Logic Is Expressively Complete for Cograph Dependence Alphabets
