cours.4

Metheg

Le téléchargement nécessite un accès à la bibliothèque YouScribe
Tout savoir sur nos offres

6 pages

English

Le téléchargement nécessite un accès à la bibliothèque YouScribe
Tout savoir sur nos offres

A propos
Informations
Extrait

Description

"Summary Bisimilarity Axiomatization Bisimulation up-to! Value-passing CCS Weak bisimilarity Summary Bisimilarity Axiomatization Bisimulation up-to! Value-passing CCS Weak bisimilarityOutlineConcurrency 51 A brief summary of the main notions seen in previousCCS - Up-to bisimulation. Weak bisimulation. lecturesAxiomatizations.2 Properties of bisimilarityBisimilarity is a congruenceCatuscia Palamidessi Some interesting bisimilaritiesINRIA Futurs and LIX - Ecole Polytechnique3 Axiomatization of strong bisimilarityThe other lecturers for this course: 4 Bisimulation up-to !Jean-Jacques Lévy (INRIA Rocquencourt) 5 Value-passing CCSJames Leifer (INRIAt)6 Weak Bisimilarity and Observation CongruenceEric Goubault (CEA)Properties of observation congruenceExample: FIFO Queueshttp://pauillac.inria.fr/˜leifer/teaching/mpri-concurrency-2005/1 2Summary Bisimilarity Axiomatization Bisimulation up-to! Value-passing CCS Weak bisimilarity Summary Bisimilarity Axiomatization Bisimulation up-to! Value-passing CCS Weak bisimilarityA brief summary: Syntax of CCS A brief summary: Labeled transition system for CCS(channel, port) names: a,b,c, . . .We assume a given set of deﬁnitions Dco-names: a,b,c, . . . Note: a = asilent action: !µ !P ! P µ=a,a[Act] [Res]actions, preﬁxes: µ ::= a | a | ! µ µ !µ.P ! P (!a)P ! (!a)Pprocesses: P,Q ::= 0 inactionµ µ! !P ! P Q ! Q| µ.P preﬁx [Sum1] [Sum2]µ µ! !P+Q ! P P+Q ! Q| P | Q parallel| P + Q (external) choiceµ µ! !| ("a)P ...

Informations