Fundamenta Informaticae最新文献

{"title":"Complexity Analysis of Continuous Petri Nets","authors":"Estíbaliz Fraca, S. Haddad","doi":"10.3233/FI-2015-1168","DOIUrl":"https://doi.org/10.3233/FI-2015-1168","url":null,"abstract":"At the end of the eighties, continuous Petri nets were introduced for: 1 alleviating the combinatory explosion triggered by discrete Petri nets i.e. usual Petri nets and, 2 modelling the behaviour of physical systems whose state is composed of continuous variables. Since then several works have established that the computational complexity of deciding some standard behavioural properties of Petri nets is reduced in this framework. Here we first establish the decidability of additional properties like coverability, boundedness and reachability set inclusion. We also design new decision procedures for reachability and lim-reachability problems with a better computational complexity. Finally we provide lower bounds characterising the exact complexity class of the reachability, the coverability, the boundedness, the deadlock freeness and the liveness problems. A small case study is introduced and analysed with these new procedures.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"3 1","pages":"170-189"},"PeriodicalIF":0.8,"publicationDate":"2013-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85645907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions","authors":"Jean-Marc Champarnaud, J. Dubernard, H. Jeanne, L. Mignot","doi":"10.3233/FI-2015-1189","DOIUrl":"https://doi.org/10.3233/FI-2015-1189","url":null,"abstract":"The aim of this paper is to design the polynomial construction of a finite recognizer for hairpin completions of regular languages. This is achieved by considering completions as new expression operators and by applying derivation techniques to the associated extended expressions called hairpin expressions. More precisely, we extend partial derivation of regular expressions to two-sided partial derivation of hairpin expressions and we show how to deduce a recognizer for a hairpin expression from its two-sided derived term automaton, providing an alternative proof of the fact that hairpin completions of regular languages are linear context-free.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"49 1","pages":"202-213"},"PeriodicalIF":0.8,"publicationDate":"2013-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74661076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Decomposition of Relations and Concept Lattices","authors":"BerghammerRudolf, WinterMichael","doi":"10.5555/2636469.2636471","DOIUrl":"https://doi.org/10.5555/2636469.2636471","url":null,"abstract":"We introduce the decomposition of an arbitrary relation into a sequential composition of three relations, viz. of a mapping with a partial order and then the transpose of a mapping. After presentin...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71130606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Consequence Relation for Graded Inference within the Frame of Infinite-valued Łukasiewicz Logic","authors":"David Picado Muiòo","doi":"10.3233/FI-2013-801","DOIUrl":"https://doi.org/10.3233/FI-2013-801","url":null,"abstract":"We present a family of consequence relations for graded inference among Łukasiewicz sentences. Given a set of premises and a threshold η, we consider consequences those sentences entailed to hold to at least some degree ζ whenever the premises hold to a degree at least η. We focus on the study of some aspects and features of the consequence relations presented and, in particular, on the effect of variations in the thresholds η, ζ.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"123 1","pages":"77-95"},"PeriodicalIF":0.8,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/FI-2013-801","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"69903011","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Asynchronous Systems of Parallel Communicating Finite Automata","authors":"Marcel Vollweiler","doi":"10.3233/FI-2015-1149","DOIUrl":"https://doi.org/10.3233/FI-2015-1149","url":null,"abstract":"Synchronous systems of parallel communicating one-way finite automata have already been investigated. There, all components work stepwise in parallel, and the communication between the components is realized by requesting states in a one-directional manner. This means that one component can request information in form of the current state from another component, where the latter one sends its current state without realizing that a communication takes place. Here, we introduce asynchronous systems of parallel communicating one-way and two-way finite automata with a bidirectional communication protocol. A communication only takes place, when both components-the requesting and the responding component-are ready to communicate. It is shown that almost all language classes that are characterized by these systems coincide with the language classes that are characterized by multi-head finite automata. Moreover, our communication protocol uses blocking point-to-point communications, i.e. a communication takes place between two components, and a communicating component is blocked until the communication has been finished. There have also been studied asynchronous systems of finite automata with non-blocking communication in the literature. Thus, we compare synchronous and asynchronous systems on the one hand and asynchronous systems with blocking and non-blocking communication on the other hand. Finally, we give some results on the communication complexity of our systems, where the amount of communication is measured by counting each message which is sent from one component to another during a computation of a system. Particularly, we show that with constantly many communications our systems can only accept regular languages, and at most linearly (polynomially) many communications are needed for systems of one-way (two-way) components depending on the length of the input. Further, there exists no system that executes more than constantly many and less than linearly many communications.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"111 1","pages":"243-257"},"PeriodicalIF":0.8,"publicationDate":"2013-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"79622397","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dynamic Programming Approach for Partial Decision Rule Optimization","authors":"AminTalha, ChikalovIgor, MoshkovMikhail, ZieloskoBeata","doi":"10.5555/2385625.2385627","DOIUrl":"https://doi.org/10.5555/2385625.2385627","url":null,"abstract":"This paper is devoted to the study of an extension of dynamic programming approach which allows optimization of partial decision rules relative to the length or coverage. We introduce an uncertaint...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2012-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71127944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Old and New Algorithms for Minimal Coverability Sets","authors":"A. Valmari, Henri Hansen","doi":"10.3233/FI-2014-1002","DOIUrl":"https://doi.org/10.3233/FI-2014-1002","url":null,"abstract":"Many algorithms for computing minimal coverability sets for Petri nets prune futures. That is, if a newmarking strictly covers an old one, then not just the old marking but also some subset of its successor markings is discarded from search. In this publication, a simpler algorithm that lacks future pruning is presented and proven correct. Its performance is compared with future pruning. It is demonstrated, using examples, that neither approach is systematically better than the other. However, the simple algorithm has some attractive features. It never needs to re-construct pruned parts of the minimal coverability set. It automatically gives most of the advantage of future pruning, if the minimal coverability set is constructed in depth-first or most tokens first order, and if so-called history merging is applied. Some implementation aspects of minimal coverability set construction are also discussed. Some measurements are given to demonstrate the effect of construction order and other implementation aspects.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"85 1","pages":"208-227"},"PeriodicalIF":0.8,"publicationDate":"2012-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83911698","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Pebble Games with Algebraic Rules","authors":"A. Dawar, Bjarki Holm","doi":"10.3233/FI-2017-1471","DOIUrl":"https://doi.org/10.3233/FI-2017-1471","url":null,"abstract":"We define a general framework of partition games for formulating two-player pebble games over finite structures. We show that one particular such game, which we call the invertible-map game, yields a family of polynomial-time approximations of graph isomorphism that is strictly stronger than the well-known Weisfeiler-Lehman method. The general framework we introduce includes as special cases the pebble games for finite-variable logics with and without counting. It also includes a matrix-equivalence game, introduced here, which characterises equivalence in the finite-variable fragments of matrix-rank logic. We show that the equivalence defined by the invertible-map game is a refinement of the equivalence defined by each of these three other games.","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"70 1","pages":"251-262"},"PeriodicalIF":0.8,"publicationDate":"2012-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"83272796","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An adaptive coarse graining method for signal transduction in three dimensions.","authors":"Michelle N Archuleta,&nbsp;Jason E McDermott,&nbsp;Jeremy S Edwards,&nbsp;Haluk Resat","doi":"10.3233/FI-2012-720","DOIUrl":"https://doi.org/10.3233/FI-2012-720","url":null,"abstract":"<p><p>The spatio-temporal landscape of the plasma membrane regulates activation and signal transduction of membrane bound receptors by restricting their two-dimensional mobility and by inducing receptor clustering. This regulation also extends to complex formation between receptors and adaptor proteins, which are the intermediate signaling molecules involved in cellular signaling that relay the received cues from cell surface to cytoplasm and eventually to the nucleus. Although their investigation poses challenging technical difficulties, there is a crucial need to understand the impact of the receptor diffusivity, clustering, and spatial heterogeneity, and of receptor-adaptor protein complex formation on the cellular signal transduction patterns. Building upon our earlier studies, we have developed an adaptive coarse-grained Monte Carlo method that can be used to investigate the role of diffusion, clustering and membrane corralling on receptor association and receptor-adaptor protein complex formation dynamics in three dimensions. The new Monte Carlo lattice based approach allowed us to introduce spatial resolution on the 2-D plasma membrane and to model the cytoplasm in three-dimensions. Being a multi-resolution approach, our new method makes it possible to represent various parts of the cellular system at different levels of detail and enabled us to utilize the locally homogeneous assumption when justified (e.g., cytoplasmic region away from the cell membrane) and avoid its use when high spatial resolution is needed (e.g., cell membrane and cytoplasmic region near the membrane) while keeping the required computational complexity manageable. Our results have shown that diffusion has a significant impact on receptor-receptor dimerization and receptor-adaptor protein complex formation kinetics. We have observed an \"adaptor protein hopping\" mechanism where the receptor binding proteins may hop between receptors to form short-lived transient complexes. This increased residence time of the adaptor proteins near cell membrane and their ability to frequently change signaling partners may explain the increase in signaling efficiency when receptors are clustered. We also hypothesize that the adaptor protein hopping mechanism can cause concurrent or sequential activation of multiple signaling pathways, thus leading to crosstalk between diverse biological functions.</p>","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"118 4","pages":""},"PeriodicalIF":0.8,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.3233/FI-2012-720","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"31971132","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Textures and Fuzzy Rough Sets","authors":"DikerMurat","doi":"10.5555/2361314.2361322","DOIUrl":"https://doi.org/10.5555/2361314.2361322","url":null,"abstract":"In this paper, we consider the Alexandroff topology for texture spaces. We prove that there exists a one-to-one correspondence between the Alexandroff ditopologies, and the reflexive and transitive...","PeriodicalId":56310,"journal":{"name":"Fundamenta Informaticae","volume":"1 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2011-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71127404","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}