## A specification structure for deadlock-freedom of synchronous processes (1999)

Venue: | TCS |

Citations: | 3 - 1 self |

### BibTeX

@ARTICLE{Abramsky99aspecification,

author = {S. Abramsky and S. J. Gay and R. Nagarajan},

title = { A specification structure for deadlock-freedom of synchronous processes },

journal = {TCS},

year = {1999},

volume = {222},

pages = {1--53}

}

### OpenURL

### Abstract

Many different notions of "program property", and many different methods of verifying such properties, arise naturally in programming. We present a general framework of Specification Structures for combining different notions and methods in a coherent fashion. We then apply the idea of specification structures to concurrency in the setting of Interaction Categories. As a specific example, a certain specification

### Citations

3506 | Communication sequential processes
- Hoare
- 1985
(Show Context)
Citation Context ... (a; fcg); (ab; ?); (ac; ?)g and if P = a:P , readies(P ) = f(a n ; fag j n ! !)g: The idea of a ready pair, and the related notions of failures and refusals, appear in the process algebra literature =-=[14,18,28]-=-. There, however, they are used to define semantic alternatives to bisimulation; the use made of ready pairs in this paper is very different. The key definition is that of orthogonality of ready pairs... |

3280 |
Communication and Concurrency
- Milner
- 1989
(Show Context)
Citation Context ...r deadlock-freedom, we omit the features of SProc which will not be needed in later sections. More complete definitions can be found elsewhere [1,23]. 3.1 Processes A labelled transition system (LTS) =-=[36]-=- is a triple (S; L; - ) where S is a set of states, L is a set of labels, and - ` S \Theta L \Theta S is the transition relation. We write s a - s 0 for (s; a; s 0 ) 2 - . A process representative wit... |

1310 | A structural approach to operational semantics
- Plotkin
- 1981
(Show Context)
Citation Context ...g cases in which there is less degeneracy. If p : A ! B and q : B ! C then the composite p ; q : A ! C is defined by labelled transitions, in the style of Plotkin's "structural operational semant=-=ics" [44]-=-. p (a;b) - p 0 q (b;c) - q 0 p ; q (a;c) - p 0 ; q 0 At each step, the actions in the common type B have to match. The processes being composed constrain each other's behaviour, selecting the possibi... |

1019 | A calculus of mobile processes
- Milner, Parrow, et al.
- 1992
(Show Context)
Citation Context ...future paper. Beyond the issues of synchrony and a formal syntax, there are two respects in which our theory of deadlock-freedom is restrictive. First, we have not yet addressed the issue of mobility =-=[37,38]-=-, which has featured prominently in recent research on concurrency theory. Second, the property guaranteed by our specifications is extremely strong---all processes must run forever. This is the reaso... |

938 |
Categories for the Working Mathematician
- Lane
- 1971
(Show Context)
Citation Context ...a : C 2 ! C , an object I, and natural isomorphisms assoc A;B;C : (A\Omega B)\Omega C = A\Omega (B\Omega C) unitl A : I\Omega A = A unitr A : A\Omega I = A satisfying the standard coherence equations =-=[34]-=-. A specification structure for C must then correspondingly be extended with an action \Omega A;B : P S A \Theta P S B ! P S (A\Omega B) and an element I S 2 P S I satisfying, for f : A ! B, f 0 : A 0... |

520 | The synchronous dataflow programming language lustre
- Halbwachs, Caspi, et al.
- 1991
(Show Context)
Citation Context ...oped in the rest of the paper, Section 7 analyses the construction of a class of synchronous networks, which encompasses both synchronous dataflow programs in languages such as Signal [26] and Lustre =-=[27]-=-, and systolic algorithms [22]. Finally we compare our theory with other approaches, and discuss current limitations and possibilities for further developments. For a more general discussion of the me... |

484 |
Recursively enumerable sets and degrees
- Soare
- 1987
(Show Context)
Citation Context ...and linear maps [25]. (5) C = Set ; P S X = fs : ! * X j 8x 2 X:9n 2 !:s(n) = xg; sffgt def ,9n 2 w: f ffi s ' t ffi OE n where OE n is the nth partial recursive function in some acceptable numbering =-=[45]-=-. Then C S is the category of modest sets, seen as a full subcategory of !-Set [13]. (6) C = the category of SFP domains; P S D = K D)(the compact-open subsets of D); UffgV def , U ` f \Gamma1 (V ). T... |

