Merging regular processes by means of fixed-point theory
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3846844 (Why is no real title available?)
- scientific article; zbMATH DE number 3808929 (Why is no real title available?)
- scientific article; zbMATH DE number 3808938 (Why is no real title available?)
- scientific article; zbMATH DE number 3808940 (Why is no real title available?)
- scientific article; zbMATH DE number 3821089 (Why is no real title available?)
- scientific article; zbMATH DE number 3658971 (Why is no real title available?)
- scientific article; zbMATH DE number 3688686 (Why is no real title available?)
- scientific article; zbMATH DE number 3707731 (Why is no real title available?)
- scientific article; zbMATH DE number 3714908 (Why is no real title available?)
- scientific article; zbMATH DE number 3716749 (Why is no real title available?)
- scientific article; zbMATH DE number 3716792 (Why is no real title available?)
- scientific article; zbMATH DE number 3729429 (Why is no real title available?)
- scientific article; zbMATH DE number 3735115 (Why is no real title available?)
- scientific article; zbMATH DE number 3755840 (Why is no real title available?)
- scientific article; zbMATH DE number 3755844 (Why is no real title available?)
- scientific article; zbMATH DE number 3770925 (Why is no real title available?)
- scientific article; zbMATH DE number 3793435 (Why is no real title available?)
- scientific article; zbMATH DE number 3430635 (Why is no real title available?)
- A Powerdomain Construction
- A calculus of communicating systems
- A continuous semantics for unbounded nondeterminism
- A lattice-theoretical fixpoint theorem and its applications
- A linear-history semantics for languages for distributed programming
- A term model for synchronous processes
- Concurrent Processes and Their Syntax
- Corrigendum: On infinite computations in denotational semantics
- Countable nondeterminism and random assignment
- Effectively given domains
- Fixed point theorems and semantics: A folk tale
- Linear time and branching time semantics for recursion with merge
- On the existence of optimal fixpoints
- Power domains
- Processes and the denotational semantics of concurrency
- Semantics of nondeterminism, concurrency, and communication
- The Category-Theoretic Solution of Recursive Domain Equations
- The \(\mu\)-calculus as an assertion-language for fairness arguments
- Theory of -languages. I: Characterizations of -context- free languages
Cited in
(10)- Linear time and branching time semantics for recursion with merge
- Metric semantics for concurrency
- Applications of compactness in the Smyth powerdomain of streams
- Hiding in stream semantics of uniform concurrency
- On the consistency of Koomen's fair abstraction rule
- Merging of weakly regnerative processes
- Merging of linear combinations to semistable laws
- Infinite streams and finite observations in the semantics of uniform concurrency
- Designing equivalent semantic models for process creation
- Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
This page was built for publication: Merging regular processes by means of fixed-point theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1082070)
