This paper concerns a stochastic construction of probabilistic coherent spaces by employing novel ingredients (i) linear exponential comonad arising properly in the measure-theory (ii) continuous orthogonality between measures and measurable ...

The Disjunctive Temporal Problem (DTP) consists of a finite set of time points and a finite set of constraints, each composed of alternative disjuncts modeling delays and deadlines for possibly different pairs of time points. An instance of DTP ...

• We provide polynomial-time encoders to reduce the number of disjuncts per constraint in the Disjunctive Temporal Problem.
• We prove equi-consistency for the resulting instances.
• We prove equivalence in the special case of the ...

We study the problem of formalizing and checking probabilistic hyperproperties for Markov decision processes (MDPs). We introduce the temporal logic HyperPCTL that allows explicit and simultaneous quantification over schedulers as well ...

We introduce a subclass of linear recurrence sequences which we call poly-rational sequences because they are denoted by rational expressions closed under sum and product. We show that this class is robust by giving several ...

Goltz and Reisig generalised Petri's concept of processes of one-safe Petri nets to general nets where places carry multiple tokens. BD-processes are equivalence classes of Goltz-Reisig processes connected through the swapping ...

In 2007, Abdulla et al. introduced the concept of decisiveness, an interesting tool for lifting good properties of finite Markov chains to denumerable ones. Later, this concept was extended to more general stochastic transition systems ...

Automatic sequences can be defined by DFAs with output (DFAO) in two natural ways. We propose to consider the minimal size of a corresponding DFAO as the complexity measure of the automatic sequence, for both variants. This paper ...

We present a logical characterisation of the equivalences in the spectrum for labelled Prime Event Structures (PESs) and use it for also studying how such spectrum changes when restricting to subclasses of event structures. We first ...

A transducer is infinite-valued if the maximal number of different outputs for an input string is not bounded by any constant. For one-way finite transducers, sufficient and necessary conditions exist in terms of the structure of a ...

A DNA string is a Watson-Crick (WK-)palindrome when the complement of its reverse is equal to itself. The Watson-Crick mapping θ is an involution that is also an antimorphism. In this paper, we study a generalization of conjugates of a ...

We consider Pareto analysis of multi-priced timed automata (MPTA) having multiple observers recording costs (to be minimised) and rewards (to be maximised) along a computation.

We study the Pareto Domination Problem, which ...

We study edit distances between strings, based on weighted operations such as character substitutions, insertions, deletions, and consolidations and fragmentations. The two latter operations transform a sequence of characters into one ...

Weighted automata map input words to values, and have numerous applications in computer science. A result by Krob from the 90s implies that the universality problem is decidable for weighted automata over the tropical ...

We develop a new bisimulation (pseudo)metric for weighted finite automata (WFA) that generalizes Boreale's linear bisimulation relation. Our metrics are induced by seminorms on the state space of WFA. Our development is based on ...

Probabilistic automata are an extension of nondeterministic finite automata in which transitions are annotated with probabilities. Despite its simplicity, this model is very expressive and many algorithmic questions are undecidable. In ...

Spiking neural P systems with inhibitory rules (in short, IR-SN P systems) are a kind of bio-inspired computing systems, which are abstracted by the inhibitory synaptic mechanism of biological neurons. IR-SN P systems work in ...

• We propose an IR-SSN P system, inspired from the inhibitory synaptic mechanism of biological neurons.

We investigate systems of equations and the first-order theory of one-relator monoids. We describe a family F of one-relator monoids of the form 〈 A | w = 1 〉 where for each monoid M in F, the longstanding open problem of decidability ...

Schedulability is a fundamental problem in analyzing real-time systems, but it often has to be approximated because of the intrinsic computational hardness. Partitioned earliest deadline first (EDF) is one of the most popular ...

In the cake cutting problem, a cake needs to be divided among players with possibly different valuations for different pieces of the cake. We consider a variation where the cake represents chores that need to be allocated. We assume ...

Model checking (MC) for Halpern and Shoham's interval temporal logic HS has been recently shown to be decidable. An intriguing open question is its exact complexity for full HS: it is at least EXPSPACE-hard, and the only known upper ...