Generic Trace Semantics via Coinduction
From MaRDI portal
Recommendations
- Trace semantics via generic observations
- Trace semantics for coalgebras
- Trace semantics via determinization
- Trace semantics via determinization
- Coalgebraic trace semantics via forgetful logics
- Coalgebraic Trace Semantics via Forgetful Logics
- Generic trace semantics and graded monads
- Generic infinite traces and path-based coalgebraic temporal logics
- scientific article; zbMATH DE number 6851946
- Towards general axiomatizations for bisimilarity and trace semantics
Cited in
(83)- Extensional quotient coalgebras
- A generalized partition refinement algorithm, instantiated to language equivalence checking for weighted automata
- (In)finite trace equivalence of probabilistic transition systems
- Steps and traces
- Categorical Büchi and parity conditions via alternating fixed points of functors
- Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic
- Coalgebraic semantics for nominal automata
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
- Iterated covariant powerset is not a monad
- Combining semilattices and semimodules
- Trace semantics via determinization
- Relational presheaves, change of base and weak simulation
- Coinductive predicates and final sequences in a fibration
- Monads for behaviour
- Identifying all preorders on the subdistribution monad
- Trace semantics for coalgebras
- A coalgebraic approach to process equivalence and a coinduction principle for traces
- Generic trace theory
- Coalgebraic trace semantics for continuous probabilistic transition systems
- Merging hierarchically-structured documents in workflow systems
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Complete iterativity for algebras with effects
- Traces, Executions and Schedulers, Coalgebraically
- Towards bialgebraic semantics for the linear time -- branching time spectrum
- Generic infinite traces and path-based coalgebraic temporal logics
- From coalgebraic to monoidal traces
- Coalgebraic Trace Semantics via Forgetful Logics
- Coalgebraic trace semantics via forgetful logics
- ``Keep definition, change category -- a practical approach to state-based system calculi
- Relation lifting, a survey
- Behavioural equivalences for timed systems
- Coalgebraic representation theory of fractals
- Final semantics for decorated traces
- Trace-Based Coinductive Operational Semantics for While
- A Coalgebraic Characterization of Behaviours in the Linear Time – Branching Time Spectrum
- Semantics of higher-order quantum computation via geometry of interaction
- Trace Semantics for IPDL
- scientific article; zbMATH DE number 1497803 (Why is no real title available?)
- Coalgebraic infinite traces and Kleisli simulations
- Coinductive predicates and final sequences in a fibration
- scientific article; zbMATH DE number 6864542 (Why is no real title available?)
- scientific article; zbMATH DE number 7080198 (Why is no real title available?)
- A coalgebraic take on regular and \(\omega\)-regular behaviour for systems with internal moves
- A monad for probabilistic point processes
- A coalgebraic take on regular and -regular behaviours
- scientific article; zbMATH DE number 7559448 (Why is no real title available?)
- The theory of traces for systems with nondeterminism, probability, and termination
- Convexity and order in probabilistic call-by-name FPC
- A coalgebraic view on reachability
- Simplified coalgebraic trace equivalence
- Generic trace semantics and graded monads
- Smooth coalgebra: testing vector analysis
- Practical coinduction
- Initial algebras of terms with binding and algebraic structure
- Algebra and Coalgebra in Computer Science
- Towards Effects in Mathematical Operational Semantics
- Sound and complete axiomatization of trace semantics for probabilistic systems
- scientific article; zbMATH DE number 7649889 (Why is no real title available?)
- Graded monads and graded logics for the linear time -- branching time spectrum
- Stream processors and comodels
- Coalgebras for Bisimulation of Weighted Automata over Semirings
- Runners for interleaving algebraic effects
- Maximal traces and path-based coalgebraic temporal logics
- Bialgebras for structural operational semantics: an introduction
- Coalgebraic semantics of modal logics: an overview
- Graded monads and behavioural equivalence games
- Graded semantics and graded logics for Eilenberg-Moore coalgebras
- On Kleisli liftings and decorated trace semantics
- Expressive quantale-valued logics for coalgebras: an adjunction-based approach
- Relative fixed points of functors
- A completeness theorem for probabilistic regular expressions
- Strong induction is an up-to technique
- Quantitative graded semantics and spectra of behavioural metrics
- Quantitative simulations by matrices
- Traces via strategies in two-player games
- Tapes as stochastic matrices of string diagrams
- A no-go theorem for coalgebraic product construction
- A coalgebraic approach to infinite games
- Generic weakest precondition semantics from monads enriched with order
- Coalgebraic constructions of canonical nondeterministic automata
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
- Behavioural equivalences for coalgebras with unobservable moves
- Probabilistic anonymity via coalgebraic simulations
This page was built for publication: Generic Trace Semantics via Coinduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453504)