286 | Computational interpretations of linear logic
- Abramsky
- 1993
(Show Context)
Citation Context ...le the sets of processessapproach appears more general. In both cases, there is a strong analogy between the treatment of deadlock-freedom and proofs of strong normalisation in Classical Linear Logic =-=[4,25]-=-. In Section 5.1 we discuss ready specifications and define the specification structure R. However, we do not immediately prove that R is a specification structure. In Section 5.4 we define a specific... |

245 | Typing and subtyping for mobile processes
- Pierce, Sangiorgi
- 1996
(Show Context)
Citation Context ...hecking that outputs are always connected to inputs. There are several variations which include information about how many times channels are used [32], the order of usage of channels [31], subtyping =-=[42]-=-, types for choice and branching behaviour [46]. The distinguishing features of our semantic approach are as follows. First, it is based on a category-theoretic description of the collective structure... |

229 | Domain theory in logical form
- Abramsky
- 1991
(Show Context)
Citation Context ...a full subcategory of !-Set [13]. (6) C = the category of SFP domains; P S D = K D)(the compact-open subsets of D); UffgV def , U ` f \Gamma1 (V ). This yields (part of) Domain Theory in Logical Form =-=[3]-=-, the other part arising from the local lattice-theoretic structure of the sets P S D and its interaction with the global type structure. (7) C = games and partial strategies, as in [12], P S A = all ... |

211 | Games and full completeness for multiplicative linear logic
- Abramsky, Jagadeesan
- 1994
(Show Context)
Citation Context ...and its interaction with the global type structure. (7) C = games and partial strategies, as in [12], P S A = all sets of infinite plays, UfoegV iff oe is winning with respect to U; V in the sense of =-=[10]-=-. Then C S is the category of games and winning strategies of [10]. 6 3 The Interaction Category SProc The theory of Interaction Categories has been proposed as a new paradigm for the semantics of seq... |

166 |
Traced monoidal categories
- Joyal, Street, et al.
- 1996
(Show Context)
Citation Context ... compact closed categories, can be found in the literature [17,30]. The above use of compact closed structure to interpret cyclic networks goes back to [5,6]. In recent work, Joyal, Street and Verity =-=[29]-=- have axiomatised feedback in monoidal categories (in their terminology a trace) and observed that every compact closed category is traced. This provides an appropriate general setting for the above c... |

139 | Linearity and the pi-calculus
- Kobayashi, Pierce, et al.
- 1996
(Show Context)
Citation Context ...ntifying ports or channels as input or outputs, and checking that outputs are always connected to inputs. There are several variations which include information about how many times channels are used =-=[32]-=-, the order of usage of channels [31], subtyping [42], types for choice and branching behaviour [46]. The distinguishing features of our semantic approach are as follows. First, it is based on a categ... |

127 |
Logics of programs
- Kozen, Tiuryn
- 1990
(Show Context)
Citation Context ... A; y; z 2 B:xRysxRz ) y = z. Then C S is the category of sets and partial functions. (3) C = Rel , P S X =sX, SfRgT def , 8x 2 S: fy j xRyg ` T . This is essentially a typed version of dynamic logic =-=[33], with the-=- "Hoare triple relation" specialized to its original setting. If we take S\Omega X;Y T =S \Theta T S ? X =XnS then C S becomes a model of classical linear logic. (4) C = Rel ; P S X = fC ` X... |

123 | Interaction categories and the foundations of typed concurrent programming
- Abramsky, Gay, et al.
- 1996
(Show Context)
Citation Context ... the objects of C 0 in order to obtain a richer setting for performing specification and verification. This paper provides a detailed development of this idea in the setting of interaction categories =-=[1,5,6]-=-, with particular reference to synchronous systems. Section 2 introduces the notion of a specification structure, which formalizes the idea of enriching a semantic universe with a refined notion of pr... |

114 | An Interactionbased Language and its Typing System
- Takeuchi, Honda, et al.
- 1994
(Show Context)
Citation Context ...j X ` \Sigma A (s); length(s) is oddg: A detailed development of this idea, which is a subject for future work, should lead to interesting connections with the type system proposed by Takeuchi et al. =-=[46]-=-. 8 Conclusions We have presented a semantic view of the specification and verification of concurrent systems. The relevant technical machinery is the notion of specificationsstructures, which provide... |

