scientific article
From MaRDI portal
Publication:3042377
zbMath0527.68012MaRDI QIDQ3042377
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
concurrencynondeterminismfair schedulingfixpointsdataflowmergeinput streamsKahn principleoutput stream
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)
Related Items
A generalized Kahn Principle for abstract asynchronous networks ⋮ Concurrent histories: a basis for observing distributed systems ⋮ Semantics of finite and infinite networks of concurrent communicating agents ⋮ Specification and refinement of networks of asynchronously communicating agents using the assumption/commitment paradigm ⋮ Concurrent transition systems ⋮ An operator net model for distributed systems ⋮ On nets, algebras and modularity ⋮ Towards a complete hierarchy of compositional dataflow models ⋮ A functional programming approach to the specification and verification of concurrent systems ⋮ Recursion equation sets computing logic programs ⋮ An extensional fixed-point semantics for nondeterministic data flow ⋮ Computable concurrent processes ⋮ The expressive power of indeterminate dataflow primitives ⋮ Network algebra in Java ⋮ The algebra of stream processing functions ⋮ Algebraic specification of reactive systems ⋮ Interaction Nets with McCarthy's amb ⋮ Refinement of time ⋮ Nonexpressibility of fairness and signaling ⋮ Handshake Games ⋮ Historical introduction to ``Concrete domains by G. Kahn and G. D. Plotkin ⋮ A model of concurrency with fair merge and full recursion ⋮ A denotational semantics and dataflow construction for logic programs ⋮ Clocked lambda calculus
