Quantitative Verification of Stochastic Regular Expressions
From MaRDI portal
Publication:5164850
Recommendations
- Efficient testing and matching of deterministic regular expressions
- A Brief Survey of Verified Decision Procedures for Equivalence of Regular Expressions
- Probabilistic \(\omega \)-regular expressions
- Checking determinism of regular expressions with counting
- Checking determinism of regular expressions with counting
- On regular expression proof complexity
- Descriptional complexity of deterministic regular expressions
- On the uniform distribution of regular expressions
- Simplifying regular expressions. A quantitative perspective
Cites work
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- A logic for reasoning about time and reliability
- A probabilistic Kleene theorem
- A probabilistic language formalism for stochastic discrete-event systems
- An event structure model for probabilistic concurrent Kleene algebra
- Control of stochastic discrete event systems modeled by probabilistic languages
- Implication of regular expressions
- Probabilistic automata and probabilistic logic
- Regular Linear Temporal Logic
- Stochastic context-free grammars, regular languages, and newton's method
- The probabilistic model checking landscape
Cited in
(4)- Verified decision procedures for MSO on words based on derivatives of regular expressions
- Analysis of an efficient reduction algorithm for random regular expressions based on universality detection
- On the quantitative semantics of regular expressions over real-valued signals
- Efficient testing and matching of deterministic regular expressions
This page was built for publication: Quantitative Verification of Stochastic Regular Expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164850)
