Proved trees
From MaRDI portal
Publication:5204353
DOI10.1007/3-540-55719-9_110zbMath1425.68291MaRDI QIDQ5204353
Pierpaolo Degano, Corrado Priami
Publication date: 4 December 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-55719-9_110
68Q55: Semantics in the theory of computing
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Distributed processes and location failures, Locality and interleaving semantics in calculi for mobile processes, Location equivalence in a parametric setting, Non-interleaving semantics for mobile processes, Names of the \(\pi\)-calculus agents handled locally, Dynamic connectors for concurrency, A causal semantics for CCS via rewriting logic, Language-based performance prediction for distributed and mobile systems, Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra, From Gene Regulation to Stochastic Fusion