• Acta Inform. (IF 0.9) Pub Date : 2020-11-04
Ming Xu, Cheng-Chao Huang, Yuan Feng

Constrained reachability is a kind of quantitative path property, which is generally specified by multiphase until formulas originated in continuous stochastic logic. In this paper, through proposing a positive operator valued measure on the set of infinite paths, we develop an exact method to solve the constrained reachability problem for quantum Markov chains. The convergence rate of the reachability

更新日期：2020-11-04
• Acta Inform. (IF 0.9) Pub Date : 2020-09-09
Rabia Mazhar, Muddassar Azam Sindhu

There has been a recent growth of interest in software engineering community to use grammatical inference, aka automaton learning, in software engineering applications. This is primarily due to the reason that capacity of underlying hardware resources has improved significantly over the last years; which has enabled the use of this approach beyond the toy examples in a greater frequency. In this paper

更新日期：2020-09-10
• Acta Inform. (IF 0.9) Pub Date : 2020-06-13
Julian Gutierrez, Aniello Murano, Giuseppe Perelli, Sasha Rubin, Thomas Steeples, Michael Wooldridge

The overall aim of our research is to develop techniques to reason about the equilibrium properties of multi-agent systems. We model multi-agent systems as concurrent games, in which each player is a process that is assumed to act independently and strategically in pursuit of personal preferences. In this article, we study these games in the context of finite-memory strategies, and we assume players’

更新日期：2020-06-13
• Acta Inform. (IF 0.9) Pub Date : 2020-05-24
Litan Kumar Das, Kumar Sankar Ray

In this paper, we investigate a bitopological duality for algebras of Fitting’s multi-valued logic. We also extend the natural duality theory for $$\mathbb {ISP_I}(\mathcal {L})$$ by developing a duality for $$\mathbb {ISP}(\mathcal {L})$$, where $$\mathcal {L}$$ is a finite algebra in which underlying lattice is bounded distributive.

更新日期：2020-05-24
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Ansgar Fehnker

I have known Rob van Glabbeek as a colleague for 16 years, of which eight years were in the same research group. However, this only amounts to less than half of his professional life which started in the mid-1980s at the Centrum voor Wiskunde en Informatica in Amsterdam. In this article, I am trying to piece together the information I got from colleagues as well as from Rob himself—to the best of my

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Chenyi Zhang

We review the grammatical inference problem for regular languages which aims to generate a deterministic finite automaton from a representative set of training sample strings known to be in or not in the language. Although the general problem of producing a minimal DFA consistent with a given sample is known to be NP-hard, it is possible to generate minimal consistent DFA in polynomial time if certain

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
David Mestel; A. W. Roscoe

Hoare’s Communicating Sequential Processes (CSP) (Hoare in Communicating Sequential Processes, Prentice-Hall Inc, Upper Saddle River, 1985) admits a rich universe of semantic models closely related to the van Glabbeek spectrum. In this paper we study finite observational models, of which at least six have been studied for CSP, namely traces, stable failures, revivals, acceptances, refusal testing and

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Manuel Gieseking; Ernst-Rüdiger Olderog; Nick Würdemann

The manual implementation of local controllers for autonomous agents in a distributed and concurrent setting is an ambitious and error-prune task. Synthesis algorithms, however, allow for the automatic generation of such controllers given a formal specification of the system’s goal. Recently, high-level Petri games were introduced to allow for a concise modeling technique of distributed systems with

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Mathias Claus Jensen; Kim Guldstrand Larsen

We propose an axiomatization for weighted branching bisimulation over a weighted process algebra with positive rational weights including zero and show that this axiomatization is both sound and complete. Our proof of soundness and completeness are inspired by similar results by Milner for strong and weak bisimulation and by van Glabbeek for branching bisimulation. We also show that the claim that

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Walter Vogler; Gerald Lüttgen

