Studying Operational Models of Relaxed Concurrency

DOI10.1007/978-3-319-05119-2_15zbMath1348.68168OpenAlexW1465519955MaRDI QIDQ2830038

Gustavo Petri

Publication date: 9 November 2016

Published in: Trustworthy Global Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-05119-2_15

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items

Studying Operational Models of Relaxed Concurrency

Cites Work

• Unnamed Item
• Studying Operational Models of Relaxed Concurrency
• What’s Decidable about Weak Memory Models?
• A Theory of Speculative Computation
• Generative Operational Semantics for Relaxed Memory Models
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Minimal and Optimal Computations of Recursive Programs
• On the verification problem for weak memory models
• Relaxed memory models
• The Java memory model