Exact and fully symbolic verification of linear hybrid automata with large discrete state spaces (Q436418): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+Q60
@@ Property / Mathematics Subject Classification ID: 68Q60 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q45
@@ Property / Mathematics Subject Classification ID: 68Q45 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W30
@@ Property / Mathematics Subject Classification ID: 68W30 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6059159
@@ Property / zbMATH DE Number: 6059159 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+verification
@@ Property / zbMATH Keywords: verification / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+linear hybrid automata
@@ Property / zbMATH Keywords: linear hybrid automata / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+symbolic representations
@@ Property / zbMATH Keywords: symbolic representations / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+non-convex polyhedra
@@ Property / zbMATH Keywords: non-convex polyhedra / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+redundancy elimination
@@ Property / zbMATH Keywords: redundancy elimination / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+satisfiability modulo theories (SMT)
@@ Property / zbMATH Keywords: satisfiability modulo theories (SMT) / rank @@
+Normal rank

Revision as of 00:05, 30 June 2023