Acta Informatica

Papers
(The TQCC of Acta Informatica is 1. 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.)
ArticleCitations
Sound reasoning in tock-CSP10
Off-the-shelf automated analysis of liveness properties for just paths7
Equilibria for games with combined qualitative and quantitative objectives6
An automated system repair framework with signal temporal logic4
Constrained polynomial zonotopes4
Operational complexity and pumping lemmas3
DKL: an efficient algorithm for learning deterministic Kripke structures3
Translating between models of concurrency3
Index appearance record with preorders3
A jumping $$5'\rightarrow 3'$$ Watson–Crick finite automata model3
Solving high-level Petri games3
Proportional lumpability and proportional bisimilarity3
Measuring the constrained reachability in quantum Markov chains3
On the size of partial derivatives and the word membership problem2
Hierarchical heuristics for Boolean-reasoning-based binary bicluster induction2
A linear-time branching-time perspective on interface automata2
On the undecidability and descriptional complexity of synchronized regular expressions2
On Huang and Wong’s algorithm for generalized binary split trees1
Pushdown automata and constant height: decidability and bounds1
Operational complexity and right linear grammars1
Minimum status of trees with a given degree sequence1
Correction to: Sound reasoning in tock-CSP1
SMT-based generation of symbolic automata1
Configurable verification of timed automata with discrete variables1
Decentralized runtime verification of message sequences in message-based systems1
Reversible parallel communicating finite automata systems1
Correction to: Reactive synthesis without regret1
Out for coffee: with Rob1
The descriptional power of queue automata of constant length1
Characteristic invariants in Hennessy–Milner logic1
Session-based concurrency, declaratively1
Natural language guided object retrieval in images1
Depth-first search in directed planar graphs, revisited1
On the probabilistic bisimulation spectrum with silent moves1
0.01970100402832