OOIR: Observatory of International Research

Papers

(The median citation count of Acta Informatica is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2020-04-01 to 2024-04-01.)

Article	Citations
Sound reasoning in tock-CSP	10
Off-the-shelf automated analysis of liveness properties for just paths	7
Equilibria for games with combined qualitative and quantitative objectives	6
Constrained polynomial zonotopes	4
An automated system repair framework with signal temporal logic	4
Proportional lumpability and proportional bisimilarity	3
Measuring the constrained reachability in quantum Markov chains	3
Operational complexity and pumping lemmas	3
DKL: an efficient algorithm for learning deterministic Kripke structures	3
Translating between models of concurrency	3
Index appearance record with preorders	3
A jumping $$5'\rightarrow 3'$$ Watson–Crick finite automata model	3
Solving high-level Petri games	3
A linear-time branching-time perspective on interface automata	2
On the undecidability and descriptional complexity of synchronized regular expressions	2
On the size of partial derivatives and the word membership problem	2
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction	2
The descriptional power of queue automata of constant length	1
Characteristic invariants in Hennessy–Milner logic	1
Session-based concurrency, declaratively	1
Natural language guided object retrieval in images	1
Depth-first search in directed planar graphs, revisited	1
On the probabilistic bisimulation spectrum with silent moves	1
On Huang and Wong’s algorithm for generalized binary split trees	1
Pushdown automata and constant height: decidability and bounds	1

Operational complexity and right linear grammars	1
Minimum status of trees with a given degree sequence	1
Correction to: Sound reasoning in tock-CSP	1
SMT-based generation of symbolic automata	1
Configurable verification of timed automata with discrete variables	1
Decentralized runtime verification of message sequences in message-based systems	1
Reversible parallel communicating finite automata systems	1
Correction to: Reactive synthesis without regret	1
Out for coffee: with Rob	1
Reactive bisimulation semantics for a process algebra with timeouts	0
Minimal consistent DFA from sample strings	0
An instruction set for reversible Turing machines	0
Regular numeral systems for data structures	0
Exploration of k-edge-deficient temporal graphs	0
An encoding of the $$\lambda $$-calculus in the String MultiSet Rewriting calculus	0
On partial information retrieval: the unconstrained 100 prisoner problem	0
Discovering workflow nets of concurrent iterative processes	0
A decision procedure for string constraints with string/integer conversion and flat regular constraints	0
Finite automata with undirected state graphs	0
Dot to dot, simple or sophisticated: a survey on shape reconstruction algorithms	0
Careful synchronization of partial deterministic finite automata	0
$$\mathcal {L}$$-reduction computation revisited	0
Neighborhood mutual remainder: self-stabilizing distributed implementation and applications	0
Interface Automata for Shared Memory	0
A complete axiomatization of weighted branching bisimulation	0
Toward a theory of program repair	0
Editorial 2023: changes and invariants	0
Reoptimization of parameterized problems	0
Preface to Martin Kutrib Festschrift	0
On the decidability of finding a positive ILP-instance in a regular set of ILP-instances	0
Preface	0
Reversibility for stateless ordered RRWW-automata	0
Exact distributed quantum algorithm for generalized Simon’s problem	0
From regular expression matching to parsing	0
Translation validation of coloured Petri net models of programs on integers	0
All congruences below stability-preserving fair testing or CFFD	0
Correction to: Solving high-level Petri games	0
Testing membership for timed automata	0
Distance-edge-monitoring sets of networks	0
The regular languages of wire linear AC$$^0$$	0
Improved complement for two-way alternating automata	0
On first-order runtime enforcement of branching-time properties	0
A new class of the smallest FSSP partial solutions for 1D rings of length $$n=2^{k}-1$$	0
Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs	0
Correction to: A linear-time branching-time perspective on interface automata	0
Preface to Klaus-Jörn Lange Festschrift	0
Synchronous and asynchronous communication(s) between three parties	0
A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds	0
Lamplighter groups and automata	0
Weighted throughput in a single machine preemptive scheduling with continuous controllable processing times	0

New families of Laplacian borderenergetic graphs	0
Balancing m-ary search trees with compressions on the fringe	0
Approximating subset sum ratio via partition computations	0
The second step in characterizing a three-word code	0
My time with Rob	0
Alternating complexity of counting first-order logic for the subword order	0
n-PS-codes, 2-infix-outfix codes and some related classes of codes	0
Properties of graphs specified by a regular language	0
Bitopological duality for algebras of Fitting’s logic and natural duality extension	0
Simple chain automaton random number generator for IoT devices	0
On the number of active states in finite automata	0
Nilpotency and periodic points in non-uniform cellular automata	0