A Decision Procedure for CTL* Based on Tableaux and Automata (Q5747771): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-14203-1_28
+Normal rank
@@ Property / OpenAlex ID @@
+W1534088363
@@ Property / OpenAlex ID: W1534088363 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4385542
@@ Property / cites work: Q4385542 / rank @@
+Normal rank
@@ Property / cites work @@
+“Sometimes” and “not never” revisited
@@ Property / cites work: “Sometimes” and “not never” revisited / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Tree Automata and Logics of Programs
+Normal rank
@@ Property / cites work @@
+Deciding full branching time logic
@@ Property / cites work: Deciding full branching time logic / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Parity Games in Practice
@@ Property / cites work: Solving Parity Games in Practice / rank @@
+Normal rank
@@ Property / cites work @@
+A Sound and Complete Deductive System for CTL* Verification
+Normal rank
@@ Property / cites work @@
+Automata, logics, and infinite games. A guide to current research
+Normal rank
@@ Property / cites work @@
+Complementation, Disambiguation, and Determinization of Büchi Automata Unified
+Normal rank
@@ Property / cites work @@
+Alternating finite automata on \(\omega\)-words
@@ Property / cites work: Alternating finite automata on \(\omega\)-words / rank @@
+Normal rank
@@ Property / cites work @@
+Q3814796
@@ Property / cites work: Q3814796 / rank @@
+Normal rank
@@ Property / cites work @@
+An axiomatization of full Computation Tree Logic
@@ Property / cites work: An axiomatization of full Computation Tree Logic / rank @@
+Normal rank
@@ Property / cites work @@
+Solving Parity Games in Big Steps
@@ Property / cites work: Solving Parity Games in Big Steps / rank @@
+Normal rank
@@ Property / cites work @@
+Tighter Bounds for the Determinisation of Büchi Automata
+Normal rank