Observational trees as models for concurrency

DOI10.1017/S0960129599002935zbMath0954.68115OpenAlexW2048388169MaRDI QIDQ4946628

Stefano Kasangian, Anna Labella

Publication date: 23 March 2000

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0960129599002935

zbMATH Keywords

concurrent systemslabeled structured set of computations

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Applications of universal algebra in computer science (08A70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (5)

Generalising Conduché's theorem ⋮ A doctrinal approach to modal/temporal Heyting logic and non-determinism in processes ⋮ Tree-functors, determinacy and bisimulations ⋮ Conduché property and tree-based categories ⋮ Categories with sums and right distributive tensor product

This page was built for publication: Observational trees as models for concurrency