110 |
Coherence for compact closed categories
- Kelly, Laplaza
- 1980
(Show Context)
Citation Context ...he autonomous structure) so it properly generalizes the standard interpretation of Cut. Some related notions, arising in work on coherence in compact closed categories, can be found in the literature =-=[17,30]-=-. The above use of compact closed structure to interpret cyclic networks goes back to [5,6]. In recent work, Joyal, Street and Verity [29] have axiomatised feedback in monoidal categories (in their te... |

102 | Relational Parametricity and Local Variables
- O'Hearn, Tennent
- 1993
(Show Context)
Citation Context ...notions which is highly suggestive, particularly from a Computer Science point of view. Similar notions have been studied, for a variety of purposes, by Burstall and McKinna [35], O'Hearn and Tennent =-=[40], and Pitt-=-s [43]. Definition 1 Let C be a category. A specification structure S over C is defined by the following data: ffl for each object A of C , a set P S A of "properties over A". ffl for each p... |

100 | Relational properties of domains
- Pitts
- 1996
(Show Context)
Citation Context ... highly suggestive, particularly from a Computer Science point of view. Similar notions have been studied, for a variety of purposes, by Burstall and McKinna [35], O'Hearn and Tennent [40], and Pitts =-=[43]. Definiti-=-on 1 Let C be a category. A specification structure S over C is defined by the following data: ffl for each object A of C , a set P S A of "properties over A". ffl for each pair of objects A... |

90 |
Programming real-time applications with SIGNAL
- Guernic, Gauthier, et al.
- 1991
(Show Context)
Citation Context ...the theory developed in the rest of the paper, Section 7 analyses the construction of a class of synchronous networks, which encompasses both synchronous dataflow programs in languages such as Signal =-=[26]-=- and Lustre [27], and systolic algorithms [22]. Finally we compare our theory with other approaches, and discuss current limitations and possibilities for further developments. For a more general disc... |

87 |
autonomous category and linear logic
- Barr
- 1991
(Show Context)
Citation Context ... /)\Omega OE)feval A;B g/ (OE\Omega /)ffg` =) OEf(f )g(/ ( `): Going one step further, suppose that C is a -autonomous category, i.e. a model for the multiplicative fragment of classical linear logic =-=[15]-=-, with linear negation (\Gamma) ? , where for simplicity we assume that A ?? = A. Then we require an action (\Gamma) ? A : P S A ! P S (A ? ) satisfying OE ?? = OE OE ( / = (OE\Omega / ? ) ? : Under t... |

80 |
Categories for Types
- Crole
- 1994
(Show Context)
Citation Context ...r definitions can be given for a range of structures, including: ffl models of classical (or intuitionistic) linear logic including the additives and exponentials [13] ffl cartesian closed categories =-=[20]-=- ffl models of polymorphism [20]. 5 2.1 Examples of Specification Structures In each case we specify the category C , the assignment of properties P S to objects and the Hoare triple relation. (1) C =... |

77 | A partially deadlock-free typed process calculus
- Kobayashi
- 1997
(Show Context)
Citation Context ...r outputs, and checking that outputs are always connected to inputs. There are several variations which include information about how many times channels are used [32], the order of usage of channels =-=[31]-=-, subtyping [42], types for choice and branching behaviour [46]. The distinguishing features of our semantic approach are as follows. First, it is based on a category-theoretic description of the coll... |

72 | New foundations for the geometry of interaction
- Abramsky, Jagadeesan
- 1994
(Show Context)
Citation Context ...mputation [1,5,6]. The term encompasses certain known categories (the category of concrete data structures and sequential algorithms [16], categories of games [10], geometry of interaction categories =-=[11]-=-) as well as several new categories for concurrency. The fundamental examples of concurrent interaction categories are SProc [5], the category of synchronous processes, and ASProc [6], the category of... |

69 |
Categories, Types and Structures - An Introduction to Category Theory for the Working Computer Scientist. Foundations of Computing
- Asperti, Longo
- 1991
(Show Context)
Citation Context ... on C is illustrative. Exactly similar definitions can be given for a range of structures, including: ffl models of classical (or intuitionistic) linear logic including the additives and exponentials =-=[13]-=- ffl cartesian closed categories [20] ffl models of polymorphism [20]. 5 2.1 Examples of Specification Structures In each case we specify the category C , the assignment of properties P S to objects a... |

67 | Full abstraction for PCF (extended abstract
- Abramsky, Jagadeesan, et al.
- 1994
(Show Context)
Citation Context ...n Logical Form [3], the other part arising from the local lattice-theoretic structure of the sets P S D and its interaction with the global type structure. (7) C = games and partial strategies, as in =-=[12]-=-, P S A = all sets of infinite plays, UfoegV iff oe is winning with respect to U; V in the sense of [10]. Then C S is the category of games and winning strategies of [10]. 6 3 The Interaction Category... |

65 | Retracing some paths in process algebra
- Abramsky
- 1996
(Show Context)
Citation Context ...closed category is traced. This provides an appropriate general setting for the above calculation. For a discussion of connections between traced monoidal categories and computational structures, see =-=[8]-=-. It is useful to introduce some notation for the operation of cycle formation. If P 2 Proc(\Sigma A 1\Omega\Gamma/1 \Omega An\Omega B\Omega B ?) then P 2 Proc(\Sigma A 1\Omega\Gamma/35 An ) is define... |

56 | A typed calculus of synchronous processes
- Gay, Nagarajan
- 1995
(Show Context)
Citation Context ...c D as semantic models of types which specify communication behaviour, as indicated briefly in Section 7.3. Previous work on interaction categories includes the definition of a typed process calculus =-=[23,24]-=- in which types correspond to safety specifications. This process calculus has a denotational semantics in which types are interpreted by SProc objects and processes by SProc morphisms. (In fact, the ... |

46 |
Proofs as processes
- Abramsky
- 1994
(Show Context)
Citation Context ...14 \Gamma A A ? \Delta Fig. 2. Using the Cut rule to connect modules (a) (b) (c) Fig. 3. Cyclic and acyclic networks allows us to plug two modules together by an interface consisting of a single port =-=[7]-=-, as in Figure 2. This allows us to connect processes in a tree structure, as in Figure 3(a), but not to construct cyclic interconnection networks as in Figure 3(b). The problem with constructing a cy... |

35 |
Interaction categories and communicating sequentim processes
- Abramsky
- 1995
(Show Context)
Citation Context ... the objects of C 0 in order to obtain a richer setting for performing specification and verification. This paper provides a detailed development of this idea in the setting of interaction categories =-=[1,5,6]-=-, with particular reference to synchronous systems. Section 2 introduces the notion of a specification structure, which formalizes the idea of enriching a semantic universe with a refined notion of pr... |

32 |
Theory and practice of sequential algorithms: the kernel of the applicative language CDS0
- Berry, Curien
- 1985
(Show Context)
Citation Context ...as a new paradigm for the semantics of sequential and concurrent computation [1,5,6]. The term encompasses certain known categories (the category of concrete data structures and sequential algorithms =-=[16]-=-, categories of games [10], geometry of interaction categories [11]) as well as several new categories for concurrency. The fundamental examples of concurrent interaction categories are SProc [5], the... |

29 |
An extensional treatment of dataflow deadlock
- Wadge
- 1979
(Show Context)
Citation Context ...uces an output which is independent of one input. Hence any legal cycle in a Lustre program satisfies our condition. Furthermore, our condition is the natural specialisation of Wadge's cycle sum test =-=[47]-=- to the synchronous case. Wadge attaches an integer weight to every path from input to output in every node, corresponding to a delay in causality. Computations of history-independent functions have a... |

28 |
Linear logic, coherence and dinaturality
- Blute
- 1993
(Show Context)
Citation Context ...he autonomous structure) so it properly generalizes the standard interpretation of Cut. Some related notions, arising in work on coherence in compact closed categories, can be found in the literature =-=[17,30]-=-. The above use of compact closed structure to interpret cyclic networks goes back to [5,6]. In recent work, Joyal, Street and Verity [29] have axiomatised feedback in monoidal categories (in their te... |

24 | Deliverables: A categorical approach to program development in type theory
- McKinna, Burstall
- 1993
(Show Context)
Citation Context ...ve view of these standard notions which is highly suggestive, particularly from a Computer Science point of view. Similar notions have been studied, for a variety of purposes, by Burstall and McKinna =-=[35], O'H-=-earn and Tennent [40], and Pitts [43]. Definition 1 Let C be a category. A specification structure S over C is defined by the following data: ffl for each object A of C , a set P S A of "properti... |

21 | Specification structures and propositions-as-types for concurrency. In Logics ]or Concurrency: Structure vs
- Abramsky, Gay, et al.
- 1996
(Show Context)
Citation Context ...hronous interaction category ASProc [6]. The result is a category of deadlock-free processes in which the global synchrony condition is not present. Preliminary versions of this work have appeared in =-=[2,23]-=- and improved versions in [9,39]; a full report of this area will be the subject of a future paper. Beyond the issues of synchrony and a formal syntax, there are two respects in which our theory of de... |

20 |
Interaction categories (extended abstract
- Abramsky
- 1993
(Show Context)
Citation Context ... the objects of C 0 in order to obtain a richer setting for performing specification and verification. This paper provides a detailed development of this idea in the setting of interaction categories =-=[1,5,6]-=-, with particular reference to synchronous systems. Section 2 introduces the notion of a specification structure, which formalizes the idea of enriching a semantic universe with a refined notion of pr... |

11 |
Linear Types for Communicating Processes
- Gay
- 1995
(Show Context)
Citation Context ...nctional composition typically found in categories of mathematical structures. There is not yet a definitive axiomatisation of interaction categories, although some possibilities have been considered =-=[23]-=-. The common features of the existing examples are that they have -autonomous structure, which corresponds to the multiplicative fragment of classical linear logic [25]; products and coproducts, corre... |

11 | Specifying interaction categories
- Pavlovic, Abramsky
(Show Context)
Citation Context ...g/g: Then (1) and (2) become precisely the statement that R is a lax functor with respect to the usual order-enrichment of Rel by inclusion of relations: 3 id R(A) `R(idA ) R(f) ; R(g) `R(f ; g): See =-=[41]-=- for a fuller discussion of how this idea relates to more general notions in category theory. The notion of specification structure acquires more substance when there is additional structure on C whic... |

9 | A type-theoretic approach to deadlock-freedom of asynchronous systems
- Abramsky, Gay, et al.
- 1997
(Show Context)
Citation Context ...roc [6]. The result is a category of deadlock-free processes in which the global synchrony condition is not present. Preliminary versions of this work have appeared in [2,23] and improved versions in =-=[9,39]-=-; a full report of this area will be the subject of a future paper. Beyond the issues of synchrony and a formal syntax, there are two respects in which our theory of deadlock-freedom is restrictive. F... |

9 |
de Bakker. Mathematical Theory of Program Correctness
- W
(Show Context)
Citation Context ... P S A, / 2 P S B 2 and ` 2 P S C: OEfid AgOE (1) OEffg/; /fgg` =) OEff ; gg`: (2) The axioms (1) and (2) are typed versions of the standard Hoare logic axioms for "skip" and "sequentia=-=l composition" [21]-=-. Given C and S as above, we can define a new category C S . An object of C S is a pair (A; OE) with A 2 ob C and OE 2 P S A. A C S -morphism f : (A; OE) ! (B; /) is a morphism f : A ! B in C such tha... |

4 |
Universal Algebra, volume 6
- Cohn
- 1981
(Show Context)
Citation Context .... (s; X) ? ` def ,8(t;Y ) 2 `:(s; X) ? (t; Y ) ` ? def = f(s; X) 2 RP(A) j (s; X) ? `g: Defining (\Gamma) ? in this way from a symmetric orthogonality relation yields a self-adjoint Galois connection =-=[19]-=- and the following lemma holds for general reasons. Lemma 16 For `; OE ` RP(A), 1: ` ` OE ) OE ? ` ` ? 2: ` ` ` ?? 3: ` ??? = ` ? : Definition 17 A ready specification over an object A is a non-empty ... |

2 |
Systolic Computations, volume 83
- Frumkin
- 1992
(Show Context)
Citation Context ... Section 7 analyses the construction of a class of synchronous networks, which encompasses both synchronous dataflow programs in languages such as Signal [26] and Lustre [27], and systolic algorithms =-=[22]-=-. Finally we compare our theory with other approaches, and discuss current limitations and possibilities for further developments. For a more general discussion of the methodological issues relating t... |

2 | Typed Concurrent Programs: Specification & Verification
- Nagarajan
- 1996
(Show Context)
Citation Context ...roc [6]. The result is a category of deadlock-free processes in which the global synchrony condition is not present. Preliminary versions of this work have appeared in [2,23] and improved versions in =-=[9,39]-=-; a full report of this area will be the subject of a future paper. Beyond the issues of synchrony and a formal syntax, there are two respects in which our theory of deadlock-freedom is restrictive. F... |