Generic trace theory

MaRDI QIDQ2863893zbMATH OpenFDO

Authors Ichiro Hasuo, Bart Jacobs, Ana Sokolova

Publication date 4 December 2013

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571066106004695?np=y

zbMATH Keywords

coalgebraKleisli categorylinear time semanticsmonadnon-determinismprobabilitytrace semantics

Mathematics Subject Classification ID

Eilenberg-Moore and Kleisli constructions for monads (18C20) Categorical semantics of formal languages (18C50) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Generic Trace Semantics via Coinduction
• Trace semantics via determinization
• Steps and traces
• Coalgebraic trace semantics for continuous probabilistic transition systems
• Steps and traces

Cited in

(16)

• (Bi)simulations up-to characterise process semantics
• Steps and traces
• Continuity as a computational effect
• Coalgebraic trace semantics for continuous probabilistic transition systems
• Trace semantics via determinization
• On coalgebras over algebras
• From coalgebraic to monoidal traces
• Coalgebraic infinite traces and Kleisli simulations
• Minimality Notions via Factorization Systems and Examples
• Convexity via Weak Distributive Laws
• The theory of traces for systems with nondeterminism, probability, and termination
• Generic trace semantics and graded monads
• On coalgebras over algebras
• On graded monads, distributive laws and costrong functors
• Machine semantics
• Probabilistic anonymity via coalgebraic simulations

This page was built for publication: Generic trace theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2863893)