A causal semantics for CCS via rewriting logic

DOI10.1016/S0304-3975(01)00165-7zbMath1026.68075MaRDI QIDQ1606128

Fabio Gadducci, Pierpaolo Degano, Corrado Priami

Publication date: 31 July 2002

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

process algebracausal semanticsrewriting logic

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) Grammars and rewriting systems (68Q42)

Related Items

Rewriting logic: Roadmap and bibliography, Executable structural operational semantics in Maude, SOS formats and meta-theory: 20 years after, Twenty years of rewriting logic, Causal computational complexity of distributed processes

Cites Work

• A partial ordering semantics for CCS
• Conditional rewriting logic as a unified model of concurrency
• Order-sorted algebra. I: Equational deduction for multiple inheritance, overloading, exceptions and partial operations
• A calculus of mobile processes. II
• Non-interleaving semantics for mobile processes
• Comparing locality and causality based equivalences
• Axiomatizing the algebra of net computations and processes
• Process algebra for synchronous communication
• Relating two categorical models of term rewriting
• CPO models for infinite term rewriting
• Proved trees
• Perspectives of System Informatics
• Rewriting logic as a semantic framework for concurrency: a progress report
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item