ComputingComputer ScienceComputer SystemsDistributed SystemsFormal MethodsReal-time SystemsData SynchronizationDistributed SynchronizationQueueing SystemsQueueing TheoryReal-time Systems DesignTemporal LogicFairnessLiveness PropertiesOperational SemanticsSelection MechanismsStructural Operational SemanticsSynchronizationSynchronization MechanismsSynchronization Semantics
A fragment of ADA abstracting the communication and synchronization part is studied. An operational semantics for this fragment is given, emphasizing the justice and fairness aspects of the selection mechanisms. An appropriate notion of fairness is shown to be equivalent to the explicit entry-queues proposed in the reference manual. Proof rules for invariance and liveness properties are given and illustrated on an example. The proof rules are based on temporal logic.
5
Communicating sequential processes
C. A. R. Hoare · Communications of the ACM · 1983 · 3.8K citations · Full text
Communicating sequential processes
C. A. R. Hoare · Communications of the ACM · 1978 · 3.5K citations · Full text
Per Brinch Hansen · Communications of the ACM · 1978 · 465 citations
Verification of concurrent programs: a temporal proof system
Zohar Manna, Amir Pnueli · 1983 · 140 citations