Coalgebraic trace semantics via forgetful logics

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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Logical methods in computer science Ročník 12, Issue 4
Hlavní autoři:	Klin, Bartek, Rot, Jurriaan
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Logical Methods in Computer Science e.V 27.04.2017
Témata:	computer science - logic in computer science f.3.2 f.4.1
ISSN:	1860-5974, 1860-5974
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	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.
ISSN:	1860-5974 1860-5974
DOI:	10.2168/LMCS-12(4:10)2016