Concurrent Processes and Their Syntax
From MaRDI portal
Publication:4178474
Cited in
(27)- A brief history of process algebra
- Port automata and the algebra of concurrent porcesses
- A language for linking modules into systems
- A semantic theory for value-passing processes based on the late approach
- Symmetry breaking in distributed networks
- In Scott-Strachey style denotational semantics, parallelism implies nondeterminism
- Merging regular processes by means of fixed-point theory
- Deadlock analysis in networks of communicating processes
- A fully abstract denotational semantics for the calculus of higher-order communicating systems
- Structural inclusion in the pi-calculus with replication
- Election in partially anonymous networks with arbitrary knowledge in message passing systems
- A weakest precondition semantics for communicating processes
- Calculi for synchrony and asynchrony
- A multiset semantics for the pi-calculus with replication
- Multisets and structural congruence of the pi-calculus with replication
- Deriving graphical representations of process networks from algebraic expressions
- On the design and specification of message oriented programs
- The complexity of problems in systems of communicating sequential processes
- On the power of synchronization between two adjacent processes
- Combining effects: sum and tensor
- Communication in concurrent dynamic logic
- Three metric domains of processes for bisimulation
- On describing the behavior and implementation of distributed systems
- A domain equation for bisimulation
- Petri nets, event structures and domains. I
- Modelling dynamically changing hardware structure
- Semantics of nondeterminism, concurrency, and communication
This page was built for publication: Concurrent Processes and Their Syntax
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4178474)
