Concurrent Processes and Their Syntax
From MaRDI portal
Publication:4178474
DOI10.1145/322123.322134zbMath0395.68030OpenAlexW1973311427WikidataQ128253401 ScholiaQ128253401MaRDI QIDQ4178474
George J. Milne, Arthur J. Milner
Publication date: 1979
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322123.322134
SemanticsParallelismSyntaxConcurrent ProcessesCategory of Flow AlgebrasFlow DiagramsFlowgraphsSynchronized Communication
Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25) Algorithms in computer science (68W99)
Related Items
Merging regular processes by means of fixed-point theory, Three metric domains of processes for bisimulation, Communication in concurrent dynamic logic, Deadlock analysis in networks of communicating processes, A domain equation for bisimulation, Semantics of nondeterminism, concurrency, and communication, A semantic theory for value-passing processes based on the late approach, On describing the behavior and implementation of distributed systems, Election in partially anonymous networks with arbitrary knowledge in message passing systems, The complexity of problems in systems of communicating sequential processes, Petri nets, event structures and domains. I, Symmetry breaking in distributed networks, On the power of synchronization between two adjacent processes, A multiset semantics for the pi-calculus with replication, Deriving graphical representations of process networks from algebraic expressions, A fully abstract denotational semantics for the calculus of higher-order communicating systems, Structural inclusion in the pi-calculus with replication, Combining effects: sum and tensor, A brief history of process algebra, On the design and specification of message oriented programs, Multisets and structural congruence of the pi-calculus with replication, In Scott-Strachey style denotational semantics, parallelism implies nondeterminism, Calculi for synchrony and asynchrony, A weakest precondition semantics for communicating processes, Port automata and the algebra of concurrent porcesses, A language for linking modules into systems, Modelling Dynamically Changing Hardware Structure
