CONCUR 2005 – Concurrency Theory
From MaRDI portal
Publication:5897504
DOI10.1007/11539452zbMATH Open1134.68440OpenAlexW1737342522MaRDI QIDQ5897504FDOQ5897504
Authors: Éric Goubault, Emmanuel Haucourt
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11539452
Recommendations
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (11)
- From geometric semantics to asynchronous computability
- A geometric view of partial order reduction
- ST-structures
- Execution spaces for simple higher dimensional automata
- Geometric and combinatorial views on asynchronous computability
- Components of the fundamental category. II
- Natural Homology
- A ``geometric view of the dynamics of trajectories of computer programs
- Syntactic regions for concurrent programs
- Title not available (Why is that?)
- The geometry of semaphore programs
Uses Software
This page was built for publication: CONCUR 2005 – Concurrency Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897504)