Trace semantics via determinization
From MaRDI portal
Recommendations
Cites work
- A spectrum of behavioral relations over LTSs on probability distributions
- Adjoint Lifting Theorems for Categories of Algebras
- Alternation
- Characterising Testing Preorders for Finite Probabilistic Processes
- Coalgebraic walks, in quantum and Turing computation
- Complete iterativity for algebras with effects
- Distributing probability over non-determinism
- Eilenberg--Moore algebras for stochastic relations
- Exemplaric Expressivity of Modal Logics
- Final semantics for decorated traces
- Finite Automata Computing Real Functions
- Generalizing determinization from automata to coalgebras
- Generalizing the powerset construction, coalgebraically
- Generic Trace Semantics via Coinduction
- scientific article; zbMATH DE number 5761737 (Why is no real title available?)
- scientific article; zbMATH DE number 3904807 (Why is no real title available?)
- scientific article; zbMATH DE number 3769855 (Why is no real title available?)
- scientific article; zbMATH DE number 2090722 (Why is no real title available?)
- scientific article; zbMATH DE number 822489 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- Lifting theorems for Kleisli categories
- Logical Characterizations of Bisimulations for Discrete Probabilistic Systems
- Mathematical Foundations of Computer Science 2004
- Notions of computation and monads
- On coalgebras over algebras
- On equations for regular languages, finite automata, and sequential networks
- Probabilistic logical characterization
- Scalars, monads and categories
- Sound and complete axiomatization of trace semantics for probabilistic systems
- Strong functors and monoidal monads
- Testing Semantics: Connecting Processes and Process Logics
- Trace semantics via determinization
- Weighted Bisimulation in Linear Algebraic Form
Cited in
(43)- Abstract interpretation of trace semantics for concurrent calculi
- Coalgebraic minimization of automata by initiality and finality
- Long-term values in Markov decision processes, (co)algebraically
- (In)finite trace equivalence of probabilistic transition systems
- Steps and traces
- Predicate and relation liftings for coalgebras with side effects: an application in coalgebraic modal logic
- Coalgebraic semantics for nominal automata
- Algebraic presentation of semifree monads
- Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies
- Iterated covariant powerset is not a monad
- Trace semantics for coalgebras
- Trace semantics via generic observations
- Trace semantics via determinization
- A coalgebraic view on decorated traces
- Coalgebraic trace semantics via forgetful logics
- ``Keep definition, change category -- a practical approach to state-based system calculi
- Final semantics for decorated traces
- Trace Semantics for IPDL
- scientific article; zbMATH DE number 1973223 (Why is no real title available?)
- Termination in convex sets of distributions
- Proper functors and fixed points for finite behaviour
- Feedback, trace and fixed-point semantics
- Up-to techniques for behavioural metrics via fibrations
- Revisiting Semantics of Interactions for Trace Validity Analysis
- The theory of traces for systems with nondeterminism, probability, and termination
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- Distribution bisimilarity via the power of convex algebras
- Towards trace metrics via functor lifting
- Generic Trace Semantics via Coinduction
- Duality of equations and coequations via contravariant adjunctions
- Preservation and reflection of bisimilarity via invertible steps
- Up-to techniques for behavioural metrics via fibrations
- Linear-time logics -- a coalgebraic perspective
- Graded monads and behavioural equivalence games
- Canonical automata via distributive law homomorphisms
- Graded semantics and graded logics for Eilenberg-Moore coalgebras
- Correspondence between composite theories and distributive laws
- On Kleisli liftings and decorated trace semantics
- Weakening and iterating laws using string diagrams
- Behavioural metrics: compositionality of the Kantorovich lifting and an application to up-to techniques
- A completeness theorem for probabilistic regular expressions
- Quantitative graded semantics and spectra of behavioural metrics
- Quantitative simulations by matrices
This page was built for publication: Trace semantics via determinization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2341701)
