Results 1  10
of
17
On the Expressiveness of higher dimensional automata
 EXPRESS 2004, ENTCS
, 2005
"... Abstract In this paper I compare the expressive power of several models of concurrency based on their ability to represent causal dependence. To this end, I translate these models, in behaviour preserving ways, into the model of higher dimensional automata, which is the most expressive model under i ..."
Abstract

Cited by 20 (0 self)
 Add to MetaCart
(Show Context)
Abstract In this paper I compare the expressive power of several models of concurrency based on their ability to represent causal dependence. To this end, I translate these models, in behaviour preserving ways, into the model of higher dimensional automata, which is the most expressive model under investigation. In particular, I propose four different translations of Petri nets, corresponding to the four different computational interpretations of nets found in the literature. I also extend various equivalence relations for concurrent systems to higher dimensional automata. These include the history preserving bisimulation, which is the coarsest equivalence that fully respects branching time, causality and their interplay, as well as the STbisimulation, a branching time respecting equivalence that takes causality into account to the extent that it is expressible by actions overlapping in time. Through their embeddings in higher dimensional automata, it is now welldefined whether members of different models of concurrency are equivalent.
Transition and cancellation in concurrency and branching time
 Mathematical Structures in Computer Science 13(4) (2003
, 2002
"... We review the conceptual development of (true) concurrency and branching time starting from Petri nets and proceeding via Mazurkiewicz traces, pomsets, bisimulation, and event structures up to higher dimensional automata (HDAs), whose acyclic case may be identified with triadic event structures and ..."
Abstract

Cited by 13 (1 self)
 Add to MetaCart
We review the conceptual development of (true) concurrency and branching time starting from Petri nets and proceeding via Mazurkiewicz traces, pomsets, bisimulation, and event structures up to higher dimensional automata (HDAs), whose acyclic case may be identified with triadic event structures and triadic Chu spaces. Acyclic HDAs may be understood as the extension of Boolean logic with a third truth value expressing transition. We prove the necessity of such a third value under mild assumptions about the nature of observable events, and show that the expansion of any complete Boolean basis L to L with a third literal �a expressing a = forms an expressively complete basis for the representation of acyclic HDAs. The main contribution is a new event state × of cancellation, sibling to, serving to distinguish a(b + c) from ab + ac while simplifying the extensional definitions of termination �A and sequence AB. We show that every HDAX (acyclic HDA with ×) is representable in the expansion of L to L × with a fourth literal �a expressing a = ×.
EventState Duality: The Enriched Case
"... Enriched categories have been applied in the past to both eventoriented true concurrency models and stateoriented information systems, with no evident relationship between the two. Ordinary Chu spaces expose a natural duality between partially ordered temporal spaces (pomsets, event structures), a ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
Enriched categories have been applied in the past to both eventoriented true concurrency models and stateoriented information systems, with no evident relationship between the two. Ordinary Chu spaces expose a natural duality between partially ordered temporal spaces (pomsets, event structures), and partially ordered information systems.
Ordinary and Directed Combinatorial Homotopy, Applied to Image Analysis and Concurrency
 HOMOLOGY HOMOTOPY APPL
"... Combinatorial homotopical tools developed in previous works, and consisting essentially of intrinsic homotopy theories for simplicial complexes and directed simplicial complexes, can be applied to explore mathematical models representing images, or directed images, or concurrent processes. An image, ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
Combinatorial homotopical tools developed in previous works, and consisting essentially of intrinsic homotopy theories for simplicial complexes and directed simplicial complexes, can be applied to explore mathematical models representing images, or directed images, or concurrent processes. An image, represented by a metric space X, can be explored at a variable resolution # > 0, by equipping it with a structure t # X of simplicial complex depending on #; this complex can be further analysed by homotopy groups # n (X) = #n (t # X) and homology groups H n (X) = Hn (t # X). Loosely
The Glory of the Past and Geometrical Concurrency
"... This paper contributes to the general understanding of the geometrical model of concurrency that was named higher dimensional automata (HDAs) by Pratt and van Glabbeek. In particular we provide some understanding of the modal logics for such models and their expressive power in terms of the bisimula ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
This paper contributes to the general understanding of the geometrical model of concurrency that was named higher dimensional automata (HDAs) by Pratt and van Glabbeek. In particular we provide some understanding of the modal logics for such models and their expressive power in terms of the bisimulation that can be captured. The geometric model of concurrency is interesting from two main reasons: its generality and expressiveness, and the natural way in which autoconcurrency and action refinement are captured. Logics for this model, though, are not well investigated, where a simple, yet adequate, modal logic over HDAs was only recently introduced. As this modal logic, with two existential modalities, during and after, captures only split bisimulation, which is rather low in the spectrum of van Glabbeek and Vaandrager, the immediate question was what small extension of this logic could capture the more finegrained hereditary history preserving bisimulation (hh)? In response, the work in this paper provides several insights. One is the fact that the geometrical aspect of HDAs makes it possible to use for capturing the hhbisimulation, a standard modal logic that does not employ event variables, opposed to the two logics (over
Sheaves and geometric logic and applications to modular verification of complex systems
 ENTCS
, 2009
"... of complex systems ..."
(Show Context)
Homology, Homotopy and Applications, vol.5(2), 2003, pp.211–231 ORDINARY AND DIRECTED COMBINATORIAL HOMOTOPY, APPLIED TO IMAGE ANALYSIS AND CONCURRENCY
"... Combinatorial homotopical tools developed in previous works, and consisting essentially of intrinsic homotopy theories for simplicial complexes and directed simplicial complexes, can be applied to explore mathematical models representing images, or directed images, or concurrent processes. An image, ..."
Abstract
 Add to MetaCart
(Show Context)
Combinatorial homotopical tools developed in previous works, and consisting essentially of intrinsic homotopy theories for simplicial complexes and directed simplicial complexes, can be applied to explore mathematical models representing images, or directed images, or concurrent processes. An image, represented by a metric space X, can be explored at a variable resolution ɛ> 0, by equipping it with a structure tɛX of simplicial complex depending on ɛ; this complex can be further analysed by homotopy groups π ɛ n(X) = πn(tɛX) and homology groups H ɛ n(X) = Hn(tɛX). Loosely speaking, these objects detect singularities which can be captured by an ndimensional grid, with edges bound by ɛ; this works equally well for continuous or discrete regions of euclidean spaces. Similarly, a directed image, represented by an “asymmetric metric space”, produces a family of directed simplicial complexes sɛX and can be explored by the fundamental ncategory ↑Π ɛ n(X) of the latter. The same directed tools can be applied to combinatorial models of concurrent automata, like Chuspaces.
A Verified Algebra for ReadWrite Linked Data
"... The aim of this work is to verify an algebra for high level languages for reading and writing Linked Data. Linked Data refers to a collection of standards which aim to enhance the world’s data, by interlinking datasets through the Web. The starting point is as simple as using URIs as global identifi ..."
Abstract
 Add to MetaCart
(Show Context)
The aim of this work is to verify an algebra for high level languages for reading and writing Linked Data. Linked Data refers to a collection of standards which aim to enhance the world’s data, by interlinking datasets through the Web. The starting point is as simple as using URIs as global identifiers in data, but the technical challenges of managing data in this distributed setting are immense. An algebra is an essential contribution to this application domain. To verify the algebra, a syntax, semantics and proof technique are established. A high level language is defined that concisely captures query and update languages for Linked Data. The language is provided with a concise operational semantics. The natural notions of equivalence, contextual equivalence, is shown to coincide with the bisimulation proof technique. Ultimately, bisimulation allows the correctness of the algebra to be proven. A novel combination of techniques is used to establish the results.
Submitted to: c © C. Prisacariu This work is licensed under the Creative Commons Attribution License. Extensions of Configuration Structures
"... The present paper defines STstructures (and an extension of these, called STCstructures). The main purpose is to provide concrete relationships between highly expressive concurrency models coming from two different schools of thought: the higher dimensional automata, a statebased approach of Prat ..."
Abstract
 Add to MetaCart
(Show Context)
The present paper defines STstructures (and an extension of these, called STCstructures). The main purpose is to provide concrete relationships between highly expressive concurrency models coming from two different schools of thought: the higher dimensional automata, a statebased approach of Pratt and van Glabbeek; and the configuration structures and (in)pure event structures, an eventbased approach of van Glabbeek and Plotkin. In this respect we make comparative studies of the expressive power of STstructures relative to the above models. Moreover, standard notions from other concurrency models are defined for ST(C)structures, like steps and paths, bisimilarities, and action refinement, and related results are given. These investigations of ST(C)structures are intended to provide a better understanding of the stateevent duality described by Pratt, and also of the (a)cyclic structures of higher dimensional automata.