scientific article
zbMath1483.68195MaRDI QIDQ3384160
Joachim Klein, Lisa Hutschenreiter, Christel Baier
Publication date: 14 December 2021
Full work available at URL: http://eptcs.web.cse.unsw.edu.au/paper.cgi?GANDALF2017.2
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parametric probabilistic transition systems for system design and analysis
- Computing the first Betti number of a semi-algebraic set
- Solving systems of linear equations over polynomials
- The complexity of elementary algebra and geometry
- An algorithm for solving parametric linear systems
- A logic for reasoning about time and reliability
- Parameter synthesis for Markov models: faster than ever
- Parametric Markov chains: PCTL complexity and fraction-free Gaussian elimination
- The Exact Solution of Systems of Linear Equations with Polynomial Coefficients
- LTL Model Checking of Interval Markov Chains
- Model-Checking ω-Regular Properties of Interval Markov Chains
- Computational Solutions of Matrix Problems Over an Integral Domain
- Theoretical Aspects of Computing - ICTAC 2004
- Tools and Algorithms for the Construction and Analysis of Systems
This page was built for publication: