Related papers: Verified Parameterized Choreographies Technical Re…
Choreographies specify multiparty interactions via message passing. A realisation of a choreography is a composition of independent processes that behave as specified by the choreography. Existing relations of correctness/completeness…
In this article, we mainly obtain the Riemann-Hurwitz theorems for harmonic morphisms on (vertex-weighted) metric graphs or metrized complexes of algebraic curves, inspired of the recent work on harmonic morphisms of graphs or metrized…
Choreographic Programming is a programming paradigm for building concurrent programs that are deadlock-free by construction, as a result of programming communications declaratively and then synthesising process implementations…
We solve prescribed problems for modified Schouten tensors in the conformal classes of smooth complete metrics, which extends the results obtained in prequel \cite{yuan-PUE1}. The key ingredient is to confirm the uniform ellipticity of…
We refine the relation of Web service orchestration, abstract process, Web service, and Web service choreography in Web service composition, under the situation of cross-organizational corporation. We also introduce the formal verification…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
Parameterized systems play a crucial role in the computer field, and their security is of great significance. Formal verification of parameterized protocols is especially challenging due to its "parameterized" feature, which brings…
In this paper, we define several measures induced by a finite directed graph. The study themselves is interesting ont only in the noncommutative probability point of view but also in the algebraic structure point of view, since to define…
This article gives a short description of pattern formation and coarsening phenomena and focuses on recent experimental and theoretical advances in these fields. It serves as an introduction to phase ordering kinetics and it will appear in…
We use a well known concept of proper vertex colouring of a graph to introduce the construction of a chromatic completion graph and its related parameter, the chromatic completion number of a graph. We then give the chromatic completion…
Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…
Choreographic models support a correctness-by-construction principle in distributed programming. Also, they enable the automatic generation of correct message-based communication patterns from a global specification of the desired system…
We consider the problem of finding a 1-planar drawing for a general graph, where a 1-planar drawing is a drawing in which each edge participates in at most one crossing. Since this problem is known to be NP-hard we investigate the…
Chordal graphs and chordal bigraphs enjoy beautiful characterizations, in terms of forbidden subgraphs, vertex/edge orderings, vertex/edge separating sets, and tree-like representations. In this paper, we introduce chordal signed graphs and…
We consider the verification of parameterized networks of replicated processes whose architecture is described by hyperedge-replacement graph grammars. Due to the undecidability of verification problems such as reachability or coverability…
A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…
Choreographic programming is an emerging programming paradigm for concurrent and distributed systems, whereby developers write the communications that should be enacted and then a distributed implementation is automatically obtained by…
We introduce a formal framework for analyzing trades in financial markets. These days, all big exchanges use computer algorithms to match buy and sell requests and these algorithms must abide by certain regulatory guidelines. For example,…
In this article, we study a calibrated version of Reifenberg theorem "with holes". In particular we study sets that are suitably approximable at all points and scales by calibrated planes and show that, without any additional hypotheses on…
A program for categorifying measure theory is outlined.