OOIR: Observatory of International Research

Papers

(The TQCC of Fundamenta Informaticae is 2. 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-11-01 to 2024-11-01.)

Article	Citations
Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs	13
A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems	8
Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions	6
A Note of Generalization of Fractional ID-factor-critical Graphs	6
Parametric Analyses of Attack-fault Trees*	6
Generative Capacity of Contextual Grammars with Subregular Selection Languages*	6
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking	6
Using Hoare Logic in a Process Algebra Setting	5
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*	5
Constructing Node-Independent Spanning Trees in Augmented Cubes	5
Inferring Unobserved Events in Systems with Shared Resources and Queues	5
Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search	5
Mining Clinical Process from Hospital Information System: A Granular Computing Approach	4
Order-sorted Homeomorphic Embedding Modulo Combinations of Associativity and/or Commutativity Axioms*	4
Persistent Stochastic Non-Interference	4
Checking Sets of Pure Evolving Association Rules	4
Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees	4
Continuous Domains in Formal Concept Analysis*	4
Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors	4
Comparison of Different Data Mining Methods to Determine Disease Progression in Dissimilar Groups of Parkinson’s Patients	4
Structure and Power: an Emerging Landscape	4
Dynamic Slicing for Concurrent Constraint Languages	4
Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference	4
A Novel Ensemble Model - The Random Granular Reflections	3
Time-free Solution to Independent Set Problem using P Systems with Active Membranes	3

Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability	3
Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure	3
Adding Metalogic Features to Knowledge Representation Languages*	3
On Variable Precision Generalized Rough Sets and Incomplete Decision Tables	3
KNN Loss and Deep KNN	3
Getting There and Back Again	3
An Improved Set-based Reasoner for the Description Logic ?ℒD4,×†	3
Free-choice Nets with Home Clusters are Lucent	3
A Behavioural Theory of Recursive Algorithms	3
Encoding Threshold Boolean Networks into Reaction Systems for the Analysis of Gene Regulatory Networks	3
Piecewise Affine Dynamical Models of Petri Nets – Application to Emergency Call Centers*	3
On Local Antimagic Vertex Coloring for Complete Full t-ary Trees	2
Adaptive Merging on Phase Change Memory	2
Gathering over Meeting Nodes in Infinite Grid*	2
Computing Singular Elements Modulo Squares	2
A Set-theoretic Approach to Reasoning Services for the Description Logic ? ℒ D 4,×	2
Languages Accepted by Weighted Restarting Automata*	2
On the Hardness of Energy Minimisation for Crystal Structure Prediction*	2
Automated Comparative Study of Some Generalized Rough Approximations	2
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model	2
Cost Automata, Safe Schemes, and Downward Closures	2
On the Length of Shortest Strings Accepted by Two-way Finite Automata	2
Universal Address Sequence Generator for Memory Built-in Self-test*	2
Recognizing Visibility Graphs of Triangulated Irregular Networks	2
Cost Problems for Parametric Time Petri Nets*	2
Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction*	2
Abstract Contract Synthesis and Verification in the Symbolic ? Framework	2
lpopt: A Rule Optimization Tool for Answer Set Programming	2
The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic	2
On the 2-domination Number of Cylinders with Small Cycles	2
Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees	2
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs	2
A Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ?n	2
Probabilistic Timed Automata with Clock-Dependent Probabilities	2
Theory of Constructive Semigroups with Apartness – Foundations, Development and Practice	2