A causal semantics for CCS via rewriting logic

Authors:
Pierpaolo Degano;Fabio Gadducci;Corrado Priami
Affiliations:
Univ. di Pisa, Pisa, Italy;Univ. di Pisa, Pisa, Italy;Univ. di Verona, Verona, Italy
Venue:
Theoretical Computer Science
Year:
2002

Citing 17
Cited 4

Communicating sequential processes

Communicating sequential processes
Computational semantics of term rewriting systems

Algebraic methods in semantics
Communication and concurrency

Communication and concurrency
A partial ordering semantics for CCS

Theoretical Computer Science
Conditional rewriting logic as a unified model of concurrency

Selected papers of the Second Workshop on Concurrency and compositionality
Order-sorted algebra I: equational deduction for multiple inheritance, overloading, exceptions and partial operations

Theoretical Computer Science
A calculus of mobile processes, I

Information and Computation
Comparing locality and causality based equivalences

Acta Informatica
Enhanced operational semantics

ACM Computing Surveys (CSUR)
Non-interleaving semantics for mobile processes

Theoretical Computer Science
CPO Models for Infinite Term Rewriting

AMAST '95 Proceedings of the 4th International Conference on Algebraic Methodology and Software Technology
Causal Trees

ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Proved Trees

ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Rewriting Logic as a Semantic Framework for Concurrency: a Progress Report

CONCUR '96 Proceedings of the 7th International Conference on Concurrency Theory
Rational Term Rewriting

FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Relating Two Categorial Models of Term Rewriting

RTA '95 Proceedings of the 6th International Conference on Rewriting Techniques and Applications
Axiomatizing Permutation Equivalence in the Lambda-Calculus

Proceedings of the Third International Conference on Algebraic and Logic Programming

SOS formats and meta-theory: 20 years after

Theoretical Computer Science
Prototyping SOS Meta-theory in Maude

Electronic Notes in Theoretical Computer Science (ENTCS)
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic

All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
Transforming SOS specifications to linear processes

FMICS'11 Proceedings of the 16th international conference on Formal methods for industrial critical systems

Quantified Score

Hi-index	5.23

Visualization

Abstract

We consider two operational semantics for CCS defined in the literature: the first exploits proved transition systems (PTS) and the second rewriting logic (RL). We show that the interleaving interpretation of both semantics agree, in that they define the same transitions and exhibit the same non-deterministic structure. In addition, we study causality in CCS computations. We recall its treatment via PTS, exhibiting the notion of causality presented in the literature, and we show how to recast it in the RL semantics via suitable axioms. Also in this case, the two semantics agree.