Klin, Bartek and Rot, Jurriaan - Coalgebraic trace semantics via forgetful logics

lmcs:2622 - Logical Methods in Computer Science, December 28, 2016, Volume 12, Issue 4
Coalgebraic trace semantics via forgetful logics

Authors: Klin, Bartek and Rot, Jurriaan

We use modal logic as a framework for coalgebraic trace semantics, and show the flexibility of the approach with concrete examples such as the language semantics of weighted, alternating and tree automata, and the trace semantics of generative probabilistic systems. We provide a sufficient condition under which a logical semantics coincides with the trace semantics obtained via a given determinization construction. Finally, we consider a condition that guarantees the existence of a canonical determinization procedure that is correct with respect to a given logical semantics. That procedure is closely related to Brzozowski's minimization algorithm.


Source : oai:arXiv.org:1611.05183
DOI : 10.2168/LMCS-12(4:10)2016
Volume: Volume 12, Issue 4
Published on: December 28, 2016
Submitted on: December 28, 2016
Keywords: Computer Science - Logic in Computer Science,F.3.2,F.4.1


Share

Browsing statistics

This page has been seen 95 times.
This article's PDF has been downloaded 64 times.