Deciding Simulations on Probabilistic Automata

DOI10.1007/978-3-540-75596-8_16MaRDI QIDQ3510797zbMATH OpenOpenAlexFDO

Authors Holger Hermanns, Lijun 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)

Recommendations

• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• Polynomial time decision algorithms for probabilistic automata
• scientific article; zbMATH DE number 1927574
• Deciding probabilistic automata weak bisimulation: theory and practice
• Deciding probabilistic automata weak bisimulation in polynomial time

Cites work

• A Characterization of Meaningful Schedulers for Continuous-Time Markov Decision Processes
• A Fast Parametric Maximum Flow Algorithm and Applications
• A new approach to the maximum-flow problem
• Bisimulation through probabilistic testing
• Comparative branching-time semantics for Markov chains
• Deciding bisimilarity and similarity for probabilistic processes.
• Efficient computation of time-bounded reachability probabilities in uniform continuous-time Markov decision processes
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1927574 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 794262 (Why is no real title available?)

Cited in

(10)

• Probabilistic weak simulation is decidable in polynomial time
• A space-efficient simulation algorithm on probabilistic automata
• Deciding probabilistic automata weak bisimulation: theory and practice
• Computing Behavioral Relations for Probabilistic Concurrent Systems
• On probabilistic Kleene algebras, automata and simulations
• Model checking probabilistic systems
• A Space-Efficient Probabilistic Simulation Algorithm
• Polynomial time decision algorithms for probabilistic automata
• A numerical determining of the critical conditions for spark ignition and yielding of a stable combustion of a lean methane-air mixture
• Flow Faster: Efficient Decision Algorithms for Probabilistic Simulations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3510797)