Process symmetry in probabilistic transducers

DOI10.4230/LIPICS.FSTTCS.2020.35MaRDI QIDQ6839867zbMATH OpenFDO

Authors Shaull Almagor

Publication date 23 March 2026

Copyright license Creative Commons Attribution 3.0 Unported

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2020.35

zbMATH Keywords

model checkingpermutationsprobabilistic transducerssymmetry

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata
• scientific article; zbMATH DE number 1261512 (Why is no real title available?)
• Model checking
• On NFAs where all states are final, initial, or both
• On the definition of a family of automata
• On the undecidability of probabilistic planning and related stochastic optimization problems
• Probabilistic automata on finite words: decidable and undecidable problems
• Regular symmetry patterns
• Stability and Complexity of Minimising Probabilistic Automata
• Symmetry Reduction for Probabilistic Model Checking
• Vacuity in Testing

Cited in

(2)

• Quantitative semantics for jumping automata
• Jumping automata must pay

This page was built for publication: Process symmetry in probabilistic transducers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6839867)