Everything Is PSPACE-Complete in Interaction Systems (Q5505604): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-85762-4_15
+Normal rank
@@ Property / OpenAlex ID @@
+W1530284785
@@ Property / OpenAlex ID: W1530284785 / rank @@
+Normal rank
@@ Property / cites work @@
+A component-based Petri net model for specifying and validating cooperative information systems
+Normal rank
@@ Property / cites work @@
+Q4268457
@@ Property / cites work: Q4268457 / rank @@
+Normal rank
@@ Property / cites work @@
+Ensuring Properties of Interaction Systems
@@ Property / cites work: Ensuring Properties of Interaction Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Contracts for BIP: Hierarchical Interaction Models for Compositional Verification
+Normal rank
@@ Property / cites work @@
+Component-Based Construction of Deadlock-Free Systems
+Normal rank
@@ Property / cites work @@
+Composition for component-based modeling
@@ Property / cites work: Composition for component-based modeling / rank @@
+Normal rank
@@ Property / cites work @@
+Q2764108
@@ Property / cites work: Q2764108 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3833630
@@ Property / cites work: Q3833630 / rank @@
+Normal rank
@@ Property / cites work @@
+Deriving Complexity Results for Interaction Systems from 1-Safe Petri Nets
+Normal rank
@@ Property / cites work @@
+A Polynomial-Time Checkable Sufficient Condition for Deadlock-Freedom of Component-Based Systems
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank