Strong bisimilarity can be opened
|
|
- Oswin Cain
- 6 years ago
- Views:
Transcription
1 Strong bisimilarity can be opened Henning E. Andersen Hans Hüttel Karina N. Jensen June 7, 2002 Abstract We present an extension of the semantics of the π-calculus without match where strong bisimilarity in the extended semantics is a process congruence and coincides with open bisimilarity in the usual semantics. In fact, in the extended semantics, strong, late, early and open bisimilarity coincide and coincide with barbed congruence. This result leads to a simple axiom system for the finite fragment of the π-calculus without match. 1 Introduction One of the goals of a process calculus is to allow equational reasoning about processes, reducing questions of behavioural equivalence to equality in a suitable equational theory. An important requirement of a notion of behavioural equivalence is that it is a congruence, i.e. preserved under all syntactic operators of the calculus. Since the appearance of the π-calculus, various notions of bisimulation equivalence have been defined for the π-calculus. The obvious notion of bisimilarity is strong bisimilarity. Processes P and Q are strong bisimilar if any transition P α P can be matched by a transition Q α Q such that P and Q are strong bisimilar. While intuitively pleasing, strong bisimilarity is not a congruence, nor does it take the value-passing nature of the π-calculus into account. Late and early bisimilarity were therefore proposed by Milner et al. in [5]. Unfortunately, these notions of equivalence also fail to be congruences; in particular, they are not preserved by input prefix. The remedy for this is to identify and characterize the maximal process congruences contained in late and early bisimilarity. A third possibility is barbed bisimilarity [6] by Milner and Sangiorgi. Barbed bisimilarity also fails to be a process congruence; again, the remedy is to define the maximal process congruence contained in barbed bisimilarity. Department of Computer Science, Aalborg University, 9220 Aalborg Ø, Denmark. hans@cs.auc.dk 1
2 Subsequently, in [9], Sangiorgi proposed open bisimilarity which has the pleasant property of being preserved by all process constructs. The remedy is here to require that matching transitions must match under all name substitutions. Since then, a number of subcalculi have been identified for which the four notions of bisimilarity coincide. Most importantly, this is case for the asynchronous π-calculus [2, 4, 3]. Here, a process does not continue after an output action. Moreover, Sangiorgi has identified a private π-calculus where the equivalences coincide. In the private π-calculus, any output action must output a fresh name. In [1] Boreale and Sangiorgi consider the problem of giving a labelled characterization of barbed congruence for the π-calculus without the match construct. This calculus forms a natural subcalculus. In particular, programming languages based on the π-calculus and related calculi such as Pict [7] do not have a match construct. In this paper we also consider the π-calculus without match or mismatch. We present a new semantics of this calculus which has the property that strong bisimilarity in the new semantics is a process congruence and coincides with open bisimilarity in the usual semantics of the π-calculus for a calculus without the match and mismatch constructs. This result allows us to define a simple axiom system for open bisimilarity. Moreover, early congruence and barbed congruence still coincide, giving us a simple labelled characterization of barbed congruence in our extended semantics. 2 The π-calculus without match 2.1 Syntax We shall consider a version of the monadic π-calculus where the syntactic categories are names, N, ranged over by a, b, c,..., x, y, z..., actions, Act and processes, P π. Definition 2.1 The syntax of processes and actions is defined as follows: Actions: α ::= x(b) x a τ Processes: P ::= 0 α.p P 1 + P 2 P 1 P 2 (νx) P!P In an action x(b) or x a we call x the subject and a the object. Restriction and input prefix both act as name binders. The set of bound names in P is denoted by bn(p ). If processes P and Q are α-convertible, we write P α Q. A name occurrence which is not bound is free. We let n(p ) = fn(p ) bd(p ). A substitution is a function σ : N N which, simultaneously renames the free names in a process. We write σ = x = y if σ(x) = σ(y). 2
3 A process context is a process expression with a single hole: Contexts: C ::= [] α.c P + C C + P P C C P (νx) C!C If C is a process context, C[P ] denotes the process where P replaces the hole. A relation is a process congruence if it is preserved in all process contexts. Definition 2.2 Let = be an equivalence relation over P π. = is a process congruence if whenever P = Q we have that C[P ] = C[Q] for any process context C. 2.2 Structural congruence Structural congruence describes the identifications that must always be made, such as the order of parallel components being unimportant. Definition 2.3 Structural congruence over P π, denoted, is the least process congruence over P π, which satisfies the following clauses: P Q if P α Q!P P!P P + 0 P P + Q Q + P P + (Q + R) (P + R) + Q P 0 P P Q Q P P (Q R) (P Q) R (νx) 0 0 (νx)y P (νy)x P 2.3 Semantics (νx) (P Q) P (νx) Q, if x / fn(p ) The standard labelled transition semantics for the π-calculus is given by (P π, Act, ) where transitions are of the form P α Q.The transition relation is defined by the rules in table 1. 3 Bisimulation equivalences For any labelled transition semantics of the π-calculus we can define a number of bisimulation equivalences. 3
4 (Pre) α.p α P (Par) P α P P Q α P Q bn(α) fn(q) = (Sum) P α P P + Q α P (Res) P α P (νx) P α (νx) P x / n(α) (Com) P x a P Q x(b) Q P Q τ P {a/b}q (Str) P α P Q α Q P Q and P Q 3.1 Strong bisimulation Table 1: Standard labelled transition rules Definition 3.1 Let (P π, Act, ) be a labelled transition system and let R be a symmetric binary relation over P π. R is a strong bisimulation over (P π, Act, ) if P RQ implies that if P α P then there exists a Q, with the property that Q α Q and P RQ. Definition 3.2 P, Q P π are strong bisimilar, denoted P Q, if there exists a strong bisimulation R such that P RQ. 3.2 Late and early bisimilarity Late and early bisimilarity originated in [5] Definition 3.3 A symmetric binary relation R over P π is a late bisimulation, if P RQ implies that 1. if P x(b) P, then for some Q, Q x(b) Q and for all names a we have {a/b}p R{a/b}Q. 2. if P α P and α is any other action, for some Q, we have Q α Q and P RQ. Definition 3.4 Processes P and Q are late bisimilar, denoted P L Q, if there exists a late bisimulation R, such that P RQ. If one reverses the existential quantifiers in the input clause one obtains early bisimulation. Definition 3.5 A symmetric binary relation R over P π is an early bisimulation, if P RQ implies, that 4
5 1. if P x(b) P, for all names a, there exists a process Q, such that Q x(b) Q and {a/b}p R{a/b}Q. 2. if P α P for α is any other action, then there exists a process Q, such that Q α Q and P RQ. Definition 3.6 Processes P and Q are early bisimilar, denoted P E Q, if there exists an early bisimulation R, such that P RQ. Late bisimilarity implies early bisimilarity, which in turn implies strong bisimilarity. The inclusions are strict. Proposition 3.7 E L An essential property which a behavioural relation should satisfy is that it is preserved by all syntactic constructs. Neither strong, late nor early bisimilarity has this property as the following standard example shows. Example 3.8 Let x, y N be distinct names and x and y stand for x a.0 and y(b).0, respectively. We then have that x y L x.y + y. x as R = {( x y, x.y + y. x), (y, y), ( x, x), (0, 0)} is a strong bisimulation. However, a(x).( x y) E a(x).( x.y + y. x). The counterexample exploits that early bisimilarity is not preserved under name substitution. In particular, if a substitution σ has σx = σy, ȳ y ȳ.y + y.ȳ as ȳ y τ 0. Definition 3.9 Processes P and Q are late congruent, denoted P L Q, if for all substitutions σ we have that σp L σq. Definition 3.10 Processes P and Q are early congruent, denoted P E Q, if for all substitutions σ we have that σp E σq. 3.3 Barbed congruence Barbed bisimilarity originated in [6]. Definition 3.11 The barbs of a process P are defined by P m if P my P for some y P m if P m y P for some y Definition 3.12 A symmetric binary relation R på P π is a barbed bisimulation, if P RQ implies that 1. For all µ P µ iff Q µ 2. if P τ P, for some Q, we have Q τ Q and P RQ. 5
6 Definition 3.13 Processes P and Q are barbed bisimilar, denoted P Q, if there exists a barbed bisimulation R, such that P RQ. Barbed bisimilarity fails to be a congruence for the same reasons as late and early bisimilarity. Again, the solution is to define the congruence explicitly. Definition 3.14 Processes P and Q are barbed congruent, denoted P Q, if for all contexts C we have that C[P ] C[Q]. Barbed congruence coincides with early congruence [8]. Theorem 3.15 = E 3.4 Open equivalence Open bisimilarity, proposed by Sangiorgi [9], is born a congruence since the universal quantification over substitutions occurs within the clauses for matching transitions. Definition 3.16 A symmetric binary relation R på P π is a open bisimulation, hvis P RQ for alle substitutions σ, implies, at 1. if σp α P, then for some Q, σq α Q and P RQ. Definition 3.17 P, Q P π are open bisimilar, denoted P O Q, if there exists an open bisimulation R, such that P RQ. The congruence problem of Example 3.8 now disappears. Example 3.18 We noticed before that {x/y} x y allows a τ-action. At the same time, notice that {a/y} x.y + y. x cannot match this τ-action, no matter whether a = x or a x. Thus x y O x.y + y. x. A strong bisimulation which is closed under substitutions is in fact an open bisimulation. Definition 3.19 A binary relation R over P π is closed under a substitution σ, if P RQ implies, that σp RσQ. Theorem 3.20 Assume that a binary relation R over P π satisfies the following conditions: 1. R is a strong bisimulation. 2. R is closed under all substitutions. Then R is a open bisimulation. 6
7 (Com2) P x a e P Q y(b) e Q P Q (x=y)τ e P {a/b}q Table 2: The (Com2) rule The reverse implication is false; a counterexample can be found in [9, Section 3.3]. A main result of [9] is Theorem 3.21 Open equivalence is the maximal strong bisimulation, which is closed under all substitutions. Open bisimilarity respects all other process constructs [9], so we have Theorem 3.22 Open equivalence is a process congruence. However, even though we now no longer need to pass via a notion of congruence closure, we still have to live with a universal quantification over substitutions. The rest of our paper is devoted to overcoming this problem. 4 An extended semantics for the π-calculus The problem in example 3.8 boils down to the fact that the process x y is capable of a τ-action under some substitutions whilst x.y + y. x will never be able to perform a τ-action. We deal with this problem by extending the labelled transition semantics with the action(x = y)τ, henceforth referred to as a conditional τ - action, and a corresponding transition rule. Intuitively, P (x=y)τ P means that P τ P if x is instantiated to the same name as y. Definition 4.1 The extended semantics of the π-calculus is given by the labelled transition system (P π, Act {(x = y)τ}, e ), where e is the least relation closed under the rules in Tables 1 and 2. Strong, early, late and open bisimilarity are defined as before, the only difference being that we now consider the transition system (P π, Act {(x = ) y)τ}, e. The corresponding equivalences are denoted with the superscript e, so e.g. e is strong bisimilarity in the extended semantics. In the extended semantics, the congruence problem now goes away at the level of strong bisimilarity. 7
8 Example 4.2 x y og x.y + y. x are no longer strong bisimilar in the extended semantics, i.e. x y e x.y + y. x. For x y (x=y)τ e whereas x.y + y. x (x=y)τ e. 4.1 Operational correspondence To show our result we need to characterize the exact correspondence between the original and the extended semantics. Lemma 4.3 Let P P π. 1. If σp β P, either i P α e P, where β = σα and σp = P, or ii P (x=y)τ e P, where σ = x = y and σp = P. 2. If P (x=y)τ e P, for any substitution σ = x = y, we have that σp τ σp. 3. P α e P iff P α P, whenever α (x = y)τ. Lemma 4.4 tells us that transitions are preserved under substitution. Lemma 4.4 If P α e P,, then σp β e σp, where β = σα. 4.2 Strong bisimilarity is a process congruence We now show that in the extended semantics we have that strong bisimilarity is a process congruence. Our proof proceeds by establishing that strong bisimilarity in the extended semantics coincides with open bisimilarity according to the standard semantics. Since open bisimilarity is a congruence for the π-calculus without match, the result then follows. Theorem 4.5 In the π-calculus without match, e Q = O. Theorem 4.5 is shown via lemmas 4.6 and 4.7. Lemma 4.6 Let P, Q P π. If P O Q, then P e Q. Proof:We show that the relation R o = {(P, Q) : P O Q} is a strong bisimulation in the extended semantics. So let (P, Q) R o. Since (P, Q), for any substitution σ if σp β P, there exists aq, such that σq β Q andp O Q (1) 8
9 i.e. (P, Q ) R o. Since P og Q are open bisimilar, for any substitution σ transitions of P and σq can be matched. When σp β P in (1), by Lemma 4.3, this transition corresponds to one of the following two extended transitions: (a) P α e P, where σα = β and σp = P (b) P (x=y)τ e P, where σ = x = y and σp = P The actual case depends on σ. If the β-transition in (1) is not caused by σ, P α where σα = β,, the transition of case (a) is enabled. Conversely, if the β-transition is caused by σ, then β = τ and must correspond to the transition case (b). Also by Lemma 4.3 the transition σq β Q of (1) corresponds to one of the following two extended transitions: (a) Q α e Q, where σα = β and σq = Q (b) Q (x=y)τ e Q, where σ = x = y and σq = Q If the β-transition of (1) is not caused by σ, both P and Q are capable of an α-transition, where σα = β,. We thus get if P α e P there exists a Q, such that Q α e Q and P O Q where σα = β, σp = P and σq = Q. The existence of Q is guaranteed by (1). If the β-transition of (1) is caused by σ, then β = τ and as before if P (x=y)τ e P there exists a Q, such that Q (x=y)τ e Q og P O Q where σ = x = y, σp = P og σq = Q. It now only remains to be shown that P e Q, which corresponds to showing that (P, Q ) R o. Since (P, Q ) R o, P = σp og Q = σq, we get (σp, σq ) R o. I.e. σp O σq. Since open bisimilarity is a process congruence, we get that P O Q and consequently (P, Q ) R o. Lemma 4.7 Let P, Q P π. If P e Q, then P O Q. Proof:Consider the relation R u = {(P, Q) : P = σp 1 and Q = σq 1, where P 1 e Q 1 } 9
10 We show that R u is an open bisimulation. So assume (P, Q) R u. Since open bisimilarity in the extended semantics implies open bisimilarity in the standard semantics, we show that P and Q are open bisimilar in the extended semantics. By definition this amounts to showing that for any σ 1 if σ 1 P β e P, there exists a Q, such that σ 1 Q β e Q and P O Q (2) Let σ 1 be a substitution. We now consider the transitions of the processes σ 1 P og σ 1 Q of (2). As (P, Q) R u, we have that σ 1 P = σ 1 σp 1 = σ 2 P 1 and σ 1 Q = σ 1 σq 1 = σ 2 Q 1 for any σ, and that σ 2 = σ 1 σ og P 1 e Q 1. From the definition of strong bisimilarity we then get α If P 1 P 1, then there exists a Q α 1, such that Q 1 Q 1 and P 1 e Q 1 (3) Since lemma 4.4 is valid for any substitution we have that the α-transition α P 1 e P 1 in (3) implies σ 2 P 1 β e σ 2 P 1, where β = σ 2 α Consequently, since σ 2 P 1 = σ 1 P, we have σ 1 P β e P, where β = σ 2 α and P = σ 2 P 1 (4) Similarly, lemma 4.4 tells us that the α-transition Q 1 e Q 1 in (3) implies that β σ 2 Q 1 e σ 2 Q 1, where β = σ 2 α and since σ 2 Q 1 = σ 1 Q we have that σ 1 Q β e Q, where β = σ 2 α and Q = σ 2 Q 1 (5) By applying (4) and (5) to (3) we get if σ 1 P β e P, there exists a Q, such that σ 1 Q β e Q and P e Q where β = σ 2 α, P = σ 2 P 1 og Q = σ 2 Q 1. The existence of Q follows from (3) and Q = σ 2 Q 1. We must also show that P O Q ; this amounts to showing that (P, Q ) R u. By (3) P 1 e Q 1, i.e. (P 1, Q 1 ) R u. Since R u contains all substitution instances of strong bisimilar process pairs, (P, Q ) R u, da P = σ 2 P 1 og Q = σ 2 Q 1. In conclusion, R u is an open bisimulation. α Corollary 4.8 For the π-calculus without match we have that e = e O 10
11 In the extended semantics, barbed bisimilarity and barbed congruence are defined as usual, with an extended notion of barbs. Definition 4.9 The set of extended barbs of a process is defined by P m if P my P for some y and P P m if P m y P for some y and P P (x=y)τ if P (x=y)τ P for some P In the extended semantics, barbed congruence still coincides with early congruence. Theorem 4.10 e = e E Proof:Similar to that for Theorem 3.15 in [8]: We show that if P E Q then for some finite summation M and some fresh name s we have that (ν z)(p (M + s)) (ν z)(q (M + s) where z fn(p, Q). We must now also consider the transition label (x = y)τ; this extension is straightforward. Corollary 4.11 For the π-calculus without match we have that [e] = e L = e E = e = e O. Proof:Since the intermediate inclusions [e] e L E e also hold in the extended semantics and since Corollary 4.8 holds, the result follows. 5 An equational theory for the replication-free fragment Corollary 4.11 immediately gives us a sound and complete axiom system for open bisimulation in the replication-free fragment of the π-calculus with the extended semantics the one for strong bisimulation. The new feature of the axiom system is that we must take the conditional τ-actions into account. For this reason, we also extend to Act ext = Act {(x = y)τ x, y N }. The proof system is shown in Table 3. Definition 5.1 In the extended semantics of the π-calculus without match, P = Q if P = Q is provable within the axiom system of Table 3. Theorem 5.2 In the π-calculus without match P e O Q iff P = Q 11
12 (Struct) P Q P = Q (Prefix) P = Q α.p = α.q α Act ext (Par) P = Q P R = Q R (New) P = Q (νp ) = (νq) (Sum) P = Q P + R = Q + R (Expand-1) x(y).p + w z.q = x(y).(p w z.q) + w z.(x(y).p Q) + (x = w)τ.({z/y}p Q) (Expand-2) x(y).p + x z.q = Table 3: Proof rules for e O x(y).(p x z.q) + x z.(x(y).p Q) + τ.({z/y}p Q) without replication Proof:The soundness part of the theorem follows from the fact that all axioms preserve e. The completeness part of the theorem amounts to establishing a head normal form (hnf) and establishing that For any P P π there exists a P 1 in hnf such that P = P 1 For any P, Q in hnf, if P Q then P = Q. 6 Conclusion and discussion In this paper we have presented an alternative semantics for the π-calculus without match. The new semantics adds an extra action, the conditional τ, to the labelled transition relation. The result is that strong bisimilarity and open congruence coincide. Since early and barbed congruence still coincide, all four notions of bisimilarity coincide for this semantics, giving us a simple labelled characterization of barbed congruence. An obvious question to ask is whether the result can be extended to a larger π-calculus, i.e a calculus with match and possible also mismatch. The answer to this is not simple; if we add conditional transitions for arbitrary actions, we arrive at Sangiorgi s symbolic semantics of the π-calculus [9]. 12
13 References [1] Michele Boreale and Davide Sangiorgi. Bisimulation in name-passing calculi without matching. In Proceedings of LICS 98. IEEE, Computer Society Press, July [2] Gérard Boudol. Asynchrony and the π-calculus (note). Rapport de Recherche 1702, INRIA Sofia-Antipolis, May [3] Martin Hansen, Hans Hüttel, and Josva Kleist. Bisimulations for asynchronous mobile processes. In Insup Lee and Scott A. Smolka, editors, Proceedings of CONCUR 95, volume 962 of LNCS. Springer, [4] Kohei Honda and Mario Tokoro. An object calculus for asynchronous communication. In Pièrre America, editor, Proceedings of ECOOP 91, volume 512 of LNCS, pages Springer, July [5] Robin Milner, Joachim Parrow, and David Walker. A calculus of mobile processes, part I/II. Journal of Information and Computation, 100:1 77, September [6] Robin Milner and Davide Sangiorgi. Barbed bisimulation. In W. Kuich, editor, Proceedings of ICALP 92, volume 623 of LNCS, pages Springer, [7] Benjamin C. Pierce and David N. Turner. Pict: A programming language based on the pi-calculus. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner, To appear. [8] Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, LFCS, University of Edinburgh, [9] Davide Sangiorgi. A theory of bisimulation for the π-calculus. Acta Informatica, 33:69 97, Earlier version published as Report ECS- LFCS , University of Edinburgh. An extended abstract appeared in the Proceedings of CONCUR 93, LNCS
Concurrency theory. proof-techniques for syncronous and asynchronous pi-calculus. Francesco Zappa Nardelli. INRIA Rocquencourt, MOSCOVA research team
Concurrency theory proof-techniques for syncronous and asynchronous pi-calculus Francesco Zappa Nardelli INRIA Rocquencourt, MOSCOVA research team francesco.zappa nardelli@inria.fr together with Frank
More informationCommunication Errors in the π-calculus are Undecidable
Communication Errors in the π-calculus are Undecidable Vasco T. Vasconcelos Department of Informatics Faculty of Sciences, University of Lisbon António Ravara Department of Mathematics Lisbon Institute
More informationReview of The π-calculus: A Theory of Mobile Processes
Review of The π-calculus: A Theory of Mobile Processes Riccardo Pucella Department of Computer Science Cornell University July 8, 2001 Introduction With the rise of computer networks in the past decades,
More informationAn introduction to process calculi: Calculus of Communicating Systems (CCS)
An introduction to process calculi: Calculus of Communicating Systems (CCS) Lecture 2 of Modelli Matematici dei Processi Concorrenti Paweł Sobociński University of Southampton, UK Intro to process calculi:
More informationA Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice
A Behavioral Congruence for Concurrent Constraint Programming with Nondeterministic Choice Luis Pino*, Filippo Bonchi** and Frank Valencia* (Presented by: Jorge A. Pe rez) *E quipe Come te, LIX, Laboratoire
More informationThe π-calculus Semantics. Equivalence and Value-Passing. Infinite Sums 4/12/2004
The π-calculus Semantics Overview ate and early semantics Bisimulation and congruence Variations of the calculus eferences obin Milner, Communicating and Mobil Systems Davide Sangiorgi and David Walker,
More informationMaking the unobservable, unobservable
ICE 2008 Making the unobservable, unobservable Julian Rathke ecs, University of Southampton awe l Sobociński 1 ecs, University of Southampton Abstract Behavioural equivalences of various calculi for modelling
More informationConcurrent Processes and Reaction
Concurrent Processes and Reaction Overview External and internal actions Observations Concurrent process expressions Structural congruence Reaction References Robin Milner, Communication and Concurrency
More informationA Graph Rewriting Semantics for the Polyadic π-calculus
A Graph Rewriting Semantics for the Polyadic π-calculus BARBARA KÖNIG Fakultät für Informatik, Technische Universität München Abstract We give a hypergraph rewriting semantics for the polyadic π-calculus,
More informationModels of Concurrency
Models of Concurrency GERARDO SCHNEIDER UPPSALA UNIVERSITY DEPARTMENT OF INFORMATION TECHNOLOGY UPPSALA, SWEDEN Thanks to Frank Valencia Models of Concurrency p.1/57 Concurrency is Everywhere Concurrent
More informationTrace Refinement of π-calculus Processes
Trace Refinement of pi-calculus Processes Trace Refinement of π-calculus Processes Manuel Gieseking manuel.gieseking@informatik.uni-oldenburg.de) Correct System Design, Carl von Ossietzky University of
More informationOn the asynchronous nature of the asynchronous π-calculus
On the asynchronous nature of the asynchronous π-calculus Romain Beauxis, Catuscia Palamidessi, and Frank D. Valencia INRIA Saclay and LIX, École Polytechnique Abstract. We address the question of what
More informationarxiv:cs/ v1 [cs.pl] 2 Sep 1998
arxiv:cs/9809008v1 [cs.pl] 2 Sep 1998 Comparing the Expressive Power of the Synchronous and the Asynchronous π-calculus Catuscia Palamidessi DISI, Università di Genova, via Dodecaneso, 35, 16146 Genova,
More informationFormalising the π-calculus in Isabelle
Formalising the π-calculus in Isabelle Jesper Bengtson Department of Computer Systems University of Uppsala, Sweden 30th May 2006 Overview This talk will cover the following Motivation Why are we doing
More informationA Note on Scope and Infinite Behaviour in CCS-like Calculi p.1/32
A Note on Scope and Infinite Behaviour in CCS-like Calculi GERARDO SCHNEIDER UPPSALA UNIVERSITY DEPARTMENT OF INFORMATION TECHNOLOGY UPPSALA, SWEDEN Joint work with Pablo Giambiagi and Frank Valencia A
More informationDistributed Processes and Location Failures (Extended Abstract)
Distributed Processes and Location Failures (Extended Abstract) James Riely and Matthew Hennessy Abstract Site failure is an essential aspect of distributed systems; nonetheless its effect on programming
More informationRecursive equations in higher-order process calculi
Theoretical Computer Science 266 (2001) 839 852 www.elsevier.com/locate/tcs Recursive equations in higher-order process calculi Mingsheng Ying a; ;1, Martin Wirsing b a State Key Laboratory of Intelligent
More informationFinitely Branching LTS s from Reaction Semantics for Process Calculi
Finitely Branching LTS s from Reaction Semantics for Process Calculi Pietro Di Gianantonio Furio Honsell Marina Lenisa Dipartimento di Matematica e Informatica, Università di Udine via delle Scienze 206,
More informationEquations, contractions, and unique solutions
Equations, contractions, and unique solutions Davide Sangiorgi To cite this version: Davide Sangiorgi. Equations, contractions, and unique solutions. POPL 2015 - Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT
More informationCompositional Event Structure Semantics for the Internal π-calculus
Compositional Event Structure Semantics for the Internal π-calculus Silvia Crafa 1 Daniele Varacca 2 Nobuko Yoshida 3 1 Università di Padova 2 PPS - Université Paris 7 & CNRS 3 Imperial College London
More informationSession Types Revisited
Session Types Revisited Ornela Dardha a, Elena Giachino b, Davide Sangiorgi b a School of Computing Science, University of Glasgow, United Kingdom b INRIA Focus Team / DISI, University of Bologna, Italy
More informationObserving Success in the Pi-Calculus
Observing Success in the Pi-Calculus David Sabel and Manfred Schmidt-Schauß Goethe-University, Frankfurt am Main {sabel,schauss}@ki.cs.uni-frankfurt.de Abstract A contextual semantics defined in terms
More informationLinear Forwarders. 1 Introduction. Philippa Gardner 1, Cosimo Laneve 2, and Lucian Wischik 2
Linear Forwarders Philippa Gardner 1, Cosimo Laneve 2, and Lucian Wischik 2 1 Imperial College, London. pg@doc.ic.ac.uk 2 University of Bologna, Italy. laneve@cs.unibo.it, lu@wischik.com Abstract. A linear
More informationFORMALISING THE π-calculus USING NOMINAL LOGIC
Logical Methods in Computer Science Vol. 5 (2:16) 2009, pp. 1 36 www.lmcs-online.org Submitted Mar. 24, 2009 Published Jun. 30, 2009 FORMALISING THE π-calculus USING NOMINAL LOGIC JESPER BENGTSON AND JOACHIM
More informationSeparation of synchronous and asynchronous communication via testing
Separation of synchronous and asynchronous communication via testing D. Cacciagrano Dipartimento di Matematica e Informatica, Università degli Studi di Camerino, Camerino, Italy F. Corradini Dipartimento
More informationarxiv: v1 [cs.lo] 16 Apr 2018
TREES FROM FUNCTIONS AS PROCESSES arxiv:1804.05797v1 [cs.lo] 16 Apr 2018 DAVIDE SANGIORGI AND XIAN XU Università di Bologna (Italy) and INRIA (France) East China University of Science and Technology (China)
More informationA Semantic Framework for Open Processes
A Semantic Framework for Open Processes P. Baldan (1), A. Bracciali (2), R. Bruni (2) (1) Dipartimento di Matematica Pura e Applicata, Università di Padova (Italy) baldan@math.unipd.it (2) Dipartimento
More informationDipartimento di Informatica Università degli Studi di Verona
Dipartimento di Informatica Università degli Studi di Verona Rapporto di ricerca Research report 40/2006 On the observational theory of the CPS-calculus Massimo Merro Corrado Biasi Dipartimento di Informatica
More informationA Propositional Dynamic Logic for Instantial Neighborhood Semantics
A Propositional Dynamic Logic for Instantial Neighborhood Semantics Johan van Benthem, Nick Bezhanishvili, Sebastian Enqvist Abstract We propose a new perspective on logics of computation by combining
More informationOn Urquhart s C Logic
On Urquhart s C Logic Agata Ciabattoni Dipartimento di Informatica Via Comelico, 39 20135 Milano, Italy ciabatto@dsiunimiit Abstract In this paper we investigate the basic many-valued logics introduced
More informationA π-calculus with preorders
A π-calculus with preorders Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi École Normale Supérieure de Lyon Università di Bologna PACE kick-off meeting, 2013-04-23 Jean-Marie Madiot (Lyon, Bologna)
More informationCompleteness Proof Strategies for Euler Diagram Logics
Completeness Proof Strategies for Euler Diagram Logics Jim Burton, Gem Stapleton, and John Howse Visual Modelling Group, University of Brighton, UK {j.burton,g.e.stapleton,john.howse}@brighton.ac.uk Abstract.
More informationTR : Possible World Semantics for First Order LP
City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2011 TR-2011010: Possible World Semantics for First Order LP Melvin Fitting Follow this and additional
More informationConcurrency theory. name passing, contextual equivalences. Francesco Zappa Nardelli. INRIA Paris-Rocquencourt, MOSCOVA research team
Concurrency theory name passing, contextual equivalences Francesco Zappa Nardelli INRIA Paris-Rocquencourt, MOSCOVA research team francesco.zappa nardelli@inria.fr together with Frank Valencia (INRIA Futurs)
More informationCommunicating and Mobile Systems
Communicating and Mobile Systems Overview:! Programming Model! Interactive Behavior! Labeled Transition System! Bisimulation! The π-calculus! Data Structures and λ-calculus encoding in the π-calculus References:!
More informationA semantic framework for open processes
Theoretical Computer Science 389 (2007) 446 483 www.elsevier.com/locate/tcs A semantic framework for open processes P. Baldan a, A. Bracciali b,, R. Bruni b a Dipartimento di Matematica Pura e Applicata,
More informationLogic for Computational Effects: work in progress
1 Logic for Computational Effects: work in progress Gordon Plotkin and John Power School of Informatics University of Edinburgh King s Buildings Mayfield Road Edinburgh EH9 3JZ Scotland gdp@inf.ed.ac.uk,
More informationThe π-calculus. From CCS to π-calculus. The π-calculus - Basic Ideas 4/1/2004. Overview Syntax Reaction, actions, and transitions
The π-calculus Overview Snta eaction, actions, and transitions eferences obin Milner, Communicating and Mobil Sstems Davide Sangiorgi and David Walker, The π-calculus: A Theor of Mobile Processes obin
More informationSecurity Abstractions and Intruder Models
EXPRESS 2008 Expressiveness in Concurrency 15th int. workshop Security Abstractions and Intruder Models (Extended Abstract) Michele Bugliesi 1 and Riccardo Focardi 2 Dipartimento di Informatica Università
More informationCoinductive Proof Techniques for Language Equivalence
Coinductive Proof Techniques for Language Equivalence Jurriaan Rot 1,2,, Marcello Bonsangue 1,2, and Jan Rutten 2,3 1 LIACS Leiden University, Niels Bohrweg 1, Leiden, Netherlands 2 Centrum Wiskunde en
More informationMaking Components Move: A Separation of Concerns Approach
Making Components Move: A Separation of Concerns Approach Dirk Pattinson, Martin Wirsing Institut für Informatik, LMU München Abstract. We present a new calculus for mobile systems, the main feature of
More informationBounded Stacks, Bags and Queues
Bounded Stacks, Bags and Queues J.C.M. Baeten 1 and J.A. Bergstra 2,3 1 Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, NL-5600 MB Eindhoven, The Netherlands,
More informationThe Buffered π-calculus: A Model for Concurrent Languages
The Buffered π-calculus: A Model for Concurrent Languages Xiaojie Deng 1, Yu Zhang 2, Yuxin Deng 1, and Farong Zhong 3 1 BASICS, Department of Computer Science and Engineering, Shanghai Jiao Tong University,
More informationNested Epistemic Logic Programs
Nested Epistemic Logic Programs Kewen Wang 1 and Yan Zhang 2 1 Griffith University, Australia k.wang@griffith.edu.au 2 University of Western Sydney yan@cit.uws.edu.au Abstract. Nested logic programs and
More informationTheir proof is rather lengthy and hard to grasp; it ultimately relies on showing a periodicity for any transition graph generated from normed context-
Bisimulation Equivalence is Decidable for all Context-Free Processes Sren Christensen Hans Huttel y Colin Stirling 1 Introduction Over the past decade much attention has been devoted to the study of process
More informationMobile Processes in Bigraphs. Ole Høgh Jensen. October 2006
Mobile Processes in Bigraphs Ole Høgh Jensen October 2006 Abstract Bigraphical reactive systems (BRSs) are a formalism for modelling mobile computation. A bigraph consists of two combined mathematical
More informationTR : Binding Modalities
City University of New York (CUNY) CUNY Academic Works Computer Science Technical Reports Graduate Center 2012 TR-2012011: Binding Modalities Sergei N. Artemov Tatiana Yavorskaya (Sidon) Follow this and
More informationAutomated Support for the Investigation of Paraconsistent and Other Logics
Automated Support for the Investigation of Paraconsistent and Other Logics Agata Ciabattoni 1, Ori Lahav 2, Lara Spendier 1, and Anna Zamansky 1 1 Vienna University of Technology 2 Tel Aviv University
More informationBRICS. Decoding Choice Encodings. Basic Research in Computer Science BRICS RS Nestmann & Pierce: Decoding Choice Encodings
BRICS Basic Research in Computer Science BRICS RS-99-42 Nestmann & Pierce: Decoding Choice Encodings Decoding Choice Encodings Uwe Nestmann Benjamin C. Pierce BRICS Report Series RS-99-42 ISSN 0909-0878
More informationResolution for mixed Post logic
Resolution for mixed Post logic Vladimir Komendantsky Institute of Philosophy of Russian Academy of Science, Volkhonka 14, 119992 Moscow, Russia vycom@pochtamt.ru Abstract. In this paper we present a resolution
More informationPolyadic History-Dependent Automata for the Fusion Calculus
Polyadic History-Dependent Automata for the Fusion Calculus Emilio Tuosto 1, Björn Victor 2, and Kidane Yemane 2 1 Dipartimento di Informatica, Università di Pisa, Italy. 2 Dept. of Information Technology,
More informationAn Equational Axiomatization for Multi-Exit Iteration
An Equational Axiomatization for Multi-Exit Iteration Luca Aceto BRICS Department of Computer Science Aalborg University, Fr. Bajersvej 7E 9220 Aalborg Ø, Denmark Wan Fokkink Utrecht University, Department
More informationOn the Expressive Power of Global and Local Priority in Process Calculi
On the Expressive Power of Global and Local Priority in Process Calculi Cristian Versari Nadia Busi Roberto Gorrieri Università di Bologna, Dipartimento di Scienze dell Informazione Mura Anteo Zamboni
More informationSecrecy and Group Creation
Secrecy and Group Creation Luca Cardelli 1 Giorgio Ghelli 2 Andrew D. Gordon 1 Abstract We add an operation of group creation to the typed π-calculus, where a group is a type for channels. Creation of
More informationA Spatial Logic for Concurrency
A Spatial Logic for Concurrency (Part I) Luís Caires Departamento de Informática FCT/UNL, Lisboa, Portugal Luca Cardelli Microsoft Research, Cambridge, UK Abstract We present a logic that can express properties
More informationExtending Howe s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names
Extending Howe s Method to Early Bisimulations for Typed Mobile Embedded Resources with Local Names Jens Chr. Godskesen and Thomas Hildebrandt Department of Theoretical Computer Science IT University of
More informationUsing the π-calculus. Overview. References
Using the π-calculus Overview Evolution Values as names Boolean values as processes Executor, a simple object model, lists The polyadic π-calculus Mobile telephones Processes as parameters A concurrent
More informationMAKING THE UNOBSERVABLE, UNOBSERVABLE.
MAKING THE UNOBSERVABLE, UNOBSERVABLE. 3 PAPERS FROM THE LAST 365 DAYS AVAILABLE TO READ NOW ON YOUR COMPUTER PAWEL SOBOCINSKI AND JULIAN RATHKE GO TO www.ecs.soton.ac.uk/~ps/publications.php Plan of the
More informationPartially commutative linear logic: sequent calculus and phase semantics
Partially commutative linear logic: sequent calculus and phase semantics Philippe de Groote Projet Calligramme INRIA-Lorraine & CRIN CNRS 615 rue du Jardin Botanique - B.P. 101 F 54602 Villers-lès-Nancy
More informationCommunication Problems in the 7r-Calculus. M. R. F. Benevides* F. Prottit
Communication Problems in the 7r-Calculus M. R. F. Benevides* F. Prottit Abstract In this paper we deal with the notions of deadlock, starvation, and communication errors in the asynchronous polyadic 7f-calculus.
More informationUsing the π-calculus. Evolution. Values As Names 3/24/2004
3/4/004 Using the π-calculus Overview Evolution Values as names Boolean values as processes Executor, a simple object model, lists The polyadic π-calculus Mobile telephones Processes as parameters A concurrent
More informationOn the Complexity of the Reflected Logic of Proofs
On the Complexity of the Reflected Logic of Proofs Nikolai V. Krupski Department of Math. Logic and the Theory of Algorithms, Faculty of Mechanics and Mathematics, Moscow State University, Moscow 119899,
More informationAlgebraizing Hybrid Logic. Evangelos Tzanis University of Amsterdam Institute of Logic, Language and Computation
Algebraizing Hybrid Logic Evangelos Tzanis University of Amsterdam Institute of Logic, Language and Computation etzanis@science.uva.nl May 1, 2005 2 Contents 1 Introduction 5 1.1 A guide to this thesis..........................
More informationGödel s Incompleteness Theorems
Seminar Report Gödel s Incompleteness Theorems Ahmet Aspir Mark Nardi 28.02.2018 Supervisor: Dr. Georg Moser Abstract Gödel s incompleteness theorems are very fundamental for mathematics and computational
More informationA Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory
A Unique Decomposition Theorem for Ordered Monoids with Applications in Process Theory (Extended Abstract) Bas Luttik Dept. of Theoretical Computer Science, Vrije Universiteit Amsterdam De Boelelaan 1081a,
More informationIntroduction to Metalogic
Philosophy 135 Spring 2008 Tony Martin Introduction to Metalogic 1 The semantics of sentential logic. The language L of sentential logic. Symbols of L: Remarks: (i) sentence letters p 0, p 1, p 2,... (ii)
More informationThe Logical Meeting Point of Multiset Rewriting and Process Algebra
MFPS 20 @ MU May 25, 2004 The Logical Meeting Point of Multiset Rewriting and Process Algebra Iliano ervesato iliano@itd.nrl.navy.mil ITT Industries, inc @ NRL Washington, D http://theory.stanford.edu/~iliano
More informationQuantifiers and Functions in Intuitionistic Logic
Quantifiers and Functions in Intuitionistic Logic Association for Symbolic Logic Spring Meeting Seattle, April 12, 2017 Rosalie Iemhoff Utrecht University, the Netherlands 1 / 37 Quantifiers are complicated.
More informationThe predicate calculus is complete
The predicate calculus is complete Hans Halvorson The first thing we need to do is to precisify the inference rules UI and EE. To this end, we will use A(c) to denote a sentence containing the name c,
More informationLogics for Compact Hausdorff Spaces via de Vries Duality
Logics for Compact Hausdorff Spaces via de Vries Duality Thomas Santoli ILLC, Universiteit van Amsterdam June 16, 2016 Outline Main goal: developing a propositional calculus for compact Hausdorff spaces
More informationA Proof Theory for Generic Judgments
A Proof Theory for Generic Judgments Dale Miller INRIA/Futurs/Saclay and École Polytechnique Alwen Tiu École Polytechnique and Penn State University LICS 2003, Ottawa, Canada, 23 June 2003 Outline 1. Motivations
More informationCommunication and Concurrency: CCS
Communication and Concurrency: CCS R. Milner, A Calculus of Communicating Systems, 1980 cours SSDE Master 1 Why calculi? Prove properties on programs and languages Principle: tiny syntax, small semantics,
More informationA few bridges between operational and denotational semantics of programming languages
A few bridges between operational and denotational semantics of programming languages Soutenance d habilitation à diriger les recherches Tom Hirschowitz November 17, 2017 Hirschowitz Bridges between operational
More informationRelating Reasoning Methodologies in Linear Logic and Process Algebra
Relating Reasoning Methodologies in Linear Logic and Process Algebra Yuxin Deng Robert J. Simmons Iliano Cervesato December 2011 CMU-CS-11-145 CMU-CS-QTR-111 School of Computer Science Carnegie Mellon
More informationFrom Constructibility and Absoluteness to Computability and Domain Independence
From Constructibility and Absoluteness to Computability and Domain Independence Arnon Avron School of Computer Science Tel Aviv University, Tel Aviv 69978, Israel aa@math.tau.ac.il Abstract. Gödel s main
More informationCS 395T. Probabilistic Polynomial-Time Calculus
CS 395T Probabilistic Polynomial-Time Calculus Security as Equivalence Intuition: encryption scheme is secure if ciphertext is indistinguishable from random noise Intuition: protocol is secure if it is
More informationClassical Propositional Logic
The Language of A Henkin-style Proof for Natural Deduction January 16, 2013 The Language of A Henkin-style Proof for Natural Deduction Logic Logic is the science of inference. Given a body of information,
More informationA Tableau Calculus for Minimal Modal Model Generation
M4M 2011 A Tableau Calculus for Minimal Modal Model Generation Fabio Papacchini 1 and Renate A. Schmidt 2 School of Computer Science, University of Manchester Abstract Model generation and minimal model
More informationCanonical Calculi: Invertibility, Axiom expansion and (Non)-determinism
Canonical Calculi: Invertibility, Axiom expansion and (Non)-determinism A. Avron 1, A. Ciabattoni 2, and A. Zamansky 1 1 Tel-Aviv University 2 Vienna University of Technology Abstract. We apply the semantic
More informationSemantics and Verification
Semantics and Verification Lecture 2 informal introduction to CCS syntax of CCS semantics of CCS 1 / 12 Sequential Fragment Parallelism and Renaming CCS Basics (Sequential Fragment) Nil (or 0) process
More informationHerbrand Theorem, Equality, and Compactness
CSC 438F/2404F Notes (S. Cook and T. Pitassi) Fall, 2014 Herbrand Theorem, Equality, and Compactness The Herbrand Theorem We now consider a complete method for proving the unsatisfiability of sets of first-order
More informationOn the specification of modal systems: a comparison of three frameworks
On the specification of modal systems: a comparison of three frameworks Luca Aceto a, Ignacio Fábregas b, David de Frutos-Escrig b, Anna Ingólfsdóttir a, Miguel Palomino b a ICE-TCS, School of Computer
More informationPropositional and Predicate Logic. jean/gbooks/logic.html
CMSC 630 February 10, 2009 1 Propositional and Predicate Logic Sources J. Gallier. Logic for Computer Science, John Wiley and Sons, Hoboken NJ, 1986. 2003 revised edition available on line at http://www.cis.upenn.edu/
More informationName-passing calculi: from fusions to preorders and types
Author manuscript, published in "LICS - 28th Annual ACM/IEEE Symposium on Logic in Computer Science - 2013 (2013) 378-387" DOI : 10.1109/LICS.2013.44 Name-passing calculi: from fusions to preorders and
More informationModel Theory of Modal Logic Lecture 5. Valentin Goranko Technical University of Denmark
Model Theory of Modal Logic Lecture 5 Valentin Goranko Technical University of Denmark Third Indian School on Logic and its Applications Hyderabad, January 29, 2010 Model Theory of Modal Logic Lecture
More informationProof Theoretical Studies on Semilattice Relevant Logics
Proof Theoretical Studies on Semilattice Relevant Logics Ryo Kashima Department of Mathematical and Computing Sciences Tokyo Institute of Technology Ookayama, Meguro, Tokyo 152-8552, Japan. e-mail: kashima@is.titech.ac.jp
More informationPreliminaries. Introduction to EF-games. Inexpressivity results for first-order logic. Normal forms for first-order logic
Introduction to EF-games Inexpressivity results for first-order logic Normal forms for first-order logic Algorithms and complexity for specific classes of structures General complexity bounds Preliminaries
More informationRelating State-Based and Process-Based Concurrency through Linear Logic
École Polytechnique 17 September 2009 Relating State-Based and Process-Based oncurrency through Linear Logic Iliano ervesato arnegie Mellon University - Qatar iliano@cmu.edu Specifying oncurrent Systems
More informationReasoning About Bounds In Weighted Transition Systems
Reasoning About Bounds In Weighted Transition Systems QuantLA 2017 September 18, 2017 Mikkel Hansen, Kim Guldstrand Larsen, Radu Mardare, Mathias Ruggaard Pedersen and Bingtian Xue {mhan, kgl, mardare,
More informationDuality and i/o-types in the π-calculus
Duality and i/o-types in the π-calculus Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi To cite this version: Daniel Hirschkoff, Jean-Marie Madiot, Davide Sangiorgi. Duality and i/o-types in the
More informationA logical view on scheduling in concurrency
A logical view on scheduling in concurrency Emmanuel Beffara To cite this version: Emmanuel Beffara A logical view on scheduling in concurrency 2014 HAL Id: hal-00951976 https://halarchives-ouvertesfr/hal-00951976v1
More informationOn Böhm Trees and Lévy-Longo Trees in π-calculus
On Böhm Trees and Lévy-Longo Trees in π-calculus Xian Xu East China University of Science and Technology (from ongoing work with Davide Sangiorgi) April, 1 Subject Encodings from to λ-calculus (sequential
More informationA CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5
THE REVIEW OF SYMBOLIC LOGIC Volume 1, Number 1, June 2008 3 A CUT-FREE SIMPLE SEQUENT CALCULUS FOR MODAL LOGIC S5 FRANCESCA POGGIOLESI University of Florence and University of Paris 1 Abstract In this
More informationBisimulation and coinduction in higher-order languages
Bisimulation and coinduction in higher-order languages Davide Sangiorgi Focus Team, University of Bologna/INRIA ICE, Florence, June 2013 Bisimulation Behavioural equality One of the most important contributions
More informationForcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus
Forcing-based cut-elimination for Gentzen-style intuitionistic sequent calculus Hugo Herbelin 1 and Gyesik Lee 2 1 INRIA & PPS, Paris Université 7 Paris, France Hugo.Herbelin@inria.fr 2 ROSAEC center,
More informationSyntactic Characterisations in Model Theory
Department of Mathematics Bachelor Thesis (7.5 ECTS) Syntactic Characterisations in Model Theory Author: Dionijs van Tuijl Supervisor: Dr. Jaap van Oosten June 15, 2016 Contents 1 Introduction 2 2 Preliminaries
More informationSemantics for algebraic operations
MFPS 17 Preliminary Version Semantics for algebraic operations Gordon Plotkin and John Power 1 Laboratory for the Foundations of Computer Science University of Edinburgh King s Buildings, Edinburgh EH9
More informationInformation Systems Business Process Modelling I: Models
Information Systems 2 Information Systems 2 5. Business Process Modelling I: Models Lars Schmidt-Thieme Information Systems and Machine Learning Lab (ISMLL) Institute for Business Economics and Information
More informationA note on coinduction and weak bisimilarity for while programs
Centrum voor Wiskunde en Informatica A note on coinduction and weak bisimilarity for while programs J.J.M.M. Rutten Software Engineering (SEN) SEN-R9826 October 31, 1998 Report SEN-R9826 ISSN 1386-369X
More informationINSTANTIAL NEIGHBOURHOOD LOGIC
INSTANTIAL NEIGHBOURHOOD LOGIC JOHAN VAN BENTHEM, NICK BEZHANISHVILI, SEBASTIAN ENQVIST, JUNHUA YU Abstract. This paper explores a new language of neighbourhood structures where existential information
More information