Domain theory for concurrency
From MaRDI portal
Recommendations
Cites work
- A calculus of communicating systems
- A calculus of mobile processes. II
- A fully abstract denotational model for higher-order processes
- A fully abstract relational model of syntactic control of interference
- A mixed linear and non-linear logic: Proofs, terms and models (extended abstract).
- A Powerdomain Construction
- A relational model of non-deterministic dataflow
- Algebraic laws for nondeterminism and concurrency
- Anytime, anywhere: modal logics for mobile ambients
- Bisimulation from open maps
- Categories for the working mathematician.
- Computational interpretations of linear logic
- Domain theory for concurrency
- Full abstraction for HOPLA.
- Full abstraction in the lazy lambda calculus
- HOPLA -- a higher-order process language
- scientific article; zbMATH DE number 439891 (Why is no real title available?)
- scientific article; zbMATH DE number 3858394 (Why is no real title available?)
- scientific article; zbMATH DE number 3903943 (Why is no real title available?)
- scientific article; zbMATH DE number 4103051 (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 3780545 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 3469994 (Why is no real title available?)
- scientific article; zbMATH DE number 3522182 (Why is no real title available?)
- scientific article; zbMATH DE number 1296290 (Why is no real title available?)
- scientific article; zbMATH DE number 515728 (Why is no real title available?)
- scientific article; zbMATH DE number 626734 (Why is no real title available?)
- Linear logic
- Models for concurrency: Towards a classification
- On powerdomains and modality
- Petri nets, event structures and domains. I
- Presheaf models for concurrency
- Presheaf models for the -calculus
- Profunctors, open maps and bisimulation
- Semantics of weakening and contraction
- Some Properties of Predicate Transformers
- The -calculus: A theory of mobile processes
- Time, clocks, and the ordering of events in a distributed system
Cited in
(13)- Four domains for concurrency
- Domain theory for concurrency
- Exploratory functions on nondeterministic strategies, up to lower bisimilarity
- Event structures with symmetry
- Event structure spans for nondeterministic dataflow
- Nominal Domain Theory for Concurrency
- A domain-theoretic model for a higher-order process calculus
- A linear metalanguage for concurrency
- scientific article; zbMATH DE number 2134913 (Why is no real title available?)
- Theoretical Aspects of Computing – ICTAC 2005
- Two-dimensional Kripke semantics. II: Stability and completeness
- Semantic domains of timed event structures
- Prime algebraicity
This page was built for publication: Domain theory for concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1434357)