Fundamenta Informaticae

Article	Citations
Discovering Object-centric Petri Nets	47
Optimal Personalised Treatment Computation through In Silico Clinical Trials on Patient Digital Twins*	9
Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs	9
A Unified Method to Decentralized State Detection and Fault Diagnosis/prediction of Discrete-event Systems	6
A Note of Generalization of Fractional ID-factor-critical Graphs	6
Using Hoare Logic in a Process Algebra Setting	6
Disjunctive Total Domination Subdivision Number of Graphs	6
Parametric Analyses of Attack-fault Trees*	6
Soundness Verification of Data-Aware Process Models with Variable-to-Variable Conditions	5
A Polyhedral Abstraction for Petri Nets and its Application to SMT-Based Model Checking	5
Constructing Node-Independent Spanning Trees in Augmented Cubes	5
Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*	5
Finding Minimum Locating Arrays Using a CSP Solver	5
Unsatisfiable Core Analysis and Aggregates for Optimum Stable Model Search	5
Generative Capacity of Contextual Grammars with Subregular Selection Languages*	4
Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference	4
Continuous Domains in Formal Concept Analysis*	4
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
Comparing Degenerate Strings	4
Comparison of Different Data Mining Methods to Determine Disease Progression in Dissimilar Groups of Parkinson’s Patients	3
Optimal Wirelength of Balanced Complete Multipartite Graphs onto Cartesian Product of {Path, Cycle} and Trees	3
An Improved Set-based Reasoner for the Description Logic ?ℒD4,׆	3
Time-free Solution to Independent Set Problem using P Systems with Active Membranes	3
Free-choice Nets with Home Clusters are Lucent	3

On Combining the Methods of Link Residual and Domination in Networks	3
Solving the Team Composition Problem in a Classroom	3
Small Universal Numerical P Systems with Thresholds for Computing Functions	3
A Novel Ensemble Model - The Random Granular Reflections	3
A Behavioural Theory of Recursive Algorithms	3
Algebraic Structure of Step Traces and Interval Traces	3
Getting There and Back Again	3
Target-oriented Petri Net Synthesis	3
Multi-valued Verification of Strategic Ability	3
Adding Metalogic Features to Knowledge Representation Languages*	3
On Variable Precision Generalized Rough Sets and Incomplete Decision Tables	3
Dynamic Exploration of Multi-agent Systems with Periodic Timed Tasks	3
Probabilistic Timed Automata with Clock-Dependent Probabilities	2
Automated Comparative Study of Some Generalized Rough Approximations	2
Clustering Geometrically-Modeled Points in the Aggregated Uncertainty Model	2
Inferring Unobserved Events in Systems with Shared Resources and Queues	2
On the 2-domination Number of Cylinders with Small Cycles	2
Structure and Power: an Emerging Landscape	2
An Experimental Comparison of Algebraic Crossover Operators for Permutation Problems	2
Efficient Algorithms for Maximum Induced Matching Problem in Permutation and Trapezoid Graphs	2
Residuated Algebraic Structures in the Vicinity of Pre-rough Algebra and Decidability	2
The Structure of Multigranular Rough Sets	2
Encoding Threshold Boolean Networks into Reaction Systems for the Analysis of Gene Regulatory Networks	2
Theory of Constructive Semigroups with Apartness – Foundations, Development and Practice	2
Dynamic Slicing for Concurrent Constraint Languages	2
Checking Sets of Pure Evolving Association Rules	2
Static Scheduling with Load Balancing for Solving Triangular Band Linear Systems on Multicore Processors	2
Universal Address Sequence Generator for Memory Built-in Self-test*	2
Piecewise Affine Dynamical Models of Petri Nets – Application to Emergency Call Centers*	2
Recognizing Visibility Graphs of Triangulated Irregular Networks	2
Additional Closeness and Networks Growth	2
MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*	2
Verification and Parameter Synthesis for Real-Time Programs using Refinement of Trace Abstraction*	2
Persistent Stochastic Non-Interference	2
Abstract Contract Synthesis and Verification in the Symbolic ? Framework	2
The Complexity of Model-Checking Tail-Recursive Higher-Order Fixpoint Logic	2
On the Length of Shortest Strings Accepted by Two-way Finite Automata	2
Computing Singular Elements Modulo Squares	2
A Set-theoretic Approach to Reasoning Services for the Description Logic ? ℒ D 4,×	2
KNN Loss and Deep KNN	2
A Graph Theoretical Framework for the Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ?n	2
Reasoning on the Efficiency of Distributed Complex Event Processing	1
Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs	1
Coxeter Invariants for Non-negative Unit Forms of Dynkin Type ?r	1
Gathering over Meeting Nodes in Infinite Grid*	1
Adaptive Merging on Phase Change Memory	1
Network Controllability Analysis of Three Multiple-myeloma Patient Genetic Mutation Datasets	1
On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models	1
A Propositional Metric Logic with Fixed Finite Ranges	1
A Local Diagnosis Algorithm for Hypercube-like Networks under the BGM Diagnosis Model	1

