Distributed processes

DOI10.1145/359642.359651MaRDI QIDQ4174727zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Per Brinch Hansen

Publication date 1978

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/359642.359651

zbMATH Keywords

BuffersConcurrent PascalConcurrent ProgrammingCorontuesDistributed ProcessesGuarded RegionInput/OutputMonitorsMultiprocessorSchedulingSemaphorsSorting Arrays

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25)

Cited in

(18)

• A proof system for distributed processes
• Modeling a solution for a control problem in distributed systems by restrictions
• Parallelism in alpha-beta search
• Optimal networks for distributing nonsequential programs
• Testing equivalences for processes
• Corrigenda:Cooperating proofs for distributed programs with multiparty interactions
• A fault-tolerant file management algorithm in distributed computer system ``THUDS
• Monitors with associated processors
• An experiment in language design for distributed systems
• SPECIFICATION AND VERIFICATION OF CONURRENT SYSTEMS IN CESAR
• Programming of parallel processors in control spaces
• Towards a language for concurrent processes
• Communicating parallel processes
• Message passing between sequential processes: The reply primitive and the administrator concept
• Synchronous, asynchronous, and causally ordered communication
• A software architecture for distributed computer control systems
• A weakest precondition semantics for communicating processes
• Port automata and the algebra of concurrent porcesses

This page was built for publication: Distributed processes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4174727)