Communicating sequential processes
Communicating sequential processes
Process algebra
Probabilistic non-determinism
Programming from specifications (2nd ed.)
Programming from specifications (2nd ed.)
Randomized algorithms
Guarded commands, nondeterminacy and formal derivation of programs
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Abstraction, Refinement And Proof For Probabilistic Systems (Monographs in Computer Science)
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Integrating Probability with Time and Shared-Variable Concurrency
SEW '06 Proceedings of the 30th Annual IEEE/NASA Software Engineering Workshop
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof rules for probabilistic loops
FAC-RW'96 Proceedings of the BCS-FACS 7th conference on Refinement
Concurrency Verification: Introduction to Compositional and Non-compositional Methods
Concurrency Verification: Introduction to Compositional and Non-compositional Methods
A UTP semantics of pGCL as a homogeneous relation
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
| Hi-index | 0.00 |
Reasoning about a distributed system that exhibits a combination of probabilistic and temporal behaviour does not seem to be easy with current techniques. The reason is the interaction between probability and abstraction (local block), made worse by remote synchronisation. The formalism of process algebra has not so far provided much insight, and so the alternative of shared-variable concurrency has been explored. In this paper the recently proposed language ptsc (for probability, time and shared-variable concurrency) is extended by constructs for interleaving and local block. Both enhance a designer's ability to modularise a design; the latter also permits a design to be compared with its more abstract specification, by concealing appropriately chosen design variables. Laws of the extended language are studied and applied in a case study consisting of a faulty register-transfer-level design.