Bisimulation for Demonic Schedulers (Q3617738): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-00596-1_23
+Normal rank
@@ Property / OpenAlex ID @@
+W1888841230
@@ Property / OpenAlex ID: W1888841230 / rank @@
+Normal rank
@@ Property / cites work @@
+A calculus for cryptographic protocols: The spi calculus
+Normal rank
@@ Property / cites work @@
+Mobile values, new names, and secure communication
+Normal rank
@@ Property / cites work @@
+Programming Languages and Systems
@@ Property / cites work: Programming Languages and Systems / rank @@
+Normal rank
@@ Property / cites work @@
+Making Random Choices Invisible to the Scheduler
@@ Property / cites work: Making Random Choices Invisible to the Scheduler / rank @@
+Normal rank
@@ Property / cites work @@
+Bisimulation for Demonic Schedulers
@@ Property / cites work: Bisimulation for Demonic Schedulers / rank @@
+Normal rank
@@ Property / cites work @@
+CONCUR 2005 – Concurrency Theory
@@ Property / cites work: CONCUR 2005 – Concurrency Theory / rank @@
+Normal rank
@@ Property / cites work @@
+The dining cryptographers problem: Unconditional sender and recipient untraceability
+Normal rank
@@ Property / cites work @@
+Analyzing security protocols using time-bounded task-PIOAs
+Normal rank
@@ Property / cites work @@
+Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols
+Normal rank
@@ Property / cites work @@
+Q2764140
@@ Property / cites work: Q2764140 / rank @@
+Normal rank