Decidable verification for reducible timed automata specified in a first order logic with time (Q1606131): 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 @@
+The benefits of relaxing punctuality
@@ Property / cites work: The benefits of relaxing punctuality / rank @@
+Normal rank
@@ Property / cites work @@
+Q3839068
@@ Property / cites work: Q3839068 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4934321
@@ Property / cites work: Q4934321 / rank @@
+Normal rank
@@ Property / cites work @@
+A first order logic for specification of timed algorithms: Basic properties and a decidable class
+Normal rank
@@ Property / cites work @@
+Complexity of deciding Tarski algebra
@@ Property / cites work: Complexity of deciding Tarski algebra / rank @@
+Normal rank
@@ Property / cites work @@
+Q4251919
@@ Property / cites work: Q4251919 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4938638
@@ Property / cites work: Q4938638 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4945224
@@ Property / cites work: Q4945224 / rank @@
+Normal rank
@@ Property / cites work @@
+On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
+Normal rank
@@ Property / cites work @@
+Q3221371
@@ Property / cites work: Q3221371 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4094390
@@ Property / cites work: Q4094390 / rank @@
+Normal rank