Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Bisimulation through probabilistic testing
Information and Computation
Modeling and verification of randomized distributed real-time systems
Modeling and verification of randomized distributed real-time systems
Deciding bisimilarity and similarity for probabilistic processes
Journal of Computer and System Sciences
Model-checking continuous-time Markov chains
ACM Transactions on Computational Logic (TOCL)
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Reduction and Refinement Strategies for Probabilistic Analysis
PAPM-PROBMIV '02 Proceedings of the Second Joint International Workshop on Process Algebra and Probabilistic Methods, Performance Modeling and Verification
Weak Bisimulation for Probabilistic Systems
CONCUR '00 Proceedings of the 11th International Conference on Concurrency Theory
Decision Algorithms for Probabilistic Bisimulation
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
Model Checking of Probabalistic and Nondeterministic Systems
Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science
Bisimulation for labelled Markov processes
Information and Computation - Special issue: LICS'97
Model-Checking Algorithms for Continuous-Time Markov Chains
IEEE Transactions on Software Engineering
Equivalence notions and model minimization in Markov decision processes
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Approximating labelled Markov processes
Information and Computation
Optimal state-space lumping in Markov chains
Information Processing Letters
Bisimulation: From The Origins to Today
LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
A compositional approach to defining logics for coalgebras
Theoretical Computer Science - Selected papers of CMCS'03
QEST '05 Proceedings of the Second International Conference on the Quantitative Evaluation of Systems
Characterising Testing Preorders for Finite Probabilistic Processes
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
Modular construction of complete coalgebraic logics
Theoretical Computer Science
Expressivity of coalgebraic modal logic: The limits and beyond
Theoretical Computer Science
Analyzing Security Protocols Using Time-Bounded Task-PIOAs
Discrete Event Dynamic Systems
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Approximate Analysis of Probabilistic Processes: Logic, Simulation and Games
QEST '08 Proceedings of the 2008 Fifth International Conference on Quantitative Evaluation of Systems
Nondeterministic Labeled Markov Processes: Bisimulations and Logical Characterization
QEST '09 Proceedings of the 2009 Sixth International Conference on the Quantitative Evaluation of Systems
On Logics for Coalgebraic Simulation
Electronic Notes in Theoretical Computer Science (ENTCS)
Comparative branching-time semantics for Markov chains
Information and Computation
A modular approach to defining and characterising notions of simulation
Information and Computation - Special issue: Seventh workshop on coalgebraic methods in computer science 2004
Labelled Markov Processes
Logical characterizations of bisimulations for discrete probabilistic systems
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Bisimulation minimisation mostly speeds up probabilistic model checking
TACAS'07 Proceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems
Magnifying-lens abstraction for Markov decision processes
CAV'07 Proceedings of the 19th international conference on Computer aided verification
Model-checking ω-regular properties of interval Markov chains
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
On Probabilistic Automata in Continuous Time
LICS '10 Proceedings of the 2010 25th Annual IEEE Symposium on Logic in Computer Science
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Bisimulation and logical preservation for continuous-time markov decision processes
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
On the semantics of Markov automata
ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Bisimulations meet PCTL equivalences for probabilistic automata
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A spectrum of behavioral relations over LTSs on probability distributions
CONCUR'11 Proceedings of the 22nd international conference on Concurrency theory
A general framework for probabilistic characterizing formulae
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
On the semantics of Markov automata
Information and Computation
| Hi-index | 0.00 |
Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. This paper develops a taxonomy of logical characterizations of these relations on image-finite and image-infinite probabilistic automata.