A formal model of atomicity in asynchronous systems

DOI10.1007/BF00289593zbMath0511.68033MaRDI QIDQ1838831

Brian Randell, Eike Best

Publication date: 1981

Published in: Acta Informatica (Search for Journal in Brave)

zbMATH Keywords

concurrent processeserror recoveryatomic occurrence of a programcycle-freeness of graphsdecentralised systemformal model of computational structuregeneralisation of occurrence graphsinterference freeness

Mathematics Subject Classification ID

Graph theory (05C99) Theory of operating systems (68N25) Theory of computing (68Q99)

Related Items

A temporal programming model with atomic blocks based on projection temporal logic ⋮ A Canonical Contraction for Safe Petri Nets ⋮ Interleaving set temporal logic ⋮ Sequential and concurrent behaviour in Petri net theory ⋮ Failures: Their Definition, Modelling and Analysis ⋮ Verifying atomic data types ⋮ Occurrence Nets Then and Now: The Path to Structured Occurrence Nets ⋮ Transformation of programs for fault-tolerance

Cites Work

• Consistency in Hierarchical Database Systems
• Proving Liveness Properties of Concurrent Programs
• The notions of consistency and predicate locks in a database system
• On-the-fly garbage collection
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item