Simplified coalgebraic trace equivalence
From MaRDI portal
Lua error in Module:PublicationMSCList at line 28: attempt to call field 'getDbData' (a nil value).
Lua error in Module:PublicationShowAbstract at line 21: attempt to call field 'getDbData' (a nil value).
Recommendations
Cites work
- A coalgebraic approach to linear-time logics
- A unified treatment of transfinite constructions for free algebras, free monoids, colimits, associated sheaves, and so on
- An introduction to measure theory
- Coequalizers and free triples
- Final semantics for decorated traces
- Generalizing determinization from automata to coalgebras
- Generalizing the powerset construction, coalgebraically
- Generic Trace Semantics via Coinduction
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 3754008 (Why is no real title available?)
- scientific article; zbMATH DE number 42735 (Why is no real title available?)
- scientific article; zbMATH DE number 3458870 (Why is no real title available?)
- scientific article; zbMATH DE number 3529404 (Why is no real title available?)
- scientific article; zbMATH DE number 575948 (Why is no real title available?)
- scientific article; zbMATH DE number 1497803 (Why is no real title available?)
- On the final sequence of a finitary set functor
- Reactive Systems
- Sound and complete axiomatizations of coalgebraic language equivalence
- Trace semantics via determinization
Cited in
(13)- Steps and traces
- Iterated covariant powerset is not a monad
- A coalgebraic approach to process equivalence and a coinduction principle for traces
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- A coalgebraic view on decorated traces
- Coalgebraic trace semantics via forgetful logics
- Final semantics for decorated traces
- scientific article; zbMATH DE number 1497803 (Why is no real title available?)
- The theory of traces for systems with nondeterminism, probability, and termination
- Generic trace semantics and graded monads
- Coalgebraic Infinite Traces and Kleisli Simulations
- Graded semantics and graded logics for Eilenberg-Moore coalgebras
- A coalgebraic approach to infinite games
This page was built for publication: Simplified coalgebraic trace equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5256339)