Merging regular processes by means of fixed-point theory

DOI10.1016/0304-3975(86)90045-9zbMath0602.68025OpenAlexW2118347493MaRDI QIDQ1082070

John-Jules Ch. Meyer

Publication date: 1986

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

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90045-9

zbMATH Keywords

fairnesscorrectnessrecursiondenotational semanticsinterleavingconcurrencyinfinite wordstrace theoryIterationfair mergeKleene-star iterationsemantics of processeswhile- statements

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of operating systems (68N25)

Related Items (7)

On the consistency of Koomen's fair abstraction rule ⋮ Infinite streams and finite observations in the semantics of uniform concurrency ⋮ Applications of compactness in the Smyth powerdomain of streams ⋮ Transition systems, metric spaces and ready sets in the semantics of uniform concurrency ⋮ Designing equivalent semantic models for process creation ⋮ Metric semantics for concurrency ⋮ Hiding in stream semantics of uniform concurrency

Cites Work

• Corrigendum: On infinite computations in denotational semantics
• A linear-history semantics for languages for distributed programming
• The \(\mu\)-calculus as an assertion-language for fairness arguments
• Effectively given domains
• Semantics of nondeterminism, concurrency, and communication
• A calculus of communicating systems
• Fixed point theorems and semantics: A folk tale
• A continuous semantics for unbounded nondeterminism
• Theory of \(\omega\)-languages. I: Characterizations of \(\omega\)-context- free languages
• Power domains
• Linear time and branching time semantics for recursion with merge
• A lattice-theoretical fixpoint theorem and its applications
• Countable nondeterminism and random assignment
• On the existence of optimal fixpoints
• The Category-Theoretic Solution of Recursive Domain Equations
• A term model for synchronous processes
• A Powerdomain Construction
• Concurrent Processes and Their Syntax
• Processes and the denotational semantics of concurrency
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Merging regular processes by means of fixed-point theory