Pages that link to "Item:Q4162644"
From MaRDI portal
The following pages link to Communicating sequential processes (Q4162644):
Displaying 50 items.
- Compositional semantics for real-time distributed computing (Q1119027) (← links)
- Concurrent transition systems (Q1119395) (← links)
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces (Q1123253) (← links)
- Semantics of nondeterminism, concurrency, and communication (Q1139946) (← links)
- On the use of history variables (Q1145994) (← links)
- The complexity of problems in systems of communicating sequential processes (Q1146980) (← links)
- Deadlock absence proofs for networks of communicating processes (Q1151025) (← links)
- A proof technique for communicating sequential processes (Q1153686) (← links)
- Methods and means of parallel processing of information (Q1155954) (← links)
- Optimal networks for distributing nonsequential programs (Q1173398) (← links)
- Towards a foundation for semantics in complete metric spaces (Q1173767) (← links)
- The equivalence in the DCP model (Q1177152) (← links)
- A proof system for communicating processes with value-passing (Q1179808) (← links)
- Tuning distributed control algorithms for optimal functioning (Q1187845) (← links)
- Distributed event algebras (Q1191023) (← links)
- A compositional protocol verification using relativized bisimulation (Q1193593) (← links)
- The impact of the number of cooperating grammars on the generative power (Q1193882) (← links)
- A layered semantics for a parallel object-oriented language (Q1194208) (← links)
- Experimenting with process equivalence (Q1194327) (← links)
- Defining conditional independence using collapses (Q1194331) (← links)
- A class of systems with nearly zero distributed simulation overhead (Q1194808) (← links)
- Efficient distributed simulation of acyclic systems (Q1194817) (← links)
- Verification of distributed programs using representative interleaving sequences (Q1200917) (← links)
- Enriched categorical semantics for distributed calculi (Q1208210) (← links)
- Failure-equivalent transformation of transition systems to avoid internal actions (Q1209375) (← links)
- A case for a forward predicate transformer (Q1247746) (← links)
- Some impossibility results in interprocess synchronization (Q1261111) (← links)
- Fairness and hyperfairness in multi-party interactions (Q1261113) (← links)
- Representation of computations in concurrent automata by dependence orders (Q1269906) (← links)
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\) (Q1318721) (← links)
- Asynchronous and corrected-asynchronous finite difference solutions of PDEs on MIMD multiprocessors (Q1319861) (← links)
- Proving partial order properties (Q1322161) (← links)
- A theory of timed automata (Q1322162) (← links)
- Axiomatic-like performance analysis (ALPA) (Q1324358) (← links)
- Some hierarchies for the communication complexity measures of cooperating grammar systems (Q1325838) (← links)
- A trace-based compositional proof theory for fault tolerant distributed systems (Q1330425) (← links)
- Program composition via unification (Q1331925) (← links)
- On sequential composition, action prefixes and process prefix (Q1333405) (← links)
- Reasoning about dynamically evolving process structures (Q1333406) (← links)
- When is partial trace equivalence adequate? (Q1333407) (← links)
- Labelled domains and automata with concurrency (Q1346626) (← links)
- Testing equivalences for processes (Q1348526) (← links)
- On the operational semantics of nondeterminism and divergence (Q1350504) (← links)
- Dynamic graph models (Q1368531) (← links)
- A process algebra of communicating shared resources with dense time and priorities (Q1389685) (← links)
- Processes are in the eye of the beholder (Q1391748) (← links)
- Equivalence is in the eye of the beholder (Q1391750) (← links)
- Fairness in shared invocation servicing (Q1398337) (← links)
- A semantic theory for value-passing processes based on the late approach (Q1398368) (← links)
- A fully abstract model for the exchange of information in multi-agent systems. (Q1401189) (← links)