Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states (Q2252526): Difference between revisions

@@ Property / cites work @@
+Q4835250
@@ Property / cites work: Q4835250 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4484499
@@ Property / cites work: Q4484499 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Probabilistic Automata Weak Bisimulation in Polynomial Time
+Normal rank
@@ Property / cites work @@
+On the Semantics of Markov Automata
@@ Property / cites work: On the Semantics of Markov Automata / rank @@
+Normal rank
@@ Property / cites work @@
+Markov automata: deciding weak bisimulation by means of non-naïvely vanishing states
+Normal rank
@@ Property / cites work @@
+Deciding Bisimilarities on Distributions
@@ Property / cites work: Deciding Bisimilarities on Distributions / rank @@
+Normal rank
@@ Property / cites work @@
+Improving Time Bounded Reachability Computations in Interactive Markov Chains
+Normal rank
@@ Property / cites work @@
+Q3519383
@@ Property / cites work: Q3519383 / rank @@
+Normal rank
@@ Property / cites work @@
+Concurrency and Composition in a Stochastic World
@@ Property / cites work: Concurrency and Composition in a Stochastic World / rank @@
+Normal rank
@@ Property / cites work @@
+Q4847023
@@ Property / cites work: Q4847023 / rank @@
+Normal rank
@@ Property / cites work @@
+The Quest for Minimal Quotients for Probabilistic Automata
+Normal rank