Quantitative Verification of Stochastic Regular Expressions
From MaRDI portal
Publication:5164850
DOI10.3233/FI-2021-2018OpenAlexW3138564825MaRDI QIDQ5164850FDOQ5164850
Authors: Sinem Getir Yaman, Esteban Pavese, Lars Grunske 
Publication date: 15 November 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2021-2018
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
probabilistic verificationquantitative verificationformal modelsstochastic algebraaction based logicprobabilistic regular expressionsstochastic regular expressions
Cites Work
- Title not available (Why is that?)
- A logic for reasoning about time and reliability
- Title not available (Why is that?)
- Stochastic context-free grammars, regular languages, and newton's method
- Regular Linear Temporal Logic
- Implication of regular expressions
- 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
- The probabilistic model checking landscape
- Probabilistic automata and probabilistic logic
- A probabilistic Kleene theorem
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
Uses Software
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)
