Fundamenta Informaticae最新文献

英文中文

Complexity Analysis of Continuous Petri Nets 连续Petri网的复杂度分析

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2013-06-24 DOI: 10.3233/FI-2015-1168

Estíbaliz Fraca, S. Haddad

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.

在八十年代末，连续Petri网被引入:1减轻由离散Petri网(即通常的Petri网)引发的组合爆炸，2模拟状态由连续变量组成的物理系统的行为。从那时起，一些工作已经确定，在这个框架下，决定Petri网的一些标准行为属性的计算复杂性降低了。在这里，我们首先建立了可覆盖性、有界性和可达集包含等附加性质的可判定性。我们还为可达性和极限可达性问题设计了新的决策过程，具有更好的计算复杂度。最后给出了描述可达性、可覆盖性、有界性、死锁自由性和活性问题的精确复杂度类的下界。介绍了一个小型案例研究，并对这些新程序进行了分析。

引用次数: 39

Two-Sided Derivatives for Regular Expressions and for Hairpin Expressions 正则表达式和发夹表达式的双边导数

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2013-01-15 DOI: 10.3233/FI-2015-1189

Jean-Marc Champarnaud, J. Dubernard, H. Jeanne, L. Mignot

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.

本文的目的是设计一个正则语言发夹补全有限识别器的多项式结构。这是通过将补全视为新的表达式操作符并将派生技术应用于称为发夹表达式的相关扩展表达式来实现的。更准确地说，我们将正则表达式的偏派生扩展到发夹表达式的双面偏派生，并展示了如何从其双面派生项自动机中推导出发夹表达式的识别器，提供了正则语言的发夹补全是线性上下文无关的事实的另一种证明。

引用次数: 8

Decomposition of Relations and Concept Lattices 关系分解与概念格

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2013-01-01 DOI: 10.5555/2636469.2636471

BerghammerRudolf, WinterMichael

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...

我们将一个任意关系分解为三个关系的顺序组合，即一个偏序映射和一个映射的转置。后presentin……

引用次数: 0

A Consequence Relation for Graded Inference within the Frame of Infinite-valued Łukasiewicz Logic 无穷值Łukasiewicz逻辑框架内分级推理的一个推论关系

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2013-01-01 DOI: 10.3233/FI-2013-801

David Picado Muiòo

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 η, ζ.

我们提出了一组用于Łukasiewicz句子间分级推理的结果关系。给定一组前提和一个阈值η，我们考虑结果那些句子需要坚持至少某种程度ζ只要前提坚持至少η的程度。我们专注于研究结果关系的某些方面和特征，特别是阈值η， ζ的变化的影响。

引用次数: 2

Asynchronous Systems of Parallel Communicating Finite Automata 并行通信有限自动机的异步系统

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2013-01-01 DOI: 10.3233/FI-2015-1149

Marcel Vollweiler

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.

并行通信单向有限自动机的同步系统已经得到了研究。在那里，所有组件并行地逐步工作，组件之间的通信通过以单向方式请求状态来实现。这意味着一个组件可以从另一个组件请求当前状态形式的信息，后者发送其当前状态，而不会意识到发生了通信。本文介绍了一种具有双向通信协议的单向和双向有限自动机并行通信异步系统。只有当两个组件(请求组件和响应组件)都准备好进行通信时，才会进行通信。结果表明，几乎所有以这些系统为特征的语言类都与以多头有限自动机为特征的语言类相吻合。此外，我们的通信协议使用阻塞点对点通信，即在两个组件之间进行通信，并且通信组件被阻塞直到通信完成。文献中也研究了具有非阻塞通信的有限自动机异步系统。因此，我们一方面比较同步和异步系统，另一方面比较具有阻塞和非阻塞通信的异步系统。最后，我们给出了系统通信复杂性的一些结果，其中通信量是通过计算系统计算期间从一个组件发送到另一个组件的每条消息来衡量的。特别是，我们表明，随着不断的许多通信，我们的系统只能接受常规语言，并且根据输入的长度，单向(双向)组件的系统最多需要线性(多项式)许多通信。此外，不存在执行多于恒定多通信和少于线性多通信的系统。

{"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}

引用次数: 7

Dynamic Programming Approach for Partial Decision Rule Optimization 局部决策规则优化的动态规划方法

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2012-08-01 DOI: 10.5555/2385625.2385627

AminTalha, ChikalovIgor, MoshkovMikhail, ZieloskoBeata

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...

本文研究了动态规划方法的一种扩展，该方法允许部分决策规则相对于长度或覆盖范围进行优化。我们引入一个不确定的…

引用次数: 0

Old and New Algorithms for Minimal Coverability Sets 最小可覆盖性集的新旧算法

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2012-06-25 DOI: 10.3233/FI-2014-1002

A. Valmari, Henri Hansen

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.

许多计算Petri网最小可覆盖集的算法对期货进行了修剪。也就是说，如果一个新标记严格地覆盖了旧标记，那么不仅旧标记，而且其后续标记的某些子集也会从搜索中被丢弃。在本出版物中，提出了一种更简单的算法，该算法缺乏未来的修剪，并证明是正确的。并与未来修剪进行了性能比较。通过实例证明，两种方法在系统上都不如另一种方法。然而，简单的算法有一些吸引人的特点。它不需要重新构造最小可覆盖性集的修剪过的部分。如果最小可覆盖性集以深度优先或大多数令牌以一阶构造，并且应用了所谓的历史合并，则它会自动提供未来修剪的大部分优势。讨论了最小可覆盖性集构造的一些实现问题。并举例说明了施工顺序及其他实施方面的效果。

引用次数: 31

Pebble Games with Algebraic Rules 代数规则的卵石游戏

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2012-05-04 DOI: 10.3233/FI-2017-1471

A. Dawar, Bjarki Holm

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.

我们定义了一个划分对策的一般框架，用以表述有限结构上的二人卵石对策。我们证明了一种特殊的这样的对策，我们称之为可逆映射对策，产生了一组多项式时间近似的图同构，它严格强于著名的Weisfeiler-Lehman方法。我们引入的一般框架包括有计数和无计数有限变量逻辑的卵石博弈作为特例。它还包括一个矩阵等价对策，这里介绍了矩阵秩逻辑的有限变量片段的等价性。我们证明了可逆映射博弈定义的等价是这三个博弈定义的等价的细化。

引用次数: 25

An adaptive coarse graining method for signal transduction in three dimensions. 三维信号转导的自适应粗粒化方法。

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2012-01-01 DOI: 10.3233/FI-2012-720

Michelle N Archuleta, Jason E McDermott, Jeremy S Edwards, Haluk Resat

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.

细胞膜的时空格局通过限制膜结合受体的二维迁移和诱导受体聚集来调节膜结合受体的激活和信号转导。这种调节也延伸到受体和接头蛋白之间的复杂形成，接头蛋白是参与细胞信号传递的中间信号分子，将接收到的信号从细胞表面传递到细胞质并最终传递到细胞核。尽管他们的研究面临着具有挑战性的技术困难，但仍然需要了解受体扩散性、聚类和空间异质性以及受体-接头蛋白复合物形成对细胞信号转导模式的影响。在我们早期研究的基础上，我们开发了一种自适应粗粒度蒙特卡罗方法，可用于在三维空间中研究扩散、聚类和膜聚集在受体结合和受体-接头蛋白复合物形成动力学中的作用。新的基于蒙特卡罗晶格的方法使我们能够在二维质膜上引入空间分辨率，并在三维空间中模拟细胞质。作为一种多分辨率方法，我们的新方法可以在不同的细节水平上表示细胞系统的各个部分，并使我们能够在合理的情况下使用局部均匀假设(例如，细胞质区域远离细胞膜)，并避免在需要高空间分辨率时使用它(例如，细胞膜和细胞质区域靠近细胞膜)，同时保持所需的计算复杂性可管理。我们的研究结果表明，扩散对受体-受体二聚化和受体-接头蛋白复合物形成动力学有显著影响。我们观察到一种“衔接蛋白跳跃”机制，即受体结合蛋白可以在受体之间跳跃，形成短暂的瞬态复合物。这种接合蛋白在细胞膜附近停留时间的增加以及它们频繁改变信号伙伴的能力可能解释了当受体聚集时信号效率的增加。我们还假设接头蛋白跳跃机制可以引起多个信号通路的并发或顺序激活，从而导致不同生物功能之间的串扰。

{"title":"An adaptive coarse graining method for signal transduction in three dimensions.","authors":"Michelle N Archuleta, Jason E McDermott, Jeremy S Edwards, 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}

引用次数: 0

Textures and Fuzzy Rough Sets 纹理和模糊粗糙集

IF 0.8 4区计算机科学 Q4 COMPUTER SCIENCE, SOFTWARE ENGINEERING

Fundamenta Informaticae

Pub Date : 2011-08-01 DOI: 10.5555/2361314.2361322

DikerMurat

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...

在本文中，我们考虑了纹理空间的Alexandroff拓扑。证明了亚历山德罗夫构象与自反和传递构象之间存在一一对应关系。

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Fundamenta Informaticae

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