Causal Semantics for BPP Nets with Silent Moves	1
Languages Accepted by Weighted Restarting Automata*	1
Self-Verifying Pushdown and Queue Automata	1
Computing Interval Discrete Logarithm Problem with Restricted Jump Method	1
Computing the Length of Sum of Squares and Pythagoras Element in a Global Field	1
Minimal Base for Finite Topological Space by Matrix Method	1
Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis	1
The Complexity of Synthesis of b-Bounded Petri Nets	1
Coinductive Algorithms for Büchi Automata	1
A Simple and Efficient Tensor Calculus for Machine Learning	1
A Complete Taxonomy of Restarting Automata without Auxiliary Symbols*	1
Nominal Unification and Matching of Higher Order Expressions with Recursive Let	1
A New Predictor-corrector Infeasible Interior-point Algorithm for Linear Optimization in aWide Neighborhood	1
Scattered Context Grammars with One Non-Context-Free Production are Computationally Complete	1
On the General Position Number of Complementary Prisms	1
On the Hardness of Energy Minimisation for Crystal Structure Prediction*	1
On Local Antimagic Vertex Coloring for Complete Full t-ary Trees	1
lpopt: A Rule Optimization Tool for Answer Set Programming	1
Computational and Descriptional Power of Nondeterministic Iterated Uniform Finite-State Transducers*	1
Reasoning about Exceptions in Ontologies: from the Lexicographic Closure to the Skeptical Closure	1
Towards a Logic Programming Tool for Cancer Data Analysis	1
A Dynamical System Approach to Polyominoes Generation*	1
Cost Problems for Parametric Time Petri Nets*	1
Testing Boolean Functions Properties	1
Computing the Edge Irregularity Strength of Bipartite Graphs and Wheel Related Graphs	1
Symbolic and Structural Model-Checking	1
Diameter of General Knödel Graphs	0
Circular Interval-valued Computers and Simulation of (Red-green) Turing Machines	0
Freeness Problem for Matrix Semigroups of Parikh Matrices	0
A Linear Bound on the k-rendezvous Time for Primitive Sets of NZ Matrices	0
Automated Repair of Process Models with Non-local Constraints Using State-Based Region Theory	0
Axiomatizing Rectangular Grids with no Extra Non-unary Relations	0
Maximal and Minimal Dynamic Petri Net Slicing	0
A Strong Gram Classification of Non-negative Unit Forms of Dynkin Type ?r	0
Tomography and Applications	0
Preface	0
On Insecure Uses of BGN for Privacy Preserving Data Aggregation Protocols	0
Copyful Streaming String Transducers	0
Preface	0
Perpetual Free-choice Petri Nets are Lucent Proof of a Theorem of van der Aalst Using CP-exhaustions	0
A Theory of Distributed Markov Chains	0
Quantitative Verification of Stochastic Regular Expressions	0
Preface	0
Human-aware Contingent Planning	0
A Non-Deterministic Multiset Query Language	0
Preface	0
Affine Completeness of Some Free Binary Algebras	0
Diffuse and Localized Functional Dysconnectivity in Schizophrenia: a Bootstrapped Top-Down Approach	0
Preface	0
Order-theoretic Trees: Monadic Second-order Descriptions and Regularity	0
The Inverse of Ackermann Function is Computable in Linear Time	0
Waiting Nets: State Classes and Taxonomy	0
Extensions of Elementary Cause-Effect Structures	0
A Congruence-Based Perspective on Finite Tree Automata	0
A Unifying Approach for Nonmonotonic S4F, (Reflexive) Autoepistemic Logic, and Answer Set Programming	0
Preface	0
Social Network Optimization for Cluster Ensemble Selection	0
Diamond Subgraphs in the Reduction Graph of a One-Rule String Rewriting System	0
Discovering Process Models with Long-Term Dependencies while Providing Guarantees and Filtering Infrequent Behavior Patterns	0
Structural Liveness of Immediate Observation Petri Nets	0
A New Description of Transversal Matroids Through Rough Set Approach	0
Preface	0
A Formal, Resource Consumption-Preserving Translation from Actors with Cooperative Scheduling to Haskell*	0
Cost Automata, Safe Schemes, and Downward Closures	0
Efficient Computation of the Large Inductive Dimension Using Order- and Graph-theoretic Means	0
Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons	0
Preface	0
Improved Descriptional Complexity Results for Simple Semi-Conditional Grammars	0
Synthesis of Pure and Impure Petri Nets with Restricted Place-environments: Complexity Issues	0
Preface	0
On Minimization and Learning of Deterministic ω-Automata in the Presence of Don’t Care Words	0
Coverability, Termination, and Finiteness in Recursive Petri Nets	0
On the Expressive Power of Non-deterministic and Unambiguous Petri Nets over Infinite Words	0
Reversible Regular Languages: Logical and Algebraic Characterisations	0
Decidability of Definability Issues in the Theory of Real Addition	0
On Finding Hamiltonian Cycles in Barnette Graphs	0
Topology as Faithful Communication Through Relations	0
A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models	0
Two Sufficient Conditions for Graphs to Admit Path Factors	0
Stop-transitions of Petri Nets*	0

