Deciding Simulations on Probabilistic Automata

DOI10.1007/978-3-540-75596-8_16zbMath1141.68443OpenAlexW1762983356MaRDI QIDQ3510797

Holger Hermanns, Li-jun Zhang

Publication date: 3 July 2008

Published in: Automated Technology for Verification and Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75596-8_16

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

A NUMERICAL DETERMINING OF THE CRITICAL CONDITIONS FOR SPARK IGNITION AND YIELDING OF A STABLE COMBUSTION OF A LEAN METHANE-AIR MIXTURE ⋮ A space-efficient simulation algorithm on probabilistic automata ⋮ Model Checking Probabilistic Systems ⋮ Computing Behavioral Relations for Probabilistic Concurrent Systems ⋮ A Space-Efficient Probabilistic Simulation Algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bisimulation through probabilistic testing
• Deciding bisimilarity and similarity for probabilistic processes.
• Comparative branching-time semantics for Markov chains
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
• A new approach to the maximum-flow problem
• A Fast Parametric Maximum Flow Algorithm and Applications
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

This page was built for publication: Deciding Simulations on Probabilistic Automata