A theory for nondeterminism, parallelism, communication, and concurrency
From MaRDI portal
Publication:1081296
DOI10.1016/0304-3975(86)90040-XzbMath0601.68022MaRDI QIDQ1081296
Publication date: 1986
Published in: Theoretical Computer Science (Search for Journal in Brave)
fixed points; concurrent programs; partial recursive functions; multiprogramming; communicating systems; Operational semantics; rewriting rules; data flow semantics; mutually recursive systems of nondeterministic equations; recursive stream equations; reduction machines; stream processing functions
68Q60: Specification and verification (program logics, model checking, etc.)
68N25: Theory of operating systems
Related Items
SEARCHING ALGORITHMS IMPLEMENTED ON PROBABILISTIC SYSTOLIC ARRAYS, Computable concurrent processes, Specification and design of shared resource arbitration, Combining angels, demons and miracles in program specifications, A fully abstract trace model for dataflow and asynchronous networks, Algebraic specification of reactive systems, Specification and verification of object-oriented programs using supertype abstraction, Free choice and contextually permitted actions
Uses Software