A completeness theorem for probabilistic regular expressions
From MaRDI portal
Cites work
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- A complete axiomatisation for trace congruence of finite state behaviors
- A complete inference system for a class of regular behaviours
- A completeness theorem for Kleene algebras and the algebra of regular events
- A new foundation for finitary corecursion and iterative algebras
- Axioms for probability and nondeterminism
- Bisimulation for probabilistic transition systems: A coalgebraic approach
- Bisimulation through probabilistic testing
- Coalgebraic behavioral metrics
- Coalgebraic Trace Semantics via Forgetful Logics
- Complete axiomatization for the total variation distance of Markov chains
- Congruences of convex algebras.
- Convexity, duality and effects
- Derivatives of Regular Expressions
- Does a Program Yield the Right Distribution?
- Erratum and addendum: ``Eilenberg-Moore algebras for stochastic relations
- Generalizing the powerset construction, coalgebraically
- Generic Trace Semantics via Coinduction
- scientific article; zbMATH DE number 1696821 (Why is no real title available?)
- scientific article; zbMATH DE number 177804 (Why is no real title available?)
- scientific article; zbMATH DE number 575948 (Why is no real title available?)
- scientific article; zbMATH DE number 1754605 (Why is no real title available?)
- scientific article; zbMATH DE number 6987095 (Why is no real title available?)
- scientific article; zbMATH DE number 7204940 (Why is no real title available?)
- Iterative algebras at work
- Milner's proof system for regular expressions modulo bisimilarity is complete. Crystallization: near-collapsing process graph interpretations of regular expressions
- Netkat, semantic foundations for networks
- On star expressions and completeness theorems
- Partial derivatives of regular expressions and finite automaton constructions
- Postulates for the barycentric calculus
- Probabilistic automata
- Probabilistic guarded KAT Modulo bisimilarity: completeness and complexity
- Proper functors and fixed points for finite behaviour
- Proper semirings and proper convex functors
- Quantitative Algebraic Reasoning
- Reactive, generative, and stratified models of probabilistic processes
- Sound and complete axiomatization of trace semantics for probabilistic systems
- Sound and complete axiomatizations of coalgebraic language equivalence
- Steps and traces
- Trace semantics via determinization
- Two Complete Axiom Systems for the Algebra of Regular Events
- Une remarque sur les systèmes complets d'identités rationnelles
- Universal coalgebra: A theory of systems
Cited in
(3)
This page was built for publication: A completeness theorem for probabilistic regular expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970205)
