当前期刊: Fundamenta Informaticae Go to current issue    加入关注    本刊投稿指南
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • Comparing Degenerate Strings
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Mai Alzamel; Lorraine A.K. Ayad; Giulia Bernardini; Roberto Grossi; Costas S. Iliopoulos; Nadia Pisanti; Solon P. Pissis; Giovanna Rosone

    Uncertain sequences are compact representations of sets of similar strings. They highlight common segments by collapsing them, and explicitly represent varying segments by listing all possible options. A generalized degenerate string (GD string) is a type of uncertain sequence. Formally, a GD string Ŝ is a sequence of n sets of strings of total size N, where the ith set contains strings of the same

    更新日期:2020-12-02
  • Discovering Object-centric Petri Nets
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Wil M.P. van der Aalst; Alessandro Berti

    Techniques to discover Petri nets from event data assume precisely one case identifier per event. These case identifiers are used to correlate events, and the resulting discovered Petri net aims to describe the life-cycle of individual cases. In reality, there is not one possible case notion, but multiple intertwined case notions. For example, events may refer to mixtures of orders, items, packages

    更新日期:2020-09-30
  • Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Johan Arcile; Raymond Devillers; Hanna Klaudel

    We formalise and study multi-agent timed models MAPTs (Multi-Agent with Periodic timed Tasks), where each agent is associated with a regular timed schema upon which all possible actions of the agent rely. MAPTs allow for an accelerated semantics and a layered structure of the state space, so that it is possible to explore the latter dynamically and use heuristics to greatly reduce the computation time

    更新日期:2020-09-30
  • Target-oriented Petri Net Synthesis
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Eike Best; Raymond Devillers; Evgeny Erofeev; Harro Wimmel

    When a Petri net is synthesised from a labelled transition system, it is frequently desirable that certain additional constraints are fulfilled. For example, in circuit design, one is often interested in constructing safe Petri nets. Targeting such subclasses of Petri nets is not necessarily computationally more efficient than targeting the whole class. For example, targeting safe nets is known to

    更新日期:2020-09-30
  • Flexible Process Model Mapping using Relaxation Labeling
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Josep Carmona; Lluís Padró; Luis Delicado

    Computing a mapping between two process models is a crucial technique, since it enables reasoning and operating across processes, like providing a similarity score between two processes, or merging different process variants to generate a consolidated process model. In this paper we present a new flexible technique for process model mapping, based on the relaxation labeling constraint satisfaction

    更新日期:2020-09-30
  • Stop-transitions of Petri Nets
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Jörg Desel; Marc Finthammer

    A transition t stops a place/transition Petri net if each reachable marking of the net enables only finite occurrence sequences without occurrences of t (i.e., every infinite occurrence sequence enabled at this marking contains occurrences of t). Roughly speaking, when t is stopped then all transitions of the net stop eventually. This contribution shows how to identify stoptransitions of unbounded

    更新日期:2020-09-30
  • Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Fabian Frei; Juraj Hromkovič; Juhani Karhumäki

    It is well known that the set of powers of any given order, for example squares, in a regular language need not be regular. Nevertheless, finite automata can identify them via their roots. More precisely, we recall that, given a regular language L, the set of square roots of L is regular. The sameholds true for the nth roots for any n and for the set of all nontrivial roots; we give a concrete construction

    更新日期:2020-09-30
  • Companions and an Essential Motion of a Reaction System
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Daniela Genova; Hendrik Jan Hoogeboom; Nataša Jonoska

    For a family of sets we consider elements that belong to the same sets within the family as companions. The global dynamics of a reactions system (as introduced by Ehrenfeucht and Rozenberg) can be represented by a directed graph, called a transition graph, which is uniquely determined by a one-outsubgraph, called the 0-context graph. We consider the companion classes of the outsets of a transition

    更新日期:2020-09-30
  • On Shuffling a Word with its Letter-to-Letter Substitution
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Vesa Halava; Tero Harju; Esa Sahla

    Denote by ш the operation of interleaving, or shuffling, of words. We prove that, given a regular language R and a letter-to-letter morphism φ, it is undecidable whether or not there exists a word ω such that ω ш φ(ω) ∩ R ≠ ø.

    更新日期:2020-09-30
  • An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Marco Baioletti; Gabriele Di Bari; Alfredo Milani; Valentino Santucci

    Crossover operators are very important components in Evolutionary Computation. Here we are interested in crossovers for the permutation representation that find applications in combinatorial optimization problems such as the permutation flowshop scheduling and the traveling salesman problem. We introduce three families of permutation crossovers based on algebraic properties of the permutation space

    更新日期:2020-09-30
  • MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Qian Matteo Chen; Alberto Finzi; Toni Mancini; Igor Melatti; Enrico Tronci

    In critical infrastructures like airports, much care has to be devoted in protecting radio communication networks from external electromagnetic interference. Protection of such mission-critical radio communication networks is usually tackled by exploiting radiogoniometers: at least three suitably deployed radiogoniometers, and a gateway gathering information from them, permit to monitor and localise

    更新日期:2020-09-30
  • Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Angelo Oddi; Riccardo Rasconi

    In this work we investigate the performance of greedy randomised search (GRS) techniques to the problem of compiling quantum circuits to emerging quantum hardware. Quantum computing (QC) represents the next big step towards power consumption minimisation and CPU speed boost in the future of computing machines. Quantum computing uses quantum gates that manipulate multi-valued bits (qubits). A quantum

    更新日期:2020-09-30
  • Optimal Personalised Treatment Computation through In Silico Clinical Trials on Patient Digital Twins
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Stefano Sinisi; Vadim Alimguzhin; Toni Mancini; Enrico Tronci; Federico Mari; Brigitte Leeners

    In Silico Clinical Trials (ISCT), i.e. clinical experimental campaigns carried out by means of computer simulations, hold the promise to decrease time and cost for the safety and efficacy assessment of pharmacological treatments, reduce the need for animal and human testing, and enable precision medicine. In this paper we present methods and an algorithm that, by means of extensive computer simulation-based

    更新日期:2020-09-30
  • Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems
    Fundam. Inform. (IF 1.298) Pub Date : 2020-09-28
    Richard J. Wallace

    Algorithms based on singleton arc consistency (SAC) show considerable promise for improving backtrack search algorithms for constraint satisfaction problems (CSPs). The drawback is that even the most efficient of them is still comparatively expensive. Even when limited to preprocessing, they give overall improvement only when problems are quite difficult to solve with more typical procedures such as

    更新日期:2020-09-30
  • Human-aware Contingent Planning
    Fundam. Inform. (IF 1.298) Pub Date : 2020-05-12
    Ignasi Andrés; Leliane Nunes de Barros; Karina Valdivia Delgado

    Contingent planning models a robot that must achieve a goal in a partially observable environment with non-deterministic actions. A solution for this problem is generated by searching in the space of belief states, where a belief state is a set of possible world states. However, if there is an unavoidable dead-end state, the robot will fail to accomplish his task. In this work, rather than limiting

    更新日期:2020-06-30
  • Solving the Team Composition Problem in a Classroom
    Fundam. Inform. (IF 1.298) Pub Date : 2020-05-12
    Felip Manyà; Santiago Negrete; Carme Roig; Joan Ramon Soler

    Given a classroom containing a fixed number of students and a fixed number of tables that can be of different sizes, as well as a list of preferred classmates to sit with for each student, the team composition problem in a classroom (TCPC) is the problem of finding an assignment of students to tables in such a way that the preferences of students are maximally-satisfied. In this paper, we first formally

    更新日期:2020-06-30
  • Justifications in Constraint Handling Rules for Logical Retraction in Dynamic Algorithms: Theory, Implementations, and Complexity
    Fundam. Inform. (IF 1.298) Pub Date : 2020-03-31
    Thom Frühwirth

    We present a concise source-to-source transformation that introduces justifications for user-defined constraints into the rule-based Constraint Handling Rules (CHR) programming language. There is no need to introduce a new semantics for justifications. This leads to a conservative extension of thelanguage, as we can show the equivalence of rule applications. A scheme of two rules suffices to allow

    更新日期:2020-03-31
  • Combining Static and Dynamic Contract Checking for Curry
    Fundam. Inform. (IF 1.298) Pub Date : 2020-03-31
    Michael Hanus

    Static type systems are usually not sufficient to express all requirements on function calls. Hence, contracts with pre- and postconditions can be used to express more complex constraints on operations. Contracts can be checked at run time to ensure that operations are only invoked with reasonablearguments and return intended results. Although such dynamic contract checking provides more reliable program

    更新日期:2020-03-31
  • A Constructor-Based Reachability Logic for Rewrite Theories
    Fundam. Inform. (IF 1.298) Pub Date : 2020-03-31
    Stephen Skeirik; Andrei Stefanescu; José Meseguer

    Reachability logic has been applied to 𝕂 rewrite-rule-based language definitions as a language-generic logic of programs to verify a wide range of sophisticated programs in conventional languages. Here we study how reachability logic can be made not just language-generic, but also rewrite-theory-generic, so that we can verify both conventional programs based on their rewriting logic operational semantics

    更新日期:2020-03-31
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
ERIS期刊投稿
欢迎阅读创刊号
自然职场,为您触达千万科研人才
spring&清华大学出版社
城市可持续发展前沿研究专辑
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
ACS Publications填问卷
阿拉丁试剂right
苏州大学
林亮
南方科技大学
朱守非
内蒙古大学
杨小会
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
上海纽约大学
浙江大学
廖矿标
天合科研
x-mol收录
试剂库存
down
wechat
bug