When are stochastic transition systems tameable?
DOI10.1016/j.jlamp.2018.03.004zbMath1394.68243arXiv1703.04806OpenAlexW2604117793MaRDI QIDQ1648646
Pierre Carlier, Nathalie Bertrand, Thomas Brihaye, Patricia Bouyer
Publication date: 27 June 2018
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.04806
Formal languages and automata (68Q45) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A theory of timed automata
- Reasoning about infinite computations
- Continuous stochastic logic characterizes bisimulation of continuous-time Markov processes.
- Measure and probability for concurrency theorists
- Probabilistic verification
- Automata, logics, and infinite games. A guide to current research
- Safety verification of continuous-space pure jump Markov processes
- Quantitative analysis of probabilistic lossy channel systems
- Verification of probabilistic systems with faulty communication
- A theory of stochastic systems. I: Stochastic automata
- On the verification of qualitative properties of probabilistic processes under fairness constraints.
- Stochastic Timed Automata
- Measurability and safety verification for stochastic hybrid systems
- Approximate Verification of the Symbolic Dynamics of Markov Chains
- Fixed-Delay Events in Generalized Semi-Markov Processes Revisited
- Time-Bounded Verification of CTMCs against Real-Time Specifications
- Stochastic Satisfiability Modulo Theory: A Novel Technique for the Analysis of Probabilistic Hybrid Systems
- Symbolic Analysis for GSMP Models with One Stateful Clock
- Markov Chains
- Analysing Decisive Stochastic Processes
- Composition of Stochastic Transition Systems Based on Spans and Couplings
- Stochastic Relations
- CONCUR 2004 - Concurrency Theory
- Decisive Markov Chains
- Probabilistic and Topological Semantics for Timed Automata
- Hybrid Systems: Computation and Control
- CONCUR 2003 - Concurrency Theory
This page was built for publication: When are stochastic transition systems tameable?
