The following pages link to (Q4138147):
Displaying 37 items.
- Graph-based communication in Eden (Q526455) (← links)
- Using fixed-point semantics to prove retiming lemmas (Q685101) (← links)
- Turing machines, transition systems, and interaction (Q703844) (← links)
- Asynchronous sequential processes (Q1013090) (← links)
- Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog (Q1075767) (← links)
- A model and temporal proof system for networks of processes (Q1079948) (← links)
- A theory for nondeterminism, parallelism, communication, and concurrency (Q1081296) (← links)
- Specification and top-down design of distributed systems (Q1089790) (← links)
- Modeling concurrency with partial orders (Q1091134) (← links)
- A refinement of strong sequentiality for term rewriting with constructors (Q1093366) (← links)
- The equational theory of pomsets (Q1119012) (← links)
- Concurrent transition systems (Q1119395) (← links)
- Linear dynamic Kahn networks are deterministic (Q1128478) (← links)
- Computing with infinite objects (Q1158755) (← links)
- Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable (Q1162807) (← links)
- Sequential algorithms on concrete data structures (Q1170880) (← links)
- A denotational theory of synchronous reactive systems (Q1193599) (← links)
- Towards a theory of parallel algorithms on concrete data structures (Q1194326) (← links)
- Historical introduction to ``Concrete domains'' by G. Kahn and G. D. Plotkin (Q1314353) (← links)
- Defining concurrent processes constructively (Q1314421) (← links)
- Algebraic specification of reactive systems (Q1575270) (← links)
- A buffer minimization problem for the design of embedded systems (Q1767685) (← links)
- The origins of structural operational semantics (Q1878710) (← links)
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency (Q2350494) (← links)
- DTL: A language for the design and implementation of concurrent programs as structured networks (Q3668842) (← links)
- An application of co-inductive types in Coq: Verification of the alternating bit protocol (Q4647576) (← links)
- Turing Machines, Transition Systems, and Interaction (Q4917087) (← links)
- (Q5015372) (← links)
- Semantic Foundations for Deterministic Dataflow and Stream Processing (Q5041103) (← links)
- Full abstraction and the Context Lemma (preliminary report) (Q5096215) (← links)
- Compositional relational semantics for indeterminate dataflow networks (Q5096251) (← links)
- Causality and true concurrency: A data-flow analysis of the Pi-Calculus (Q5096391) (← links)
- To be or not to be …lazy (In a Parallel Context) (Q5170189) (← links)
- Retracing CSP (Q5262957) (← links)
- A generalized Kahn Principle for abstract asynchronous networks (Q5887509) (← links)
- Specification and verification of concurrent systems by causality and realizability (Q6049931) (← links)
- Monoidal streams for dataflow programming (Q6649486) (← links)
