scientific article; zbMATH DE number 7204940

DOI10.4230/LIPIcs.CONCUR.2017.23zbMath1442.68085MaRDI QIDQ5111636

Alexandra Silva, Ana Sokolova, Filippo Bonchi

Publication date: 27 May 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

coalgebraprobabilistic automataconvex algebraconvex powerset monadbisimulation up-tobelief-state transformers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algebraic theory of languages and automata (68Q70) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (11)

Preservation and reflection of bisimilarity via invertible steps ⋮ Unnamed Item ⋮ A trustful monad for axiomatic reasoning with probability and nondeterminism ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ (in)finite trace equivalence of probabilistic transition systems ⋮ Steps and traces ⋮ Termination in Convex Sets of Distributions ⋮ Monads and Quantitative Equational Theories for Nondeterminism and Probability ⋮ Unnamed Item

Uses Software

• Church

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bialgebras for structural operational semantics: an introduction
• Probabilistic systems coalgebraically: a survey
• A hierarchy of probabilistic system types
• Eilenberg--Moore algebras for stochastic relations
• Erratum and addendum: ``Eilenberg-Moore algebras for stochastic relations
• Bisimulation through probabilistic testing
• Universal coalgebra: A theory of systems
• Automatic verification of real-time systems with discrete probability distributions.
• Learning deterministic probabilistic automata from a model checking perspective
• Discrete random variables over domains, revisited
• Power structures
• Exploring probabilistic bisimulations. I
• On the semantics of Markov automata
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Congruences of convex algebras.
• Trace semantics via determinization
• Postulates for the barycentric calculus
• Environmental bisimulations for probabilistic higher-order languages
• Introduction to Coalgebra
• Coalgebraic Trace Semantics for Combined Possibilitistic and Probabilistic Systems
• Compositional Abstraction Techniques for Probabilistic Automata
• Checking NFA equivalence with bisimulations up to congruence
• States of Convex Sets
• Approximate Verification of the Symbolic Dynamics of Markov Chains
• Commutative Semantics for Probabilistic Programming
• Relating coalgebraic notions of bisimulation
• A Spectrum of Behavioral Relations over LTSs on Probability Distributions
• Convexity, Duality and Effects
• Testing Finitary Probabilistic Processes
• Probabilistic Bisimulation: Naturally on Distributions
• EQUIVALENCE OF LABELED MARKOV CHAINS
• Concurrency and Composition in a Stochastic World
• Characterising Testing Preorders for Finite Probabilistic Processes
• Robustly Parameterised Higher-Order Probabilistic Models
• Coinduction up-to in a fibrational setting
• Semantics for probabilistic programming
• High-level Counterexamples for Probabilistic Automata
• Formal verification of timed properties of randomized distributed algorithms
• Limit Synchronization in Markov Decision Processes
• Upper-Expectation Bisimilarity and Łukasiewicz μ-Calculus
• Enhancements of the bisimulation proof method
• Deciding Bisimilarities on Distributions
• Distributing probability over non-determinism

This page was built for publication: