Proposition de semantique denotationnelle pour des réseaux de processus avec opérateur de melange équitable

DOI10.1016/0304-3975(82)90021-4zbMath0482.68020OpenAlexW2072134574MaRDI QIDQ1162807

F. Boussinot

Publication date: 1982

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(82)90021-4

zbMATH Keywords

powerdomainsdenotational semanticsnondeterminisminfinite computationfair oraclesmerge processsemantics of parallelism

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Theory of operating systems (68N25)

Related Items

A fully abstract trace model for dataflow and asynchronous networks, Towards a complete hierarchy of compositional dataflow models, Clocks in dataflow languages

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Effectively given domains
• Power domains
• Flowgraphs and Flow Algebras
• A Powerdomain Construction