Over the past two decades, de Alfaro and Henzinger’s interface automata (IA) have become a popular formal framework for the component-based specification of concurrent systems. IA’s parallel composition assumes that a component may wait on inputs but never on outputs, implying that an output must be consumed immediately or a communication error occurs. By now, the literature contains a number of semantics

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Mark Bouwman; Bas Luttik; Tim Willemse

We enrich the operational semantics of a simple process calculus with ACP-style communication with a concurrency relation, so that for every process expression there exists an associated notion of just path. We then present sufficient conditions on the communication function and the syntax of process expressions that facilitate the formulation of justness on the level of labels rather than on individual

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Marc Jasper; Maximilian Schlüter; Bernhard Steffen

In this paper, we prove that Hennessy–Milner Logic (HML), despite its structural limitations, is sufficiently expressive to specify an initial property $$\varphi _0$$ and a characteristic invariant $$\upchi _{_I}$$ for an arbitrary finite-state process P such that $$\varphi _0 \wedge \mathbf{AG }(\upchi _{_I})$$ is a characteristic formula for P. This means that a process Q, even if infinite state

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Antti Valmari

In process algebras, a congruence is an equivalence that remains valid when any subsystem is replaced by an equivalent one. Whether or not an equivalence is a congruence depends on the set of operators used in building systems from subsystems. Numerous congruences have been found, differing from each other in fine details, major ideas, or both, and none of them is good for all situations. The world

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Christel Baier; Pedro R. D’Argenio; Holger Hermanns

In this paper we look at one of the seminal works of Rob van Glabbeek from a probabilistic angle. We develop the bisimulation spectrum with silent moves for probabilistic models, namely Markov decision processes. Especially the treatment of divergence makes this endeavour challenging. We provide operational as well as logical characterisations of a total of 32 bisimilarities.

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-05-06
Xudong Qin; Simon Bliudze; Eric Madelaine; Zechen Hou; Yuxin Deng; Min Zhang

Open pNets are formal models that can express the behaviour of open systems, either synchronous, asynchronous, or heterogeneous. They are endowed with a symbolic operational semantics in terms of open automata, which allows us to check properties of such systems in a compositional manner. We present an algorithm computing these semantics, building predicates expressing the synchronisation conditions

更新日期：2020-05-06
• Acta Inform. (IF 0.9) Pub Date : 2020-03-13
Roberto Gorrieri

BPP nets, a subclass of finite Place/Transition Petri nets, are equipped with an efficiently decidable, truly concurrent, bisimulation-based, behavioral equivalence, called team bisimilarity. This equivalence is a very intuitive extension of classic bisimulation equivalence (over labeled transition systems) to BPP nets and it is checked in a distributed manner, without necessarily building a global

更新日期：2020-04-20
• Acta Inform. (IF 0.9) Pub Date : 2020-02-20
Mingshuai Chen, Martin Fränzle, Yangjia Li, Peter N. Mosaad, Naijun Zhan

The possible interactions between a controller and its environment can naturally be modelled as the arena of a two-player game, and adding an appropriate winning condition permits to specify desirable behavior. The classical model here is the positional game, where both players can (fully or partially) observe the current position in the game graph, which in turn is indicative of their mutual current

更新日期：2020-04-20
• Acta Inform. (IF 0.9) Pub Date : 2020-02-17
Viliam Geffert, Christos A. Kapoutsis, Mohammad Zakzok

We consider the problem of converting a two-way alternating finite automaton (2AFA) with n states to a 2AFA accepting the complement of its language. Complementing is trivial for halting2AFAs, by swapping the roles of existential and universal decisions and the roles of accepting and rejecting states. However, since 2AFAs do not have resources to detect infinite loops by counting executed steps, it

更新日期：2020-04-20
• Acta Inform. (IF 0.9) Pub Date : 2020-02-10
Debayan Ganguly, Kingshuk Chatterjee, Kumar Sankar Ray

