SIGREF

swMATH859MaRDI QIDQ13603FDOQ13603

Author name not available (Why is that?)

Described by source

• Sigref – A Symbolic Bisimulation Tool Box

Cited In (13)

• Three-Valued Abstraction for Continuous-Time Markov Chains
• On Abstraction of Probabilistic Systems
• Polynomial time decision algorithms for probabilistic automata
• Bisimulation Minimisation Mostly Speeds Up Probabilistic Model Checking
• The How and Why of Interactive Markov Chains
• A Symbolic Algorithm for Optimal Markov Chain Lumping
• Model Based Importance Analysis for Minimal Cut Sets
• Game-theoretic simulation checking tool
• Compositional Abstraction for Stochastic Systems
• SMT-Based Bisimulation Minimisation of Markov Models
• Cost Preserving Bisimulations for Probabilistic Automata
• Computing maximal weak and other bisimulations
• Next-preserving branching bisimulation

This page was built for software: SIGREF