Reference : A Graphical Proof Theory of Logical Time
Scientific congresses, symposiums and conference proceedings : Paper published in a book
Engineering, computing & technology : Computer science
Security, Reliability and Trust
http://hdl.handle.net/10993/53956
A Graphical Proof Theory of Logical Time
English
Acclavio, Matteo mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
Horne, Ross James mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
Mauw, Sjouke mailto [University of Luxembourg > Faculty of Science, Technology and Medicine (FSTM) > Department of Computer Science (DCS) >]
Straßburger, Lutz [Inria-Saclay, Palaiseau, France]
2022
Proc. 7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)
Felty, Amy P.
Schloss Dagstuhl -- Leibniz-Zentrum fur Informatik
Leibniz International Proceedings in Informatics
22:1-22:25
Yes
No
International
978-3-95977-233-4
Germany
7th International Conference on Formal Structures for Computation and Deduction (FSCD 2022)
August 2-5, 2022
Haifa
Israel
[en] 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.
Researchers
http://hdl.handle.net/10993/53956
10.4230/LIPIcs.FSCD.2022.22
https://drops.dagstuhl.de/opus/volltexte/2022/16303

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Open access
LIPIcs-FSCD-2022-22.pdfPublisher postprint1.06 MBView/Open

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.