Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

CORR
2011
Springer

favoriteEmaildiscussreport

222views Education» more CORR 2011»

Generic Trace Logics

12 years 11 months ago

Generic Trace Logics

Download www.christiankissig.de

Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general deﬁnition for coalgebras which are structured in a branching type in addition to the transition type, and generalise non-deterministic and probabilistic state based transition structures. In this work we propose a class of coalgebraic logics which adequately and expressively characterise ﬁnite trace semantics and have a compositional semantics. We obtain generic trace logics from a dual adjunction on the Eilenberg-Moore category of the monad embodying the branching type.

Christian Kissig, Alexander Kurz

Real-time Traffic

Branching Type | CORR 2011 | Education | Non-deterministic Labelled Transition | Trace Semantics |

claim paper

Related Content

» Generic Infinite Traces and PathBased Coalgebraic Temporal Logics

» CLPGUI A Generic Graphical User Interface for Constraint Logic Programming

» Reflecting Proofs in FirstOrder Logic with Equality

» A semantics of sequence diagrams

» Weighted Logics for Traces

» Generic Trace Theory

» Traces A Cut at the Make Isnt Generic Problem

» Automating Security Analysis Symbolic Equivalence of Constraint Systems

» TraceContract A Scala DSL for Trace Analysis

Post Info
More Details (n/a)

Added	13 May 2011
Updated	13 May 2011
Type	Journal
Year	2011
Where	CORR
Authors	Christian Kissig, Alexander Kurz

Comments (0)