Partial Semigroups and Convolution Algebras

Partial Semigroups are relevant to the foundations of quantum mechanics and combinatorics as well as to interval and separation logics. Convolution algebras can be understood either as algebras of generalised binary modalities over ternary Kripke frames, in particular over partial semigroups, or as algebras of quantale-valued functions which are equipped with a convolution-style operation of multiplication that is parametrised by a ternary relation. Convolution algebras provide algebraic semantics for various substructural logics, including categorial, relevance and linear logics, for separation logic and for interval logics; they cover quantitative and qualitative applications. These mathematical components for partial semigroups and convolution algebras provide uniform foundations from which models of computation based on relations, program traces or pomsets, and verification components for separation or interval temporal logics can be built with little effort.

[1]  Ben C. Moszkowski,et al.  A complete axiomatization of interval temporal logic with infinite time , 2000, Proceedings Fifteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.99CB36332).

[2]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[3]  Yde Venema,et al.  A Modal Logic for Chopping Intervals , 1991, J. Log. Comput..

[4]  Georg Struth,et al.  A Program Construction and Verification Tool for Separation Logic , 2015, MPC.

[5]  Georg Struth,et al.  Convolution as a Unifying Concept , 2016, ACM Trans. Comput. Log..

[6]  Zhou Chaochen,et al.  Duration Calculus: A Formal Approach to Real-Time Systems , 2004 .

[7]  Georg Struth,et al.  Relational Convolution, Generalised Modalities and Incidence Algebras , 2017, ArXiv.

[8]  Georg Struth,et al.  Hybrid process algebra , 2005, J. Log. Algebraic Methods Program..