Undecidability of accordance for open systems with unbounded message queues (Q402353): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.ipl.2014.07.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2001076149
@@ Property / OpenAlex ID: W2001076149 / rank @@
+Normal rank
@@ Property / cites work @@
+Deciding Substitutability of Services with Operating Guidelines
+Normal rank
@@ Property / cites work @@
+Does My Service Have Partners?
@@ Property / cites work: Does My Service Have Partners? / rank @@
+Normal rank
@@ Property / cites work @@
+Relating fair testing and accordance for service replaceability
+Normal rank
@@ Property / cites work @@
+Trace- and failure-based semantics for responsiveness
+Normal rank
@@ Property / cites work @@
+A trace-based service semantics guaranteeing deadlock freedom
+Normal rank
@@ Property / cites work @@
+Q3992568
@@ Property / cites work: Q3992568 / rank @@
+Normal rank
@@ Property / cites work @@
+Modular construction and partial order semantics of Petri nets
+Normal rank
@@ Property / cites work @@
+Q5590814
@@ Property / cites work: Q5590814 / rank @@
+Normal rank
@@ Property / cites work @@
+Undecidability of bisimilarity for Petri nets and some related problems
+Normal rank
@@ Property / cites work @@
+Fair testing
@@ Property / cites work: Fair testing / rank @@
+Normal rank
@@ Property / cites work @@
+Can I find a partner? Undecidability of partner existence for open nets
+Normal rank
@@ Property / cites work @@
+Q4247290
@@ Property / cites work: Q4247290 / rank @@
+Normal rank