7,450 research outputs found

    Decomposition of sequential and concurrent models

    Get PDF
    Le macchine a stati finiti (FSM), sistemi di transizioni (TS) e le reti di Petri (PN) sono importanti modelli formali per la progettazione di sistemi. Un problema fodamentale è la conversione da un modello all'altro. Questa tesi esplora il mondo delle reti di Petri e della decomposizione di sistemi di transizioni. Per quanto riguarda la decomposizione dei sistemi di transizioni, la teoria delle regioni rappresenta la colonna portante dell'intero processo di decomposizione, mirato soprattutto a decomposizioni che utilizzano due sottoclassi delle reti di Petri: macchine a stati e reti di Petri a scelta libera. Nella tesi si dimostra che una proprietà chiamata ``chiusura rispetto all'eccitazione" (excitation-closure) è sufficiente per produrre un insieme di reti di Petri la cui sincronizzazione è bisimile al sistema di transizioni (o rete di Petri di partenza, se la decomposizione parte da una rete di Petri), dimostrando costruttivamente l'esistenza di una bisimulazione. Inoltre, è stato implementato un software che esegue la decomposizione dei sistemi di transizioni, per rafforzare i risultati teorici con dati sperimentali sistematici. Nella seconda parte della dissertazione si analizza un nuovo modello chiamato MSFSM, che rappresenta un insieme di FSM sincronizzate da due primitive specifiche (Wait State - Stato d'Attesa e Transition Barrier - Barriera di Transizione). Tale modello trova un utilizzo significativo nella sintesi di circuiti sincroni a partire da reti di Petri a scelta libera. In particolare vengono identificati degli errori nell'approccio originale, fornendo delle correzioni.Finite State Machines (FSMs), transition systems (TSs) and Petri nets (PNs) are important models of computation ubiquitous in formal methods for modeling systems. Important problems involve the transition from one model to another. This thesis explores Petri nets, transition systems and Finite State Machines decomposition and optimization. The first part addresses decomposition of transition systems and Petri nets, based on the theory of regions, representing them by means of restricted PNs, e.g., State Machines (SMs) and Free-choice Petri nets (FCPNs). We show that the property called ``excitation-closure" is sufficient to produce a set of synchronized Petri nets bisimilar to the original transition system or to the initial Petri net (if the decomposition starts from a PN), proving by construction the existence of a bisimulation. Furthermore, we implemented a software performing the decomposition of transition systems, and reported extensive experiments. The second part of the dissertation discusses Multiple Synchronized Finite State Machines (MSFSMs) specifying a set of FSMs synchronized by specific primitives: Wait State and Transition Barrier. It introduces a method for converting Petri nets into synchronous circuits using MSFSM, identifies errors in the initial approach, and provides corrections

    Symmetries of Riemann surfaces and magnetic monopoles

    Get PDF
    This thesis studies, broadly, the role of symmetry in elucidating structure. In particular, I investigate the role that automorphisms of algebraic curves play in three specific contexts; determining the orbits of theta characteristics, influencing the geometry of the highly-symmetric Bring’s curve, and in constructing magnetic monopole solutions. On theta characteristics, I show how to turn questions on the existence of invariant characteristics into questions of group cohomology, compute comprehensive tables of orbit decompositions for curves of genus 9 or less, and prove results on the existence of infinite families of curves with invariant characteristics. On Bring’s curve, I identify key points with geometric significance on the curve, completely determine the structure of the quotients by subgroups of automorphisms, finding new elliptic curves in the process, and identify the unique invariant theta characteristic on the curve. With respect to monopoles, I elucidate the role that the Hitchin conditions play in determining monopole spectral curves, the relation between these conditions and the automorphism group of the curve, and I develop the theory of computing Nahm data of symmetric monopoles. As such I classify all 3-monopoles whose Nahm data may be solved for in terms of elliptic functions

    Composition and Cobordism Maps

    Get PDF
    We study the relationship between the algebra of module homomorphisms under composition and 4-dimensional cobordisms in the context of bordered Heegaard Floer homology. In particular, we prove that composition of module homomorphisms of type-DD structures induces the pair of pants cobordism map on Heegaard Floer homology in the morphism spaces formulation of the latter, due to Lipshitz--Ozsv\'{a}th--Thurston. Along the way, we prove a gluing result for cornered 4-manifolds constructed from bordered Heegaard triples. As applications, we present a new algorithm for computing arbitrary cobordism maps on Heegaard Floer homology and construct new nontrivial A∞A_\infty-deformations of Khovanov's arc algebras. Motivated by this last result and a K\"{u}nneth theorem for Heegaard Floer complexes of connected sums, we also prove the existence of a tensor product decomposition for arc algebras in characteristic 2 and show that there cannot be such a splitting over Z\Z

    Algorithms and complexity for approximately counting hypergraph colourings and related problems

    Get PDF
    The past decade has witnessed advancements in designing efficient algorithms for approximating the number of solutions to constraint satisfaction problems (CSPs), especially in the local lemma regime. However, the phase transition for the computational tractability is not known. This thesis is dedicated to the prototypical problem of this kind of CSPs, the hypergraph colouring. Parameterised by the number of colours q, the arity of each hyperedge k, and the vertex maximum degree Δ, this problem falls into the regime of Lovász local lemma when Δ ≲ qᵏ. In prior, however, fast approximate counting algorithms exist when Δ ≲ qᵏ/³, and there is no known inapproximability result. In pursuit of this, our contribution is two-folded, stated as follows. • When q, k ≥ 4 are evens and Δ ≥ 5·qᵏ/², approximating the number of hypergraph colourings is NP-hard. • When the input hypergraph is linear and Δ ≲ qᵏ/², a fast approximate counting algorithm does exist

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum

    Local geometry of NAE-SAT solutions in the condensation regime

    Full text link
    The local behavior of typical solutions of random constraint satisfaction problems (CSP) describes many important phenomena including clustering thresholds, decay of correlations, and the behavior of message passing algorithms. When the constraint density is low, studying the planted model is a powerful technique for determining this local behavior which in many examples has a simple Markovian structure. Work of Coja-Oghlan, Kapetanopoulos, Muller (2020) showed that for a wide class of models, this description applies up to the so-called condensation threshold. Understanding the local behavior after the condensation threshold is more complex due to long-range correlations. In this work, we revisit the random regular NAE-SAT model in the condensation regime and determine the local weak limit which describes a random solution around a typical variable. This limit exhibits a complicated non-Markovian structure arising from the space of solutions being dominated by a small number of large clusters, a result rigorously verified by Nam, Sly, Sohn (2021). This is the first characterization of the local weak limit in the condensation regime for any sparse random CSPs in the so-called one-step replica symmetry breaking (1RSB) class. Our result is non-asymptotic, and characterizes the tight fluctuation O(n−1/2)O(n^{-1/2}) around the limit. Our proof is based on coupling the local neighborhoods of an infinite spin system, which encodes the structure of the clusters, to a broadcast model on trees whose channel is given by the 1RSB belief-propagation fixed point. We believe that our proof technique has broad applicability to random CSPs in the 1RSB class.Comment: 43 pages, 2 figure

    Mirror symmetry for Dubrovin-Zhang Frobenius manifolds

    Get PDF
    Frobenius manifolds were formally defined by Boris Dubrovin in the early 1990s, and serve as a bridge between a priori very different fields of mathematics such as integrable systems theory, enumerative geometry, singularity theory, and mathematical physics. This thesis concerns, in particular, a specific class of Frobenius manifolds constructed on the orbit space of an extension of the affine Weyl group defined by Dubrovin together with Youjin Zhang. Here, we find Landau-Ginzburg superpotentials, or B-model mirrors, for these Frobenius structures by considering the characteristic equation for Lax operators of relativistic Toda chains as proposed by Andrea Brini. As a bonus, the results open up various applications in topology, integrable hierarchies, and Gromov-Witten theory, making interesting research questions in these areas more accessible. Some such applications are considered in this thesis. The form of the determinant of the Saito metric on discriminant strata is investigated, applications to the combinatorics of Lyashko-Looijenga maps are given, and investigations into the integrable systems theoretic and enumerative geometric applications are commenced

    A small catalogue of En-operads

    Full text link
    In this largely expository paper, we will present a list of En -operads and give complete, and in some cases new, proofs of the equivalences between these operads.Comment: Apart from changing the formatting, we changed the order in Section 5 and corrected some very minor errors (typos and misprints

    Fractal analysis of hyperbolic saddles with applications

    Full text link
    In this paper we express the Minkowski dimension of spiral trajectories near hyperbolic saddles and semi-hyperbolic singularities in terms of the Minkowski dimension of intersections of such spirals with transversals near these singularities. We apply these results to hyperbolic saddle-loops and hyperbolic 22-cycles to obtain upper bounds on the cyclicity of such limit periodic sets.Comment: 16 pages, 2 figure
    • …
    corecore