Georgia Carabetta, Pierpaolo Degano, Fabio Gadducci  Home/Search
Context Related
| di.unipi.it/~gadducci/paper...WRLA98.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: di.unipi.it/~gadducci/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider (a slight variant of) the ccs calculus, and we analyze two operational semantics 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 nondeterministic structure. In addition, we study causality in ccs computations. We recall the treatment via pts, that exhibits the notion of causality... (Update)
Context of citations to this paper: More
...in [20] Acknowledgments. We are grateful to Georgia Carabetta for the many interesting discussions: the present paper is based on a previous work by her and the rst two authors [4], where a weaker correspondence between sequents and proved transitions was established. We are...
...synchronization. How to solve these details in the particular case of Milner s CCS [12] was already shown in [10] Moreover, the papers [4,8] showed the good properties of this semantic mapping for CCS. With the availability of the rst release of the Maude system in 1999 [6]...
Cited by: More
Executable Structural Operational Semantics in Maude - Verdejo, Martí-Oliet (2003) (Correct)
Rewriting Logic Semantics: From Language Specifications To.. - Meseguer, Rosu (2004) (Correct)
Implementing CCS in Maude 2 - Verdejo, Martí-Oliet (2002) (Correct)
Similar documents (at the sentence level):
18.6%: A Causal Semantics for CCS via Rewriting Logic - Degano, Gadducci, Priami (2000) (Correct)
Active bibliography (related documents): More All
0.3: An Algebraic Presentation of Term Graphs, via GS-Monoidal.. - Corradini, Gadducci (1999) (Correct)
0.3: Causality and Replication in Concurrent Processes - Degano, Gadducci, Priami (1999) (Correct)
0.3: Unknown - (Correct)
Similar documents based on text: More All
0.2: On Relating Some Models for Concurrency - Degano, Gorrieri, Vigna (1993) (Correct)
0.2: Electronic Notes in Theoretical Computer Science 66 No. 4 (2002) - Url Http Www (Correct)
0.2: Constructing specific SOS semantics for concurrency via.. - Bodei, al. (Correct)
Related documents from co-citation: More All
5: Implementing CCS in Maude - Verdejo, Mart'i-Oliet
3: Foundations of Modular SOS - Mosses - 1999
3: Communication and Concurrency (context) - Milner - 1989
BibTeX entry: (Update)
G. Carabetta, P. Degano, and F. Gadducci. CCS semantics via proved transition systems and rewriting logic. In C. Kirchner and H. Kirchner, editors, Rewriting Logic and its Applications, volume 15 of Electronic Notes in Theoretical Computer Science. Elsevier Sciences, 1999. Available at http: //www.elsevier.nl/locate/entcs/volume15.html/. http://citeseer.ist.psu.edu/carabetta98ccs.html More
@misc{ carabetta99ccs,
author = "G. Carabetta and P. Degano and F. Gadducci",
title = "CCS semantics via proved transition systems and rewriting logic",
text = "G. Carabetta, P. Degano, and F. Gadducci. CCS semantics via proved transition
systems and rewriting logic. In C. Kirchner and H. Kirchner, editors, Rewriting
Logic and its Applications, volume 15 of Electronic Notes in Theoretical
Computer Science. Elsevier Sciences, 1999. Available at http: //www.elsevier.nl/locate/entcs/volume15.html/.",
year = "1999",
url = "citeseer.ist.psu.edu/carabetta98ccs.html" }
Citations (may not include all citations):2732 Communicating Sequential Processes (context) - Hoare - 1985
1933 Communication and Concurrency (context) - Milner - 1989
906 A structural approach to operational semantics - Plotkin - 1981
854 Information and Computation (context) - Milner, Parrow et al. - 1992
299 Conditional rewriting logic as a unified model of concurrenc.. (context) - Meseguer - 1992
218 Process algebra for synchronous communication (context) - Bergstra, Klop - 1984
173 Order sorted algebra I: Equational deduction for multiple in.. - Goguen, Meseguer - 1992
91 Rewriting logic as a semantic framework for concurrency: A p.. - Meseguer - 1996
76 The polyadic -calculus: A tutorial - Milner - 1993
69 Causal trees (context) - Darondeau, Degano - 1989
67 Computational semantics of term rewriting systems (context) - Boudol - 1985
47 Proved trees (context) - Degano, Priami - 1992
45 A non-interleaving semantics for CCS based on proved transit.. (context) - Boudol, Castellani - 1988
27 the Algebraic Approach to Concurrent Term Rewriting - Gadducci - 1996
25 A partial ordering semantics for CCS (context) - Degano, De Nicola et al. - 1990
21 Non interleaving semantics for mobile processes - Degano, Priami - 1995
19 Axiomatizing permutation equivalence in the -calculus (context) - Laneve, Montanari - 1996
17 Relating two categorical models of term rewriting - Corradini, Gadducci et al. - 1995
17 Enhanced operational semantics - Degano, Priami - 1996
14 rewriting rules and CCS (context) - Gadducci, Montanari - 1996
11 Rewriting logic as a logical and semantical framework (context) - Mart'i-Oliet, Meseguer - 1997
11 Rational term rewriting - Corradini, Gadducci - 1998
10 CPO Models for infinite term rewriting - Corradini, Gadducci - 1995
5 Comparing causality and locality based equivalences (context) - Kiehn - 1994
Documents on the same site (http://www.di.unipi.it/~gadducci/papers/): More
Causality and Replication in Concurrent Processes - Degano, Gadducci, Priami (1999) (Correct)
Functorial Semantics for Multi-algebras - Corradini, Gadducci (1998) (Correct)
An Algebraic Presentation of Term Graphs, via GS-Monoidal.. - Corradini, Gadducci (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC