Bisimulation for Demonic Schedulers (Q3617738)

From MaRDI portal

Revision as of 05:44, 29 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Bisimulation for Demonic Schedulers	scientific article

Statements

scholarly article

0 references

Bisimulation for Demonic Schedulers (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-642-00596-1_23

0 references

Foundations of Software Science and Computational Structures

0 references

publication date

31 March 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-00596-1_23

0 references

0 references

A calculus for cryptographic protocols: The spi calculus

0 references

Mobile values, new names, and secure communication

0 references

Programming Languages and Systems

0 references

Making Random Choices Invisible to the Scheduler

0 references

Bisimulation for Demonic Schedulers

0 references

CONCUR 2005 – Concurrency Theory

0 references

The dining cryptographers problem: Unconditional sender and recipient untraceability

0 references

Analyzing security protocols using time-bounded task-PIOAs

0 references

Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3617738

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3617738&oldid=35100952"