相关论文: On execution spaces of PV-programs
The purpose of this paper is to address some of the challenges of formally specifying components of shared-memory concurrent programs. The focus is to provide an abstract specification of a component that is suitable for use both by clients…
We describe a visual programming language for defining behaviors manifested by reified actors in a 2D virtual world that can be compiled into programs comprised of sequences of combinators that are themselves reified as actors. This makes…
We investigate one-point reduction methods of finite topological spaces. These methods allow one to study homotopy theory of cell complexes by means of elementary moves of their finite models. We also introduce the notion of h-regular…
We introduce a new `geometric realization' of an (abstract) simplicial complex, inspired by probability theory. This space (and its completion) is a metric space, which has the right (weak) homotopy type, and which can be compared with the…
Vector Symbolic Architectures combine a high-dimensional vector space with a set of carefully designed operators in order to perform symbolic computations with large numerical vectors. Major goals are the exploitation of their…
Part of the theory of logic programming and nonmonotonic reasoning concerns the study of fixed-point semantics for these paradigms. Several different semantics have been proposed during the last two decades, and some have been more…
This paper defines for each object $X$ that can be constructed out of a finite number of vertices and cells a vector $fX$ lying in a finite dimensional vector space. This is the flag vector of $X$. It is hoped that the quantum topological…
Software engineering education and training have obstacles caused by a lack of basic knowledge about a process of program execution. The article is devoted to the development of special tools that help to visualize the process. We analyze…
We introduce Multi-Environment Markov Decision Processes (MEMDPs) which are MDPs with a set of probabilistic transition functions. The goal in a MEMDP is to synthesize a single controller with guaranteed performances against all…
For a topological space $X$, we introduce a criterion for the $\rm FI$ module $H^i({\rm Conf}_n(X))$ to be finitely generated and give several applications. For instance, if $C$ is a finite connected $CW$ complex, then $X = C \times…
Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…
Algebraic topological methods have been used successfully in concurrency theory, the domain of theoretical computer science that deals with parallel computing. L. Fajstrup, E. Goubault, and M. Raussen have introduced partially ordered…
Many-core architectures of the future are likely to have distributed memory organizations and need fine grained concurrency management to be used effectively. The Self-adaptive Virtual Processor (SVP) is an abstract concurrent programming…
The term {\em meta-programming} refers to the ability of writing programs that have other programs as data and exploit their semantics. The aim of this paper is presenting a methodology allowing us to perform a correct termination analysis…
In the paper we introduce graphical objects (called state diagrams) related to functional programs. It is shown that state diagrams of functional programs can be used to solve problems of verification of functional programs. The proposed…
Mathematical models are increasingly used in both academia and the pharmaceutical industry to understand how phenotypes emerge from systems of molecular interactions. However, their current construction as monolithic sets of equations…
While the Vietoris-Rips complex is now widely used in both topological data analysis and the theory of hyperbolic groups, many of the fundamental properties of its homology have remained elusive. In this article, we define the Vietoris-Rips…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
The strict globular $\omega$-categories formalize the execution paths of a parallel automaton and the homotopies between them. One associates to such (and any) $\omega$-category $\C$ three homology theories. The first one is called the…
We interpret mathematically the pair (master equation, solution of master equation) up to equivalence, as the pair (a presentation of a free triangular dga T over a combination operad O, dga map of T into C, a dga over O) up to homotopy…