-
Checking Sets of Pure Evolving Association Rules Fundam. Inform. (IF 1.298) Pub Date : 2021-02-09 Carlo Combi; Romeo Rizzi; Pietro Sala
Extracting association rules from large datasets has been widely studied in many variants in the last two decades; they allow to extract relations between values that occur more “often” in a database. With temporal association rules the concept has been declined to temporal databases. In this context the “most frequent” patterns of evolution of one or more attribute values are extracted. In the temporal
-
An Improved Set-based Reasoner for the Description Logic 𝒟ℒD4,× Fundam. Inform. (IF 1.298) Pub Date : 2021-02-09 Domenico Cantone; Marianna Nicolosi-Asmundo; Daniele Francesco Santamaria
We present a KE-tableau-based implementation of a reasoner for a decidable fragment of (stratified) set theory expressing the description logic 𝒟ℒ〈4LQSR,×〉(D) (𝒟ℒD4,×, for short). Our application solves the main TBox and ABox reasoning problems for 𝒟ℒD4,×. In particular, it solves the consistency and the classification problems for 𝒟ℒD4,×-knowledge bases represented in set-theoretic terms, and
-
Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker Fundam. Inform. (IF 1.298) Pub Date : 2021-02-09 Sylvain Conchon; Giorgio Delzanno; Angelo Ferrando
We show that Cubicle, an SMT-based infinite-state model checker, can be applied as a verification engine for GLog, a logic-based language based on relational updates rules that has been applied to specify topology-sensitive distributed protocols with asynchronous communication. In this setting, theabsence of protocol anomalies can be reduced to a coverability problem in which the initial set of configurations
-
The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic Fundam. Inform. (IF 1.298) Pub Date : 2021-01-13 Florian Bruse; Martin Lange; Etienne Lozes
Higher-Order Fixpoint Logic (HFL) is a modal specification language whose expressive power reaches far beyond that of Monadic Second-Order Logic, achieved through an incorporation of a typed λ-calculus into the modal μ-calculus. Its model checking problem on finite transition systems is decidable,albeit of high complexity, namely k-EXPTIME-complete for formulas that use functions of type order at most
-
Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction Fundam. Inform. (IF 1.298) Pub Date : 2021-01-13 Franck Cassez; Peter Gjøl Jensen; Kim Guldstrand Larsen
We address the safety verification and synthesis problems for real-time systems. We introduce real-time programs that are made of instructions that can perform assignments to discrete and real-valued variables. They are general enough to capture interesting classes of timed systems such as timed automata, stopwatch automata, time(d) Petri nets and hybrid automata. We propose a semi-algorithm using
-
Copyful Streaming String Transducers Fundam. Inform. (IF 1.298) Pub Date : 2021-01-13 Emmanuel Filiot; Pierre-Alain Reynier
Copyless streaming string transducers (copyless SST) have been introduced by R. Alur and P. Černý in 2010 as a one-way deterministic automata model to define transductions of finite strings. Copyless SST extend deterministic finite state automata with a set of variables in which to store intermediate output strings, and those variables can be combined and updated all along the run, in a linear manner
-
Topological Characterisation of Multi-Buffer Simulation Fundam. Inform. (IF 1.298) Pub Date : 2021-01-13 Milka Hutagalung
Multi-buffer simulation is an extension of simulation preorder that can be used to approximate inclusion of languages recognised by Büchi automata up to their trace closures. DUPLICATOR can use some bounded or unbounded buffers to simulate SPOILER’s move. It has been shown that multi-buffer simulation can be characterised with the existence of a continuous function. In this paper, we show that such
-
Probabilistic Timed Automata with Clock-Dependent Probabilities Fundam. Inform. (IF 1.298) Pub Date : 2021-01-13 Jeremy Sproston
Probabilistic timed automata are classical timed automata extended with discrete probability distributions over edges. We introduce clock-dependent probabilistic timed automata, a variant of probabilistic timed automata in which transition probabilities can depend linearly on clock values. Clock-dependent probabilistic timed automata allow the modelling of a continuous relationship between time passage
-
Stubborn Sets, Frozen Actions, and Fair Testing Fundam. Inform. (IF 1.298) Pub Date : 2021-01-13 Antti Valmari; Walter Vogler
Many partial order methods use some special condition for ensuring that the analysis is not terminated prematurely. In the case of stubborn set methods for safety properties, implementation of the condition is usually based on recognizing the terminal strong components of the reduced state space and, if necessary, expanding the stubborn sets used in their roots. In an earlier study it was pointed out
-
Abstract Contract Synthesis and Verification in the Symbolic 𝕂 Framework Fundam. Inform. (IF 1.298) Pub Date : 2020-12-10 María Alpuente; Daniel Pardo; Alicia Villanueva
In this article, we propose a symbolic technique that can be used for automatically inferring software contracts from programs that are written in a non-trivial fragment of C, called KERNELC, that supports pointer-based structures and heap manipulation. Starting from the semantic definition of KERNELC in the 𝕂 semantic framework, we enrich the symbolic execution facilities recently provided by 𝕂
-
A Formal, Resource Consumption-Preserving Translation from Actors with Cooperative Scheduling to Haskell Fundam. Inform. (IF 1.298) Pub Date : 2020-12-10 Elvira Albert; Nikolaos Bezirgiannis; Frank de Boer; Enrique Martin-Martin
We present a formal translation of a resource-aware extension of the Abstract Behavioral Specification (ABS) language to the functional language Haskell. ABS is an actor-based language tailored to the modeling of distributed systems. It combines asynchronous method calls with a suspend and resume mode of execution of the method invocations. To cater for the resulting cooperative scheduling of the method
-
lpopt: A Rule Optimization Tool for Answer Set Programming Fundam. Inform. (IF 1.298) Pub Date : 2020-12-10 Manuel Bichler; Michael Morak; Stefan Woltran
State-of-the-art answer set programming (ASP) solvers rely on a program called a grounder to convert non-ground programs containing variables into variable-free, propositional programs. The size of this grounding depends heavily on the size of the non-ground rules, and thus, reducing the size of such rules is a promising approach to improve solving performance. To this end, in this paper we announce
-
Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms Fundam. Inform. (IF 1.298) Pub Date : 2020-12-10 María Alpuente; Angel Cuenca-Ortega; Santiago Escobar; José Meseguer
The Homeomorphic Embedding relation has been amply used for defining termination criteria of symbolic methods for program analysis, transformation, and verification. However, homeomorphic embedding has never been investigated in the context of order-sorted rewrite theories that support symbolic execution methods modulo equational axioms. This paper generalizes the symbolic homeomorphic embedding relation
-
Dynamic Slicing for Concurrent Constraint Languages Fundam. Inform. (IF 1.298) Pub Date : 2020-12-10 Moreno Falaschi; Maurizio Gabbrielli; Carlos Olarte; Catuscia Palamidessi
Concurrent Constraint Programming (CCP) is a declarative model for concurrency where agents interact by telling and asking constraints (pieces of information) in a shared store. Some previous works have developed (approximated) declarative debuggers for CCP languages. However, the task of debuggingconcurrent programs remains difficult. In this paper we define a dynamic slicer for CCP (and other language
-
Selective Unification in (Constraint) Logic Programming Fundam. Inform. (IF 1.298) Pub Date : 2020-12-10 Fred Mesnard; Étienne Payet; Germán Vidal
Concolic testing is a well-known validation technique for imperative and object oriented programs. In a previous paper, we have introduced an adaptation of this technique to logic programming. At the heart of our framework lies a specific procedure that we call “selective unification”. It is used to generate appropriate run-time goals by considering all possible ways an atom can unify with the heads
-
Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms Fundam. Inform. (IF 1.298) Pub Date : 2020-12-10 Paul Tarau
Contrary to several other families of lambda terms, no closed formula or generating function is known and none of the sophisticated techniques devised in analytic combinatorics can currently help with counting or generating the set of simply-typed closed lambda terms of a given size. Moreover, their asymptotic scarcity among the set of closed lambda terms makes counting them via brute force generation
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
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 ≠ ø.
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
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
-
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
Contents have been reproduced by permission of the publishers.