One-way quantum finite automata are reversible in nature, which greatly reduces its accepting property. In fact, the set of languages accepted by one-way quantum finite automata is a proper subset of regular languages. In this paper, we replace the tape head of one-way quantum finite automata with DNA double strand and name the model Watson–Crick quantum finite automata. The non-injective complementarity

更新日期：2020-04-20
• Acta Inform. (IF 0.9) Pub Date : 2020-02-04
Angelo Borsotti, Luca Breveglieri, Stefano Crespi Reghizzi, Angelo Morzenti

We introduce a new parser generator, called Berry–Sethi Parser (BSP), for ambiguous regular expressions (RE). The generator constructs a deterministic finite-state transducer that recognizes an input string, as the classical Berry–Sethi algorithm does, and additionally outputs a linear representation of all the syntax trees of the string; for infinitely ambiguous strings, a policy for selecting representative

更新日期：2020-04-20
• Acta Inform. (IF 0.9) Pub Date : 2020-01-06
Benedek Nagy, Shaghayegh Parchami

Abstract Watson–Crick (abbreviated as WK) finite automata are working on double stranded DNA molecule that is also called Watson–Crick tape. Subsequently, these automata have two reading heads, one for each strand. While in traditional WK automata both heads read the whole input in the same physical direction, in $$5'\rightarrow 3'$$ WK automata the heads start from the two extremes (say $$5'$$ end

更新日期：2020-04-20
• Acta Inform. (IF 0.9) Pub Date : 2020-01-06
Johanna Björklund, Loek Cleophas

We present a minimization algorithm for non-deterministic finite state automata that finds and merges bisimulation-equivalent states. The bisimulation relation is computed through partition aggregation, in contrast to existing algorithms that use partition refinement. The algorithm simultaneously generalises and simplifies an earlier one by Watson and Daciuk for deterministic devices. We show the algorithm

更新日期：2020-04-20
• Acta Inform. (IF 0.9) Pub Date : 2019-12-09
Joost Engelfriet, Kazuhiro Inaba, Sebastian Maneth

Compositions of tree-walking tree transducers form a hierarchy with respect to the number of transducers in the composition. As main technical result it is proved that any such composition can be realized as a linear-bounded composition, which means that the sizes of the intermediate results can be chosen to be at most linear in the size of the output tree. This has consequences for the expressiveness

更新日期：2020-04-20
• Acta Inform. (IF 0.9) Pub Date : 2020-01-13
Jan A. Bergstra; Alban Ponse

We consider several novel congruences on the signature of meadows with the aim to survey different notions of fractions. In particular we suggest a notion of “true fraction”.

更新日期：2020-01-13
• Acta Inform. (IF 0.9) Pub Date : 2019-12-02
Arnab Bhattacharyya, Ashutosh Gupta, Lakshmanan Kuppusamy, Somya Mani, Ankit Shukla, Mandayam Srivas, Mukund Thattai

Abstract Vesicle traffic systems (VTSs) transport cargo among the intracellular compartments of eukaryotic cells. The compartments are viewed as nodes that are labeled by their chemical identity and the transport vesicles are similarly viewed as labeled edges between the nodes. Several interesting questions about VTSs translate to combinatorial search and synthesis problems. We present novel encodings

更新日期：2020-01-04
• Acta Inform. (IF 0.9) Pub Date : 2019-11-07
Ivan Lanese, Doriana Medić, Claudio Antares Mezzina

The notion of reversible computing is attracting interest because of its applications in diverse fields, in particular the study of programming abstractions for fault tolerant systems. Most computational models are not naturally reversible since computation causes loss of information, and history information must be stored to enable reversibility. In the literature, two approaches to reverse the CCS

更新日期：2020-01-04
• Acta Inform. (IF 0.9) Pub Date : 2019-11-07
Steven Engels, Tony Tan, Jan Van den Bussche

Abstract A family of logics for expressing patterns in sequences is investigated. The logics are all fragments of first-order logic, but they are variable-free. Instead, they can use substring and subsequence constraints as basic propositions. Propositions expressing constraints on the beginning or the end of the sequence are also available. Also wildcards can be used, which is important when the alphabet

更新日期：2020-01-04
• Acta Inform. (IF 0.9) Pub Date : 2019-12-20
Nahal Mirzaie; Fathiyeh Faghih; Swen Jacobs; Borzoo Bonakdarpour

Self-stabilization in distributed systems is a technique to guarantee convergence to a set of legitimate states without external intervention when a transient fault or bad initialization occurs. Recently, there has been a surge of efforts in designing techniques for automated synthesis of self-stabilizing algorithms that are correct by construction. Most of these techniques, however, are not parameterized

更新日期：2019-12-20
• Acta Inform. (IF 0.9) Pub Date : 2019-12-07
Bernd Finkbeiner; Christopher Hahn; Philip Lukert; Marvin Stenger; Leander Tentrup

We study the reactive synthesis problem for hyperproperties given as formulas of the temporal logic HyperLTL. Hyperproperties generalize trace properties, i.e., sets of traces, to sets of sets of traces. Typical examples are information-flow policies like noninterference, which stipulate that no sensitive data must leak into the public domain. Such properties cannot be expressed in standard linear

更新日期：2019-12-07
• Acta Inform. (IF 0.9) Pub Date : 2019-12-06
Alessandro Abate; Iury Bessa; Lucas Cordeiro; Cristina David; Pascal Kesseli; Daniel Kroening; Elizabeth Polgreen

We present a sound and automated approach to synthesizing safe, digital controllers for physical plants represented as time-invariant models. Models are linear differential equations with inputs, evolving over a continuous state space. The synthesis precisely accounts for the effects of finite-precision arithmetic introduced by the controller. The approach uses counterexample-guided inductive synthesis:

更新日期：2019-12-06
• Acta Inform. (IF 0.9) Pub Date : 2019-12-05
Jörg Endrullis; Jan Willem Klop; Rena Bakhshi

Although finite state transducers are very natural and simple devices, surprisingly little is known about the transducibility relation they induce on streams (infinite words). We collect some intriguing problems that have been unsolved since several years. The transducibility relation arising from finite state transduction induces a partial order of stream degrees, which we call Transducer degrees

更新日期：2019-12-05
• Acta Inform. (IF 0.9) Pub Date : 2019-12-05
Elizabeth Firman; Shahar Maoz; Jan Oliver Ringert

Reactive synthesis for the GR(1) fragment of LTL has been implemented and studied in many works. In this work we present and evaluate a list of heuristics to potentially reduce running times for GR(1) synthesis and related algorithms. The list includes several heuristics for controlled predecessor computation and BDDs, early detection of fixed-points and unrealizability, fixed-point recycling, and

更新日期：2019-12-05
• Acta Inform. (IF 0.9) Pub Date : 2019-12-02
Maciej Gazda; Wan Fokkink; Vittorio Massaro

A basic sanity property of a process semantics is that it constitutes a congruence with respect to standard process operators. This issue has been traditionally addressed by developing, for a specific process semantics, a syntactic format for operational semantics specifications. We suggest a novel, orthogonal approach, which focuses on a specific process operator and determines a class of congruence

更新日期：2019-12-02
• Acta Inform. (IF 0.9) Pub Date : 2019-11-28
Benjamin Bisping; Uwe Nestmann; Kirstin Peters

Coupled similarity is an equivalence on (labeled) transition systems; its distinguishing power lies between (weak) bisimilarity and (may) testing equivalence. Its main feature, compared to weak bisimilarity, is an additional $$\tau$$-law that abstracts from the atomicity of internal choices among several possible branches, thus allowing for gradual commitments. The need for this $$\tau$$-law in applications

更新日期：2019-11-28
• Acta Inform. (IF 0.9) Pub Date : 2019-11-21
Michael Luttenberger; Philipp J. Meyer; Salomon Sickert

The synthesis of reactive systems from linear temporal logic (LTL) specifications is an important aspect in the design of reliable software and hardware. We present our adaption of the classic automata-theoretic approach to LTL synthesis, implemented in the tool Strix which has won the two last synthesis competitions (Syntcomp2018/2019). The presented approach is (1) structured, meaning that the states

更新日期：2019-11-21
• Acta Inform. (IF 0.9) Pub Date : 2019-11-09
Rayna Dimitrova; Mahsa Ghasemi; Ufuk Topcu

A challenging problem for autonomous systems is to synthesize a reactive controller that conforms to a set of given correctness properties. Linear temporal logic (LTL) provides a formal language to specify the desired behavioral properties of systems. In applications in which the specifications originate from various aspects of the system design, or consist of a large set of formulas, the overall system

更新日期：2019-11-09
• Acta Inform. (IF 0.9) Pub Date : 2019-10-31
Daniel Neider; Alexander Weinert; Martin Zimmermann

Recently, Dallal, Neider, and Tabuada studied a generalization of the classical game-theoretic model used in program synthesis, which additionally accounts for unmodeled intermittent disturbances. In this extended framework, one is interested in computing optimally resilient strategies, i.e., strategies that are resilient against as many disturbances as possible. Dallal, Neider, and Tabuada showed

更新日期：2019-10-31
• Acta Inform. (IF 0.9) Pub Date : 2019-10-04

We present an algorithm for solving two-player safety games that combines a mixed forward/backward search strategy with a symbolic representation of the state space. By combining forward and backward exploration, our algorithm can synthesize strategies that are eager in the sense that they try to prevent progress towards the error states as soon as possible, whereas standard backwards algorithms often

更新日期：2019-10-04
• Acta Inform. (IF 0.9) Pub Date : 2019-09-16
Eduard Baranov, Simon Bliudze

The Original Article has been funded.

更新日期：2019-09-16
• Acta Inform. (IF 0.9) Pub Date : 2019-09-13
Antoine Girard; Gregor Gössler

Control of continuous and hybrid systems using discrete abstractions often suffers from scalability issues, due to the use of state space partitions as symbolic states. In this paper, for incrementally stable switched systems, we introduce a class of abstractions that do not rely on state space partitions but use mode sequences as symbolic states. Our approach differs from existing works by the possibility

更新日期：2019-09-13
• Acta Inform. (IF 0.9) Pub Date : 2019-09-01
Hans Hüttel

The $$\pi$$-calculus is a well-established theoretical framework for describing mobile and parallel computation using name passing, and a central notion here is that of name binding. Unfortunately, non-trivial properties of $$\pi$$-calculus processes such as termination and bisimilarity are undecidable as a consequence of the fact that the calculus is Turing-powerful. The classes of depth-bounded

更新日期：2019-09-01
• Acta Inform. (IF 0.9) Pub Date : 2019-08-30
Hila Peleg; Shachar Itzhaky; Sharon Shoham; Eran Yahav

Program synthesis is the problem of computing from a specification a program that implements it. New and popular variations on the synthesis problem accept specifications in formats that are easier for the human synthesis user to provide: input–output example pairs, type information, and partial logical specifications. These are all partial specification formats, encoding only a fraction of the expected

更新日期：2019-08-30
• Acta Inform. (IF 0.9) Pub Date : 2019-07-08
Petr Jančar; David Purser

Place/transition Petri nets are a standard model for a class of distributed systems whose reachability spaces might be infinite. One of well-studied topics is verification of safety and liveness properties in this model; despite an extensive research effort, some basic problems remain open, which is exemplified by the complexity status of the reachability problem that is still not fully clarified.

更新日期：2019-07-08
• Acta Inform. (IF 0.9) Pub Date : 2019-06-15
Eduard Baranov, Simon Bliudze

We extend our previous algebraic formalisation of the notion of component-based framework in order to formally define two forms—strong and weak—of the notion of full expressiveness and study their properties. Our earlier result shows that the BIP (Behaviour–Interaction–Priority) framework does not possess the strong full expressiveness with respect to the sub-class of GSOS rules used for the definition

更新日期：2019-06-15
• Acta Inform. (IF 0.9) Pub Date : 2019-05-31
Paul Bonsma; Daniël Paulusma

We introduce in a general setting a dynamic programming method for solving reconfiguration problems. Our method is based on contracted solution graphs, which are obtained from solution graphs by performing an appropriate series of edge contractions that decrease the graph size without losing any critical information needed to solve the reconfiguration problem under consideration. Our general framework

更新日期：2019-05-31
• Acta Inform. (IF 0.9) Pub Date : 2019-05-21
Amr Elmasry; Mostafa Kahla; Fady Ahdy; Mahmoud Hashem

We show how a few modifications to the red–black trees allow for constant worst-case update time (once the position of the element to be inserted or deleted is known). The resulting structure is based on relaxing some of the properties of the red–black trees while guaranteeing that the height remains logarithmic with respect to the number of nodes. Compared to the other search trees with constant worst-case

更新日期：2019-05-21
• Acta Inform. (IF 0.9) Pub Date : 2019-04-27
Sathyanarayanan Srinivasan; Ramesh Kandukoori

Consensus is a fundamental abstraction in distributed systems and its solvability is widely discussed in the literature. In message passing distributed systems where there is a need to solve sequential instances of consensus, it is possible that some processes become faulty during one instance and recover later in another instance. Though consensus algorithms should be equipped both to handle process

更新日期：2019-04-27
• Acta Inform. (IF 0.9) Pub Date : 2019-03-01
Ilaria Castellani; Mariangiola Dezani-Ciancaglini; Paola Giannini

We propose a calculus for concurrent reversible multiparty sessions, equipped with a flexible choice operator allowing for different sets of participants in each branch. This operator is inspired by the notion of connecting action recently introduced by Hu and Yoshida to describe protocols with optional participants. We argue that this choice operator allows for a natural description of typical communication

更新日期：2019-03-01
• Acta Inform. (IF 0.9) Pub Date : 2019-02-22
Jurriaan Rot

Turi and Plotkin introduced an elegant approach to structural operational semantics based on universal coalgebra, parametric in the type of syntax and the type of behaviour. Their framework includes abstract GSOS, a categorical generalisation of the classical GSOS rule format, as well as its categorical dual, coGSOS. Both formats are well behaved, in the sense that each specification has a unique model

更新日期：2019-02-22
• Acta Inform. (IF 0.9) Pub Date : 2019-01-01
Tomáš Fiedor; Lukáš Holík; Ondřej Lengál; Tomáš Vojnar

We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within the state-of-the-art automata-based WS1S decision procedure implemented e.g. in Mona. The way in which the standard decision procedure processes quantifiers involves determinization, with its worst case exponential complexity

更新日期：2019-01-01
• Acta Inform. (IF 0.9) Pub Date : 2018-11-08
Pietro Cenciarelli; Daniele Gorla; Ivano Salvo

We present a simple model, called depleatable channels, of multi-hop communication in ad hoc networks. We introduce a model for channel energy consumption, and we propose a notion of channel equivalence based on the communication service they provide, regardless of specific routing protocols. In particular, we consider equivalent two channels with identical maximum and minimum inhibiting flow, and

更新日期：2018-11-08
• Acta Inform. (IF 0.9) Pub Date : 2018-10-29
Wolfgang Reisig

Distributed systems are often organized in chains of components (e.g. business process chains), where each component naturally has a double-sided (left and right) interface. We suggest a corresponding, highly abstract and general framework (in mathematical terms: a monoid) of components and their composition, with minimal assumptions on the underlying global infrastructure (in fact, just a global set

更新日期：2018-10-29
• Acta Inform. (IF 0.9) Pub Date : 2018-08-30
Adrian Atanasiu; Ghajendran Poovanandran; Wen Chean Teh

Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes the number of occurrences of certain predefined subwords in that word. In this paper, we compute the Parikh matrix of any word raised to an arbitrary power. Furthermore, we propose canonical decompositions of both Parikh matrices

更新日期：2018-08-30
• Acta Inform. (IF 0.9) Pub Date : 2018-08-01
Andreas Krebs; Arne Meier; Martin Mundhenk

The aim of this study is to understand the inherent expressive power of CTL operators. We investigate the complexity of model checking for all CTL fragments with one CTL operator and arbitrary Boolean operators. This gives us a fingerprint of each CTL operator. The comparison between the fingerprints yields a hierarchy of the operators that mirrors their strength with respect to model checking.

更新日期：2018-08-01
• Acta Inform. (IF 0.9) Pub Date : 2018-06-15
Zoltán Fülöp; Heiko Vogler

We combine three extensions of context-free grammars: (a) associating its nonterminals with storage configurations, (b) equipping its rules with weights, and (c) controlling its derivations. For a commutative semiring K, we introduce the class of weighted languages generated by K-weighted linear context-free grammars with storage S and with derivations controlled by (S, K)-recognizable weighted languages

更新日期：2018-06-15
• Acta Inform. (IF 0.9) Pub Date : 2018-05-18
David Monniaux

Automated program verification often proceeds by exhibiting inductive invariants entailing the desired properties. For numerical properties, a classical class of invariants is convex polyhedra: solution sets of system of linear (in)equalities. Forty years of research on convex polyhedral invariants have focused, on the one hand, on identifying “easier” subclasses, on the other hand on heuristics for

更新日期：2018-05-18
• Acta Inform. (IF 0.9) Pub Date : 2018-05-15
Benjamin Lucien Kaminski; Joost-Pieter Katoen; Christoph Matheja

We study the hardness of deciding probabilistic termination as well as the hardness of approximating expected values (e.g. of program variables) and (co)variances for probabilistic programs.Termination We distinguish two notions of probabilistic termination: Given a program P and an input $$\sigma$$... 1. ...does P terminate with probability 1 on input $$\sigma$$? (almost-sure termination) 2. ..

更新日期：2018-05-15
• Acta Inform. (IF 0.9) Pub Date : 2018-05-11
Huiyan Chen; Chenchen Zhang

Tight security proofs allow for shorter security parameters and better efficiency. In this paper, we firstly present a new signature scheme, SSSTR, which is strongly existentially unforgeable under adaptively chosen message attacks and whose security is tightly related to Strong Diffie–Hellman assumption in the standard model, and then give two identity-based signatures which are existentially unforgeable

更新日期：2018-05-11
• Acta Inform. (IF 0.9) Pub Date : 2018-04-23

Extensive optimizing and parallelizing transformations are carried out on programs, both by (untrusted) compilers and human experts, before deploying them on some platform architecture which is by and large parallel. It is therefore important to devise some suitable modelling paradigm which is capable of capturing parallelism in such a way that proving equivalence of the source programs and their transformed

更新日期：2018-04-23
• Acta Inform. (IF 0.9) Pub Date : 2018-04-17
Sascha Fendrich; Gerald Lüttgen

Interface theories allow system designers to reason about the composability and compatibility of concurrent system components. Such theories often extend both de Alfaro and Henzinger’s Interface Automata and Larsen’s Modal Transition Systems, which leads, however, to several issues that are undesirable in practice: an unintuitive treatment of specified unwanted behaviour, a binary compatibility concept

更新日期：2018-04-17
Contents have been reproduced by permission of the publishers.

down
wechat
bug