Results 1 
6 of
6
Configuration Structures
, 1995
"... this paper we consider a very general model of concurrency, the set systems. These are structures C = (E; C) with E a set and C ` 2 ..."
Abstract

Cited by 40 (1 self)
 Add to MetaCart
this paper we consider a very general model of concurrency, the set systems. These are structures C = (E; C) with E a set and C ` 2
InterfaceBased Protocol Specification of Open Systems using PSL
, 1994
"... PSL is a framework for describing dynamic and architectural properties of open systems. PSL extends established interfacebased tactics for describing the functional properties of open systems to the realm of protocol description. PSL specifications consist of logical and temporal rules relating sit ..."
Abstract

Cited by 24 (0 self)
 Add to MetaCart
PSL is a framework for describing dynamic and architectural properties of open systems. PSL extends established interfacebased tactics for describing the functional properties of open systems to the realm of protocol description. PSL specifications consist of logical and temporal rules relating situations, each of which describes potential states with respect to instances of interfaces, their attributes, and the issuance and reception of events. PSL accommodates refinement and extensibility of specifications along the three dimensions of interfaces, situations, and orderings. A specialized form, PSL/IDL describes protocols in CORBA systems. 1 Introduction An open system, in the technical sense [28, 1, 63] (not necessarily the commercial sense) is encapsulated, reactive, spatially extensible, and temporally extensible: Encapsulation. An open system is composed of possibly many components, each described by one or more public interfaces along with an otherwise inaccessible implementa...
Configuration Structures (Extended Abstract)
 Proceedings 10 th Annual IEEE Symposium on Logic in Computer Science, LICS’95
, 1995
"... Configuration structures provide a model of concurrency generalising the families of configurations of event structures. They can be considered logically, as classes of propositional models; then subclasses can be axiomatised by formulae of simple prescribed forms. Several equivalence relations for ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
Configuration structures provide a model of concurrency generalising the families of configurations of event structures. They can be considered logically, as classes of propositional models; then subclasses can be axiomatised by formulae of simple prescribed forms. Several equivalence relations for event structures are generalised to configuration structures, and also to general Petri nets. Every configuration structure is shown to be STbisimulation equivalent to a prime event structure with binary conflict; this fails for the tighter history preserving bisimulation. Finally, Petri nets without selfloops under the collective token interpretation are shown behaviourally equivalent to configuration structures, in the sense that there are translations in both directions respecting history preserving bisimulation. This fails for nets with selfloops. 1 Introduction The aim of this paper is to connect several models of concurrency, by providing translations between them and studying whi...
Chu I: cofree equivalences, dualities and *autonomous categories
, 1993
"... ing from the technique of dual pairs in functional analysis (Kelley, Nanmioka et al. 1963, ch. 5), they defined the objects of their category to be the triples hA; B; A\Omega B OE !?i, where A and B are arbitrary objects of an autonomous category V, and ? is a fixed object, chosen to become duali ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
ing from the technique of dual pairs in functional analysis (Kelley, Nanmioka et al. 1963, ch. 5), they defined the objects of their category to be the triples hA; B; A\Omega B OE !?i, where A and B are arbitrary objects of an autonomous category V, and ? is a fixed object, chosen to become dualizing. A morphism from hA; B; OEi to hC; D; fli was defined as a pair hu : A ! C; B / D : vi of Varrows, making the square A\Omega D A\Omega B C\Omega D ? u\Omega D<Fnan><Fnan> fflffl A\Omega v<Fnan><Fnan> // OE<Fnan><Fnan> fflffl fl<Fnan><Fnan> (1) Cofree equivalences, dualities and autonomous categories 3 commute. This is the setting in which the autonomous structure of a Chu category was originally discovered. The starting point of the present paper is the fact that the category described by Chu is isomorphic to the comma category V=? ? , induced by the homming functor ? ? : V op \Gamma! V : A 7\Gamma! A ? = A \Gammaffi? : (2) By definition, the objects of V=? ? (i.e. Id V =?...
Configuration Structures, Event Structures and Petri Nets
"... In this paper the correspondence between safe Petri nets and event structures, due to Nielsen, Plotkin and Winskel, is extended to arbitrary nets without selfloops, under the collective token interpretation. To this end we propose a more general form of event structure, matching the expressive powe ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
In this paper the correspondence between safe Petri nets and event structures, due to Nielsen, Plotkin and Winskel, is extended to arbitrary nets without selfloops, under the collective token interpretation. To this end we propose a more general form of event structure, matching the expressive power of such nets. These new event structures and nets are connected by relating both notions with configuration structures, which can be regarded as representations of either event structures or nets that capture their behaviour in terms of action occurrences and the causal relationships between them, but abstract from any auxiliary structure. A configuration structure can also be considered logically, as a class of propositional models, or—equivalently— as a propositional theory in disjunctive normal from. Converting this theory to conjunctive normal form is the key