相关论文: Concurrent Process up to Homotopy (I)
We propose a logic for true concurrency whose formulae predicate about events in computations and their causal dependencies. The induced logical equivalence is hereditary history preserving bisimilarity, and fragments of the logic can be…
We introduce Neural Conjugate Flows (NCF), a class of neural network architectures equipped with exact flow structure. By leveraging topological conjugation, we prove that these networks are not only naturally isomorphic to a continuous…
Hypergraph is a topological model for networks. In order to study the topology of hypergraphs, the homology of the associated simplicial complexes and the embedded homology have been invented. In this paper, we give some algorithms to…
We define and study homotopy groups of cubical sets. To this end, we give four definitions of homotopy groups of a cubical set, prove that they are equivalent, and further that they agree with their topological analogues via the geometric…
In a network of dynamical systems, concurrent synchronization is a regime where multiple groups of fully synchronized elements coexist. In the brain, concurrent synchronization may occur at several scales, with multiple ``rhythms''…
State-space reduction techniques, used primarily in model-checkers, all rely on the idea that some actions are independent, hence could be taken in any (respective) order while put in parallel, without changing the semantics. It is thus not…
We present Concurrent GV (CGV), a functional calculus with message-passing concurrency governed by session types. With respect to prior calculi, CGV has increased support for concurrent evaluation and for cyclic network topologies. The…
We introduce a new category of higher-dimensional automata in which the morphisms are functional homotopy simulations, i.e. functional simulations up to concurrency of independent events. For this, we use unfoldings of higher-dimensional…
By studying spaces of flow graphs in a closed oriented manifold, we construct operations on its cohomology, parametrized by the homology of the moduli spaces of compact Riemann surfaces with boundary marked points. We show that the…
Persistent homology is a popular tool in Topological Data Analysis. It provides numerical characteristics of data sets which reflect global geometric properties. In order to be useful in practice, for example for feature generation in…
We perform a geometric study of the equilibrium locus of the flow that models the diffusion process over a circular network of cells. We prove that when considering the set of all possible values of the parameters, the equilibrium locus is…
We present Concurrent GV (CGV), a functional calculus with message-passing concurrency governed by session types. With respect to prior calculi, CGV has increased support for concurrent evaluation and for cyclic network topologies. The…
We introduce the notion of smooth cell complexes and its subclass consisting of gathered cell complexes within the category of diffeological spaces (cf. Definitions 1 and 3). It is shown that the following hold. (1) With respect to the…
"Concurrence topology" (Ellis and Klein \emph{Homology, Homotopy, and Applications,} \textbf{16}) is a TDA method for binary data. The idea is to construct a filtration consisting of Dowker complexes then compute persistent homology.…
We give an overview of the existence and regularity results for curvature flows and how these flows can be used to solve some problems in geometry and physics.
Concurrent separation logics have helped to significantly simplify correctness proofs for concurrent data structures. However, a recurring problem in such proofs is that data structure abstractions that work well in the sequential setting…
The well-known process algebras, such as CCS, ACP and $\pi$-calculus, capture the interleaving concurrency based on bisimilarity semantics. We did some work on truly concurrent process algebras, such as CTC, APTC and $\pi_{tc}$, capture the…
The analysis of concurrent and reactive systems is based to a large degree on various notions of process equivalence, ranging, on the so-called linear-time/branching-time spectrum, from fine-grained equivalences such as strong bisimilarity…
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…
Given a $C^{1+\beta}$ flow $\varphi$ with positive speed on a closed smooth Riemannian manifold, we code two homoclinically related $\varphi$-invariant probabilities by an irreducible countable topological Markov flow. As an application, we…