Selective Unification in (Constraint) Logic Programming*	0
BCK-codes Based on a Parity Check Matrix	0
Computational Classification of Tubular Algebras	0
Correctness Notions for Petri Nets with Identifiers	0
On Taxicab Distance Mean Functions and their Geometric Applications: Methods, Implementations and Examples	0
L-systems from 3D-imaging of Phenotypes of Arborized Structures	0
Methods for Efficient Unfolding of Colored Petri Nets	0
Digital Jordan Curves and Surfaces with Respect to a Closure Operator	0
Compression on the Twisted Jacobi Intersection	0
On Rough Approximations of Languages under Infinite Index Indiscernibility Relations	0
A Note on Calculi for Non-deterministic Many-valued Logics	0
Structured Gaussian Process Regression of Music Mood	0
On Random Number Generation for Kernel Applications	0
Algorithms for the Generalized NTRU Equations and their Storage Analysis	0
Self-stabilisation of Cellular Automata on Tilings	0
Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem	0
Solving Infinite Games in the Baire Space	0
Edge Forcing in Butterfly Networks	0
Right Buchberger Algorithm over Bijective Skew PBW Extensions	0
Boris (Boaz) Trakhtenbrot — The Beginning	0
Companions and an Essential Motion of a Reaction System	0
Unfoldings and Coverings of Weighted Graphs	0
Decidability Questions for Insertion Systems and Related Models	0
On the Complexity of Techniques That Make Transition Systems Implementable by Boolean Nets	0
Stubborn Sets, Frozen Actions, and Fair Testing	0
Special issue of Teams in Multiagent Systems (TEAMAS): Preface	0
Towards Syntactic Epistemic Logic	0
Partial (Neighbourhood) Singleton Arc Consistency for Constraint Satisfaction Problems	0
Introduction to Probabilistic Concurrent Systems	0
Roots and Powers in Regular Languages: Recognizing Nonregular Properties by Finite Automata	0
Non-Self-Embedding Grammars and Descriptional Complexity	0
Computing Square Roots in Quaternion Algebras	0
Separating the Words of a Language by Counting Factors	0
Error Correction for Discrete Tomography	0
The Diagnosability of (K4 – {e})-free Graphs under the PMC Diagnosis Model	0
Combinatorial Algorithms for Binary Operations on LR-tableaux with Entries Equal to 1 with Applications to Nilpotent Linear Operators	0
Skeleton Abstraction for Universal Temporal Properties	0
Relations between Control Mechanisms for Sequential Grammars1	0
Computing Parameterized Invariants of Parameterized Petri Nets	0
On Morphisms Preserving Palindromic Richness	0
On Completeness of Cost Metrics and Meta-Search Algorithms in $-Calculus	0
High-degree Compression Functions on Alternative Models of Elliptic Curves and their Applications	0
Preface: Information Granulation in Data Science and Scalable Computing	0
Two-Sided Strictly Locally Testable Languages	0
Dischargeable Obligations in the ?CIFF Framework	0
Deriving Efficient Sequential and Parallel Generators for Closed Simply-Typed Lambda Terms and Normal Forms	0
Flexible Process Model Mapping using Relaxation Labeling	0
Physical Computational Complexity and First-order Logic	0
Network Capacity Bound for Personalized PageRank in Multimodal Networks	0
Link Residual Closeness of Harary Graphs	0
Parametric Schedulability Analysis of a Launcher Flight Control System under Reactivity Constraints*	0
Acyclic and Cyclic Reversing Computations in Petri Nets	0
Preface	0
Investigating Reversibility of Steps in Petri Nets	0
Number Conservation via Particle Flow in One-dimensional Cellular Automata	0
String Covering: A Survey	0
Formal Concepts and Residuation on Multilattices	0
Preface	0
Declarative Parameterized Verification of Distributed Protocols via the Cubicle Model Checker	0
On Boolean Automata Networks (de)Composition1	0
A Detailed Study of the Distributed Rough Set Based Locality Sensitive Hashing Feature Selection Technique	0
Morphisms and Minimisation of Weighted Automata	0
Preface	0
Characteristics of de Bruijn’s early proof checker Automath	0
The 1966 International Congress of Mathematicians: A Micro-memoir	0
Topological Characterisation of Multi-Buffer Simulation	0
Reachability in Simple Neural Networks	0
Place the Vertices Anywhere on the Curve and Simplify	0
Preface	0
A Generalization of Falsity in Finitely-many Valued Logics	0
Preface	0
Minimal Size of Counters for (Real-Time) Multicounter Automata	0
Local Face Antimagic Evaluations and Coloring of Plane Graphs	0
Absent Subsequences in Words	0
A Polynomial-Time Construction of a Hitting Set for Read-Once Branching Programs of Width 3	0
Preface	0
Resource Bisimilarity in Petri Nets is Decidable	0
On the Tutte and Matching Polynomials for Complete Graphs	0
Some Basic Techniques Allowing Petri Net Synthesis: Complexity and Algorithmic Issues	0
Pattern and Rule Mining for Identifying Signatures of Epileptic Patients from Clinical EEG Data	0
On Shuffling a Word with its Letter-to-Letter Substitution	0
Daniel Simson Obituary	0
Preface	0
Preface	0
Polynomial-time Classification of Skew-symmetrizable Matrices with a Positive Definite Quasi-Cartan Companion	0
Reconstruction of Convex Sets from One or Two X-rays	0
Preface	0
Preface	0
Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees	0
Perfect Domination, Roman Domination and Perfect Roman Domination in Lexicographic Product Graphs	0
Spanning Structures in Walker–Breaker Games	0