scientific article; zbMATH DE number 3566181
From MaRDI portal
Publication:4138147
zbMath0363.68076MaRDI QIDQ4138147
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (37)
Fair, biased, and self-balancing merge operators: Their specification and implementation in Concurrent Prolog ⋮ A model and temporal proof system for networks of processes ⋮ A theory for nondeterminism, parallelism, communication, and concurrency ⋮ The origins of structural operational semantics ⋮ A generalized Kahn Principle for abstract asynchronous networks ⋮ Semantic Foundations for Deterministic Dataflow and Stream Processing ⋮ Specification and top-down design of distributed systems ⋮ Modeling concurrency with partial orders ⋮ A refinement of strong sequentiality for term rewriting with constructors ⋮ The equational theory of pomsets ⋮ Concurrent transition systems ⋮ Linear dynamic Kahn networks are deterministic ⋮ Full abstraction and the Context Lemma (preliminary report) ⋮ Compositional relational semantics for indeterminate dataflow networks ⋮ Causality and true concurrency: A data-flow analysis of the Pi-Calculus ⋮ Specification and verification of concurrent systems by causality and realizability ⋮ Programming with streams in Coq a case study: The Sieve of Eratosthenes ⋮ Computing with infinite objects ⋮ Unnamed Item ⋮ Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable ⋮ Sequential algorithms on concrete data structures ⋮ A denotational theory of synchronous reactive systems ⋮ Towards a theory of parallel algorithms on concrete data structures ⋮ An application of co-inductive types in Coq: Verification of the alternating bit protocol ⋮ Using fixed-point semantics to prove retiming lemmas ⋮ Graph-based communication in Eden ⋮ Turing Machines, Transition Systems, and Interaction ⋮ To be or not to be …lazy (In a Parallel Context) ⋮ A buffer minimization problem for the design of embedded systems ⋮ Turing machines, transition systems, and interaction ⋮ Asynchronous sequential processes ⋮ Algebraic specification of reactive systems ⋮ DTL: A language for the design and implementation of concurrent programs as structured networks ⋮ Retracing CSP ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin ⋮ Defining concurrent processes constructively ⋮ Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
This page was built for publication:
