5,195 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

    On the non-efficient PAC learnability of conjunctive queries

    Get PDF
    This note serves three purposes: (i) we provide a self-contained exposition of the fact that conjunctive queries are not efficiently learnable in the Probably-Approximately-Correct (PAC) model, paying clear attention to the complicating fact that this concept class lacks the polynomial-size fitting property, a property that is tacitly assumed in much of the computational learning theory literature; (ii) we establish a strong negative PAC learnability result that applies to many restricted classes of conjunctive queries (CQs), including acyclic CQs for a wide range of notions of acyclicity; (iii) we show that CQs (and UCQs) are efficiently PAC learnable with membership queries.<p/

    Solving the Cubic Monotone 1-in-3 SAT Problem in Polynomial Time

    Get PDF
    The exact 3-satisfiability problem X3SAT is known to remain NP-complete when restricted to expressions where every variable has exactly three occurrences even in the absence of negated variables Cubic Monotone 1-in-3 SAT Problem The present paper shows that the Cubic Monotone 1-in-3 SAT Problem can be solved in polynomial time and therefore prove that the conjecture P NP hold

    Effective player guidance in logic puzzles

    Get PDF
    Pen & paper puzzle games are an extremely popular pastime, often enjoyed by demographics normally not considered to be ‘gamers’. They are increasingly used as ‘serious games’ and there has been extensive research into computationally generating and efficiently solving them. However, there have been few academic studies that have focused on the players themselves. Presenting an appropriate level of challenge to a player is essential for both player enjoyment and engagement. Providing appropriate assistance is an essential mechanic for making a game accessible to a variety of players. In this thesis, we investigate how players solve Progressive Pen & Paper Puzzle Games (PPPPs) and how to provide meaningful assistance that allows players to recover from being stuck, while not reducing the challenge to trivial levels. This thesis begins with a qualitative in-person study of Sudoku solving. This study demonstrates that, in contrast to all existing assumptions used to model players, players were unsystematic, idiosyncratic and error-prone. We then designed an entirely new approach to providing assistance in PPPPs, which guides players towards easier deductions rather than, as current systems do, completing the next cell for them. We implemented a novel hint system using our design, with the assessment of the challenge being done using Minimal Unsatisfiable Sets (MUSs). We conducted four studies, using two different PPPPs, that evaluated the efficacy of the novel hint system compared to the current hint approach. The studies demonstrated that our novel hint system was as helpful as the existing system while also improving the player experience and feeling less like cheating. Players also chose to use our novel hint system significantly more often. We have provided a new approach to providing assistance to PPPP players and demonstrated that players prefer it over existing approaches

    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

    Exponential-time approximation schemes via compression

    Get PDF
    In this paper, we give a framework to design exponential-time approximation schemes for basic graph partitioning problems such as k-way cut, Multiway Cut, Steiner k-cut and Multicut, where the goal is to minimize the number of edges going across the parts. Our motivation to focus on approximation schemes for these problems comes from the fact that while it is possible to solve them exactly in 2^nn^{

    Functional Nanomaterials and Polymer Nanocomposites: Current Uses and Potential Applications

    Get PDF
    This book covers a broad range of subjects, from smart nanoparticles and polymer nanocomposite synthesis and the study of their fundamental properties to the fabrication and characterization of devices and emerging technologies with smart nanoparticles and polymer integration

    Artificial Neural Network Logic-Based Reverse Analysis with Application to COVID-19 Surveillance Dataset

    Get PDF
    The Boolean Satisfiability Problem (BSAT) is one of the crucial decision problems in the fields of computing science, operation research, and mathematical logic that is resolved by deciding whether or not a solution to a Boolean formula exists. When there is a Boolean variable allocation that induces the Boolean formula to yield TRUE, then the SAT instance is satisfiable. The main purpose of this chapter is to utilize the optimization capacity of the Lyapunov energy function of Hopfield neural network (HNN) for optimal representation of the Random Satistibaility for COVID-19 Surveillance Data Set (CSDS) classification with the aim of extracting the relationship of dominant attributes that contribute to COVID-19 detections based on the COVID-19 Surveillance Data Set (CSDS). The logical mining task was carried based on the data mining technique of the energy minimization technique of HNN. The computational simulations have been carried using the different number of clauses in validating the efficiency of the proposed model in the training of COVID-19 Surveillance Data Set (CSDS) for classification. The findings reveals the effectiveness and robustness of k satisfiability reverse analysis with Hopfield neural network in extracting the dominant attributes toward COVID-19 Surveillance Data Set (CSDS) logic

    LIPIcs, Volume 251, ITCS 2023, Complete Volume

    Get PDF
    LIPIcs, Volume 251, ITCS 2023, Complete Volum
    • …
    corecore