A graphical proof theory of logical time

Acclavio, Matteo and Horne, Ross and Mauw, Sjouke and Straßburger, Lutz; Felty, Amy P., ed. (2022) A graphical proof theory of logical time. In: 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, ISR, 22:1-22:25. ISBN 9783959772334 (https://doi.org/10.4230/LIPIcs.FSCD.2022.22)

[thumbnail of Acclavio-etal-FSCD-2022-A-graphical-proof-theory-of-logical-time]
Preview
 Text. Filename: Acclavio_etal_FSCD_2022_A_graphical_proof_theory_of_logical_time.pdf
Final Published Version
License: Creative Commons Attribution 4.0 logo
Download (924kB)| Preview

Abstract

Logical time is a partial order over events in distributed systems, constraining which events precede others. Special interest has been given to series-parallel orders since they correspond to formulas constructed via the two operations for "series" and "parallel" composition. For this reason, series-parallel orders have received attention from proof theory, leading to pomset logic, the logic BV, and their extensions. However, logical time does not always form a series-parallel order; indeed, ubiquitous structures in distributed systems are beyond current proof theoretic methods. In this paper, we explore how this restriction can be lifted. We design new logics that work directly on graphs instead of formulas, we develop their proof theory, and we show that our logics are conservative extensions of the logic BV.

CORE (COnnecting REpositories)