Proved trees

DOI10.1007/3-540-55719-9_110MaRDI QIDQ5204353zbMATH OpenOpenAlexFDO

Authors 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

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 517055
• A note on causal trees and their applications to CCS
• Synchronization trees
• Observational trees as models for concurrency
• scientific article; zbMATH DE number 6708360

Cites work

• A calculus of communicating systems
• A partial ordering semantics for CCS
• A Theory of Communicating Sequential Processes
• A theory of processes with localities
• Algebraic laws for nondeterminism and concurrency
• Algèbre de processus et synchronisation
• An algebraic view of interleaving and distributed operational semantics for CCS
• Branching time and abstraction in bisimulation semantics
• Concurrent histories: a basis for observing distributed systems
• scientific article; zbMATH DE number 1638667 (Why is no real title available?)
• scientific article; zbMATH DE number 3885321 (Why is no real title available?)
• scientific article; zbMATH DE number 3911691 (Why is no real title available?)
• scientific article; zbMATH DE number 4074504 (Why is no real title available?)
• scientific article; zbMATH DE number 3716792 (Why is no real title available?)
• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• scientific article; zbMATH DE number 125888 (Why is no real title available?)
• scientific article; zbMATH DE number 176129 (Why is no real title available?)
• scientific article; zbMATH DE number 4119653 (Why is no real title available?)
• Location equivalence in a parametric setting
• Process algebra for synchronous communication
• Universal axioms for bisimulations

Cited in

(24)

• Non-interleaving semantics for mobile processes
• Names of the -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 of rewriting logic
• Gaining trust by tracing security protocols
• Concurrencies in reversible concurrent calculi
• General patterns of interaction in stochastic fusion
• Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
• From Gene Regulation to Stochastic Fusion
• Extended transition systems for parametric bisimulation
• Distribution and locality of concurrent systems
• Causality for mobile processes
• Read-write causality
• scientific article; zbMATH DE number 7288621 (Why is no real title available?)
• Distributed processes and location failures
• Replications in reversible concurrent calculi
• Locality and interleaving semantics in calculi for mobile processes
• Location equivalence in a parametric setting
• Alternative characterizations of hereditary history-preserving bisimilarity via backward ready multisets
• Expansion laws for forward-reverse, forward, and reverse bisimilarities via proved encodings
• A truly concurrent semantics for reversible CCS
• True trees are dense

This page was built for publication: Proved trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5204353)