Consistency in parametric interval probabilistic timed automata
From MaRDI portal
Publication:2291816
DOI10.1016/j.jlamp.2019.04.007zbMath1494.68157arXiv1906.04982OpenAlexW3098409019WikidataQ127903467 ScholiaQ127903467MaRDI QIDQ2291816
Paulin Fournier, Étienne André, Benoît Delahaye
Publication date: 31 January 2020
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.04982
Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Abstract probabilistic automata
- Consistency and refinement for interval Markov chains
- Robust parametric reachability for timed automata
- Performance analysis of probabilistic timed automata using digital clocks
- Decision problems for lower/upper bound parametric timed automata
- A theory of timed automata
- Probabilistic model checking of deadline properties in the IEEE 1394 fireWire root contention protocol
- Automatic verification of real-time systems with discrete probability distributions.
- Linear parametric model checking of timed automata
- An extension of the inverse method to probabilistic timed automata
- Parameter Synthesis for Parametric Interval Markov Chains
- Language Preservation Problems in Parametric Timed Automata
- Parameter Synthesis for Probabilistic Timed Automata Using Stochastic Game Abstractions
- Language Emptiness of Continuous-Time Parametric Timed Automata
- AN INVERSE METHOD FOR PARAMETRIC TIMED AUTOMATA
- Parametric real-time reasoning
- Lectures on Concurrency and Petri Nets
This page was built for publication: Consistency in parametric interval probabilistic timed automata
