Related papers: Verified Parameterized Choreographies Technical Re…
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…
In this paper, using some properties of fundamental groups and covering spaces of connected polyhedra and CW-complexes, we present topological proof for some famous theorems about finitely presented groups.
A complete description of the deformation classes of real ruled manifolds is given. In particular, we prove that once the complex deformation class is fixed, the real deformation class is prescribed by the topology of the real structure.
In a recent work, we introduced a parametric framework for obtaining obstruction characterizations of graph parameters with respect to a quasi-ordering $\leqslant$ on graphs. Towards this, we proposed the concepts of class obstruction,…
This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there is a whole set of techniques that have been developed for…
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be…
The context of this paper is the use of formal methods for topology-based geometric modelling. Topology-based geometric modelling deals with objects of various dimensions and shapes. Usually, objects are defined by a graph-based topological…
Immersions of graphs to the projective plane are studied. A classification of immersions up to regular homotopy is given. A complete invariant of immersions up to regular homotopy is constructed. Equivalence classes are described.
We define a covering of a profinite graph to be a projective limit of a system of covering maps of finite graphs. With this notion of covering, we develop a covering theory for profinite graphs which is in many ways analogous to the…
In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms. However, these theoretical results have received very little attention from the practical perspective. Few of the algorithms are…
We consider the algorithm for verified integration of piecewise analytic functions given by Petras. The analysis of the algorithm contained in Patras' paper is limited to a narrow class of functions and gives upper bounds only. We present…
We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational (i.e., automata-based) and descriptive (i.e., logic-based)…
This manuscript introduces Diophantine labeling, a new way of labeling of the vertices for finite simple undirected graphs with some divisibility condition on the edges. Maximal graphs admitting Diophantine labeling are investigated and…
This paper is devoted to the study of a newly introduced tool, projectional coderivatives and the corresponding calculus rules in finite dimensions. We show that when the restricted set has some nice properties, more specifically, is a…
This paper focuses on various decompositions of topological measures, deficient topological measures, signed topological measures, and signed deficient topological measures. These set functions generalize measures and correspond to certain…
We characterize vertex algebras (in a suitable sense) as algebras over a certain graded co-operad. We also discuss some examples and categorical implications of this characterization.
This paper investigates the algorithmic safety verification problem of infinite-state parameterized concurrent programs over a rich set of communication topologies. The goal is to automatically produce a proof of correctness in the form of…
A deterministic method for synthesizing the interconnect topologies optimized for the required properties is proposed. The method is based on the original description of graphs by projections, on establishing the bijective correspondence of…