Weak Bisimilarity Coalgebraically Andrei Popescu Department of Computer Science University of Illinois.

Slides:



Advertisements
Similar presentations
T YPE I SOMORPHISM O LA M AHMOUD S UPERVISED BY : D R. M ARCELO F IORE UNIVERSITY OF CAMBRIDGE Computer Laboratory Theory & Semantics Group I NTRODUCTION.
Advertisements

Completeness and Expressiveness
CommUnity, Tiles and Connectors joint work with Roberto Bruni José Luiz Fiadeiro Antónia Lopes Ugo Montanari Ivan Lanese Dipartimento di Informatica Università.
Connectors and Concurrency joint work with Ugo Montanari Roberto Bruni Dipartimento di Informatica Università di Pisa Dagstuhl Seminar #04241, September.
Introduction The concept of transform appears often in the literature of image processing and data compression. Indeed a suitable discrete representation.
SLD-resolution Introduction Most general unifiers SLD-resolution
Event structures Mauro Piccolo. Interleaving Models Trace Languages:  computation described through a non-deterministic choice between all sequential.
Programming Paradigms for Concurrency Lecture 11 Part III – Message Passing Concurrency TexPoint fonts used in EMF. Read the TexPoint manual before you.
Lecture 6 Hyperreal Numbers (Nonstandard Analysis)
Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Marcello Bonsangue, Stefan Milius, Alexandra Silva Coalgebras and Generalized Regular.
Foundations of Interaction ETAPS `05 0 Ex nihilo: a reflective higher- order process calculus The  -calculus L.G. Meredith 1 & Matthias Radestock.
Traced Premonoidal Categories Nick Benton Microsoft Research Martin Hyland University of Cambridge.
A Semantic Characterization of Unbounded-Nondeterministic Abstract State Machines Andreas Glausch and Wolfgang Reisig 1.
Department of mathematics and computer science 1 of 21 Rob van Glabbeek (Sydney) Marc Voorhoeve (TUE) Liveness, Fairness and Impossible Futures.
Solving Partial Order Constraints for LPO termination.
1 Ivan Lanese Computer Science Department University of Bologna Roberto Bruni Computer Science Department University of Pisa A mobile calculus with parametric.
Catriel Beeri Pls/Winter 2004/5 type reconstruction 1 Type Reconstruction & Parametric Polymorphism  Introduction  Unification and type reconstruction.
1 Ivan Lanese Computer Science Department University of Bologna Italy Behavioural Theory for SSCC Joint work with Luis Cruz-Filipe, Francisco Martins,
Bridging the gap between Interaction- and Process-Oriented Choreographies Talk by Ivan Lanese Joint work with Claudio Guidi, Fabrizio Montesi and Gianluigi.
New insights on architectural connectors joint work with Roberto Bruni University of Pisa, Italy Ugo Montanari University of Pisa, Italy José Luiz Fiadeiro.
07/06/98 知的インタフェース特論 1 Operational Semantics Again, the question? Operational Model = Labeled Transition System If P and Q yields a same LTS. How to define.
1 Ivan Lanese Computer Science Department University of Bologna Italy Concurrent and located synchronizations in π-calculus.
Schemas as Toposes Steven Vickers Department of Pure Mathematics Open University Z schemas – specification1st order theories – logic geometric theories.
1 Ivan Lanese Computer Science Department University of Bologna Italy Behavioural Theory at Work: Program Transformations in a Service-centred Calculus.
An algebra of Connectors for modeling CommUnity with Tiles joint work with Roberto Bruni Ugo Montanari Dipartimento di Informatica Università di Pisa Ivan.
Programming Language Semantics Denotational Semantics Chapter 5 Part III Based on a lecture by Martin Abadi.
Complete Axioms for Stateless Connectors joint work with Roberto Bruni and Ugo Montanari Dipartimento di Informatica Università di Pisa Ivan Lanese Dipartimento.
Synchronizations with Mobility for Graph Transformations joint work with Ugo Montanari Dipartimento di Informatica Università di Pisa Ivan Lanese Dipartimento.
Mathematical Operational Semantics and Finitary System Behaviour Stefan Milius, Marcello Bonsangue, Robert Myers, Jurriaan Rot.
The Church-Turing Thesis over Arbitrary Domains Udi Boker and Nachum Dershowitz Presenting: Yorai Geffen.
Scott Closed Set Lattices And Applications 1. Some preliminaries 2. Dcpo-completion 3. Equivalence between CONP and CDL 4. The Hoare power domain 5. Scott.
Coalgebraic Symbolic Semantics Filippo Bonchi Ugo Montanari.
Benjamin Gamble. What is Time?  Can mean many different things to a computer Dynamic Equation Variable System State 2.
Discrete dynamical systems and intrinsic computability Marco Giunti University of Cagliari, Italy
© Kenneth C. Louden, Chapter 11 - Functional Programming, Part III: Theory Programming Languages: Principles and Practice, 2nd Ed. Kenneth C. Louden.
SDS Foil no 1 Process Algebra Process Algebra – calculating with behaviours.
Mathematical Operational Semantics and Finitary System Behaviour Stefan Milius, Marcello Bonsangue, Robert Myers, Jurriaan Rot.
Advanced Topics in SE Spring Process Algebra Hossein Hojjat Formal Methods Lab University of Tehran.
Reactive systems – general
Rewriting Logic Model of Compositional Abstraction of Aspect-Oriented Software FOAL '10Mar. 15, 2010 Yasuyuki Tahara, Akihiko Ohsuga The University of.
Coalgebraic components in a many-sorted microcosm Ichiro Hasuo Kyoto, JP Chris Heunen Nijmegen, NL (  Oxford, UK) Bart Jacobs Nijmegen, NL Ana Sokolova.
Formal Specification of Intrusion Signatures and Detection Rules By Jean-Philippe Pouzol and Mireille Ducassé 15 th IEEE Computer Security Foundations.
© Kenneth C. Louden, Chapter 11 - Functional Programming, Part III: Theory Programming Languages: Principles and Practice, 2nd Ed. Kenneth C. Louden.
Albert Gatt LIN3021 Formal Semantics Lecture 4. In this lecture Compositionality in Natural Langauge revisited: The role of types The typed lambda calculus.
Categorical Categorical theory of state-based systems in Sets : bisimilarity in Kleisli: trace semantics [Hasuo,Jacobs,Sokolova LMCS´07] in Sets : bisimilarity.
Naïve Set Theory. Basic Definitions Naïve set theory is the non-axiomatic treatment of set theory. In the axiomatic treatment, which we will only allude.
CS 103 Discrete Structures Lecture 13 Induction and Recursion (1)
MPRI – Course on Concurrency Lectures 11 and 12 The pi-calculus expressiveness hierarchy Catuscia Palamidessi INRIA Futurs and LIX
Discrete Simulation of Behavioural Hybrid Process Calculus Tomas Krilavičius Helen Shonenberg University of Twente.
2G1516 Formal Methods2005 Mads Dam IMIT, KTH 1 CCS: Processes and Equivalences Mads Dam Reading: Peled 8.5.
Fall 2008Programming Development Techniques 1 Topic 17 Assignment, Local State, and the Environment Model of Evaluation Section 3.1 & 3.2.
On the origins of Bisimulation & Coinduction
Behavioral Extensions of Institutions Andrei Popescu Grigore Roşu University of Illinois at Urbana-Champaign.
CSC3315 (Spring 2009)1 CSC 3315 Languages & Compilers Hamid Harroud School of Science and Engineering, Akhawayn University
Chapter 5 Finite Automata Finite State Automata n Capable of recognizing numerous symbol patterns, the class of regular languages n Suitable for.
Operational Semantics Mooly Sagiv Tel Aviv University Sunday Scrieber 8 Monday Schrieber.
Process Algebra (2IF45) Basic Process Algebra Dr. Suzana Andova.
Operational Semantics Mooly Sagiv Reference: Semantics with Applications Chapter 2 H. Nielson and F. Nielson
Towards a Semantic Model for Java Wildcards Sophia Drossopoulou Mariangiola Dezani-Ciancaglini Imperial College London Università di Torino Italy Nicholas.
Rewriting Nested Graphs, through Term Graphs Roberto Bruni, Andrea Corradini, Fabio Gadducci Alberto Lluch Lafuente and Ugo Montanari Dipartimento di Informatica,
Functions of Complex Variable and Integral Transforms
Unit-III Algebraic Structures
Axioms for a category of spaces
Process Algebra (2IF45) Expressiveness of BPArec
IDEALS AND I-SEQUENCES IN THE CATEGORY OF MODULES
A Complete Symbolic Bisimulation for Full Applied Pi Calculus
Internet of Things A Process Calculus Approach
Defining A Formal Semantics For The Rosetta Specification Language
Algebraic Trace Theory
Presentation transcript:

Weak Bisimilarity Coalgebraically Andrei Popescu Department of Computer Science University of Illinois

Context and motivation Process algebra: SOS presentations: one-step behavior Process equivalence: weak bisimilarity: arbitrarily long sequences of silent (unobservable) actions Consequence: Modular reasoning difficult Put in other words: No modular denotational semantics transparent from the syntactic setting

My contribution Introduce a coalgebraic semantic domain for weak bisimilarity Define a modular fully-abstract denotational semantics for CCS under weak bisimilarity Construction quite general – would work for many process algebras

Weak bisimilarity recalled Labeled Transition System (LTS) over Act  {τ}: ,   Proc – processes a, b  Act – “loud” (observable) actions τ – silent (unobservable) action  α  Act  {τ} For each α,  α   Proc  Proc Alternative view: coalgebra for the functor X  |   ((Act  {τ})  X)

Weak bisimilarity recalled  and  weakly bisimilar iff:   τ   ’ implies   τ*   ’ for some  ’ such that  ’ and  ’ are weakly bisimilar   τ*   ’  a   ’’  τ*   ’’’ implies   τ*   ’  a   ’’  τ*   ’’’ for some  ’,  ’’,  ’’’ s.t.  ’’’ and  ’’’ are weakly bisimilar And vice versa And so on, indefinitely

Coalgebraic semantic domain for weak bisimilarity Why coalgebraic? 1.CALCO 2.Alternative: domain theory: problem with infinite branching: breaks compactness – an infinite process/tree no longer determined by its finite subtrees 3.On the “good” side of losing compactness: no need for finiteness/guardedness conditions on syntax

Coalgebraic semantic domain for weak bisimilarity For strong bisimilarity: both syntax and semantics form coalgebras For weak bisimilarity: structural axioms added: τ absorbed Aczel – Final universes of processes, 1993: τ-system: LTS on Act  {τ} s.t., for all processes ,  ’,  ’’ and action α: –   τ   –   τ   ’  α   ’’ implies   α   ’’ –   α   ’  τ   ’’ implies   α   ’’ The final τ-system – semantic domain for processes under weak bisimilarity

Coalgebraic semantic domain II Rephrasing: partial “concatenation” operation, on ((Act  {τ})  {τ})  ({τ}  (Act  {τ})), defined by α τ = τ α = α τ-system: pair (A,  : (Act  {τ})  Rel(A)), with  : –compatible w.r.t. _ _ versus relation composition –super-commutes with the identity (i.e., maps τ to a superset of Diag(A) )

Coalgebraic semantic domain III Problem with this domain: –describes process in single-step depth only –hence unnatural for accommodating operations (such as parallel composition) that need to explore processes in more depth Thus: to know where  |  transits to silently (via τ- transitions), need to know where  and  transit via arbitrarily long sequences of actions. E,g.:   a   ’  b ־   ’’   a ־   ’  b   ’’  |   τ*   ’’ |  ’’

Coalgebraic semantic domain IV Natural improvement of the domain: consider arbitrary sequences (while still absorbing τ), i.e.: τ is now the empty sequence, an element of Act* τ-*-system: pair (A,  ), with  : Act*  Rel(A) 1.morphism of semigroups between (Act*, _ _) and (Rel(A), ;) 2.again, super-commutes with the identity The categories of τ-systems and τ-*-systems (regarded as coalgebras) are isomorphic:  in a τ-*-system uniquely determined by its restriction to Act  {τ} and condition 1

Coalgebraic semantic domain V Spelling out the above: Act*-coalgebra s.t., for all ,  ’,  ’’ and u,v  Act*: –   τ   –   u   ’  v   ’’ implies   uv   ’’ –   uv   ’’ implies  ’.   u   ’   ’  v   ’’

Application: denotational semantics for CCS Syntax: –a, b  Act – loud actions – ־ : Act  Act involutive bijection –τ – silent action  –α  Act  {τ} –X  Var, countable set of process variables –P  Proc, set of (process) terms: P ::=... | X | P | Q |  X. P

Denotational semantics for CCS II Transition system: P  α  P’ Q  α  Q’ P | Q  α  P’ | Q P | Q  α  P | Q’ P  a  P’ Q  a ־  Q’ P[(  X. P) / X]  α  Q’ P | Q  τ  P’ | Q’  X. P  α  Q’

Denotational semantics for CCS III First step: modify transition system to describe behavior along sequences of actions: P[(  X. P) / X]  u  Q’ P  u  P’ Q  v  Q’ [w  u | v]  X. P  u  Q’ P | Q  w  P’ | Q’ with | : Act*  Act*   (Act*) defined recursively: –τ | τ = {τ} –(a u) | (b v) = a (u | (b v))  b ((a u) | v)  u | v, if b = a ־

Denotational semantics for CCS IV Theorem: Weak bisimilarity of the original system coincides with strong bisimilarity of the sequence- based system. Transformation seems to work not only for CCS, but for a general class of process algebras, as in van Glabbeek – On cool congruence formats for weak bisimulations, 2005 (building on previous work by B. Bloom)

Denotational semantics for CCS V Second step: denotational semantics for the sequence-based system into our sequence-based domain (the final τ-*- system) Almost falls under general theory: –Rutten – Processes as terms: Non-well-founded models for bisimulation, 1992 –Turi, Plotkin – Towards a mathematical operational semantics, 1997 E.g., SOS rule for parallel composition transliterates into Unfold(  |  ) = {(w,  ’ |  ’).  u, v. (u,  ’)  Unfold(  )  (v,  ’)  Unfold(  )  w  u | v}

Denotational semantics for CCS VI Recursion rule P[(  X. P) / X]  u  Q’  X. P  u  Q’ Further modified into an equivalent “well-founded” rule: P[P / X]ⁿ  u  Q’ [n  N]  X. P  u  Q’[(  X. P) / X] Corresponding second-order semantic operator on the final τ-*-system: Rec : (Proc  Proc)  Proc, Unfold(Rec F) = {(u, G(Rec F)).  n  1. . (u, G  )  Unfold(Fⁿ  )}

Denotational semantics for CCS VII Thus: we have semantic operators corresponding to the syntactic constructs P |  [[P]] denotes the standard interpretation of terms in the semantic domain via environments Theorem (Full abstraction): The following are equivalent: –[[P]] = [[Q]] –P and Q are strongly bisimilar in the sequence-based system –P and Q are weakly bisimilar in the original system

Denotational semantics for CCS (parenthesis) Alternative to using numbers when defining semantic recursion: Peter Aczel’s approach from “Final universes of processes”: –no semantic operator for recursion –instead: give recursion a special treatment, integrating it globally into the semantics Theorem: There exists a unique “least non-deterministic” map [[ _ ]] from terms to processes such that: –[[ _ ]] satisfies the transliterated semantic equations for all operators except  –[[  X. P ]] = [[ P[(  X. P) / X] ]]

Future work Employ the sequence-based semantics for weak bisimilarity in modular theorem proving: –knowledge of behavior along arbitrary traces necessary for knowledge about silent-step behavior, –thus having the former knowledge explicitly represented seems helpful Prove, for systems in a general SOS format, also incorporating syntax with bindings / substitution –soundness of the one-step to multi-step transformation –the full abstraction theorem

Future work and more related work Cover issues such as name-passing and scope extrusion (i.e., systems in the  -calculus family) Much existing work on compositional semantics for  under strong bisimilarity: –Domain-theoretic: Stark 1996; Fiore, Moggi, Sangiorgi 1996; Staton – Ph.D. thesis, 2007 –Coalgebraic: Honsell, Lenisa, Montanari, Pistore, 1998, Lenisa – Ph.D. thesis, For weak bisimilarity: Popescu – Tech. report, 2009: employ the same technique as for CCS + parameterize parallel composition with all the dynamic topological information: –semantics is compositional and fully abstract –but technically too complicated, hence not very useful for modular reasoning

Future work and more related work More insightful approach for  -like calculi: Shall be based on levels of information, as in, e.g., Stark 1996 and Fiore et al. 1996: a process at level n knows n channel names Challenge: define the appropriate categorical structure for an index- free treatment –Objects: natural numbers –“Vertical” morphisms: m  n – as before,  map between m and n treated as finite sets (intuition: renaming) –“Horizontal” morphisms: n  w  n + p iff the sequence of actions w increases the number of known channels from n to n + p –Domain: Functor from this category into the category Rel, of sets and relations –Hopefully: Syntax – initial domain; semantics – final domain

Thank you!