On probabilistic timed automata. (Q1853732): Difference between revisions

@@ Property / cites work @@
+A theory of timed automata
@@ Property / cites work: A theory of timed automata / rank @@
+Normal rank
@@ Property / cites work @@
+Rational \(\omega\)-languages are non-ambiguous
@@ Property / cites work: Rational \(\omega\)-languages are non-ambiguous / rank @@
+Normal rank
@@ Property / cites work @@
+Model checking of probabilistic and nondeterministic systems
+Normal rank
@@ Property / cites work @@
+On the complexity of finite memory policies for Markov decision processes
+Normal rank
@@ Property / cites work @@
+The complexity of probabilistic verification
@@ Property / cites work: The complexity of probabilistic verification / rank @@
+Normal rank
@@ Property / cites work @@
+Markov decision processes and regular events
@@ Property / cites work: Markov decision processes and regular events / rank @@
+Normal rank
@@ Property / cites work @@
+A logic for reasoning about time and reliability
@@ Property / cites work: A logic for reasoning about time and reliability / rank @@
+Normal rank
@@ Property / cites work @@
+Testing and generating infinite sequences by a finite automaton
+Normal rank
@@ Property / cites work @@
+The Complexity of Markov Decision Processes
@@ Property / cites work: The Complexity of Markov Decision Processes / rank @@
+Normal rank
@@ Property / cites work @@
+Q3483104
@@ Property / cites work: Q3483104 / rank @@
+Normal rank