Miroslav Ćirić
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Miroslav Ćirić has a total of 69 co-authors. Here are the top co-authors by number of shared publications:
- Jelena Ignjatović
Department of Computer Science, Faculty of Sciences and Mathematics, University of Niš, Niš, Serbia
24 shared publications Jelena Ignjatović
University of Nis
22 shared publicationsStojan Bogdanović
17 shared publications- Predrag S. Stanimirovic
Faculty of Sciences and Mathematics, University of Niš, Niš, Serbia
15 shared publications - Zorana Jančić
Univ Nis, Fac Sci & Math, Visegradska 33, Nish 18000, Serbia
15 shared publications - Stefan Stanimirović
Univ Nis, Fac Sci & Math, Visegradska 33, Nish 18000, Serbia
12 shared publications
Latest Publications
- Open Access
Approximating Heterotypic Bisimulations for Weighted Finite Automata over the Field of Real Numbers
This paper examines the existence and approximation of bisimulations between weighted finite automata (WFAs) over the real numbers. It shows that forward–backward bisimulation (fbb) and backward–forward bisimulation (bfb) between two WFAs are equivalent to solving specific homogeneous Sylvester equations and two vector equations. The transition matrices of the automata serve as the coefficient matrices in these equations. This approach reformulates the WFA’s problem as a linear algebra task involving real coefficient matrices. Obtained systems of vector and matrix equations frequently lack consistency. Multi-criteria optimization can address these inconsistencies. We apply continuous-time zeroing neural network (ZNN) dynamics to find approximate solutions for these inconsistent vector-matrix systems. Since ZNN dynamics are globally convergent, they generate approximate solutions that evolve over time. Simulation experiments are conducted on random transition matrices, using various initial state matrices and two activation functions.
Open AccessApproximating Heterotypic Bisimulations for Weighted Finite Automata over the Field of Real Numbers
This paper examines the existence and approximation of bisimulations between weighted finite automata (WFAs) over the real numbers. It shows that forward–backward bisimulation (fbb) and backward–forward bisimulation (bfb) between two WFAs are equivalent to solving specific homogeneous Sylvester equations and two vector equations. The transition matrices of the automata serve as the coefficient matrices in these equations. This approach reformulates the WFA’s problem as a linear algebra task involving real coefficient matrices. Obtained systems of vector and matrix equations frequently lack consistency. Multi-criteria optimization can address these inconsistencies. We apply continuous-time zeroing neural network (ZNN) dynamics to find approximate solutions for these inconsistent vector-matrix systems. Since ZNN dynamics are globally convergent, they generate approximate solutions that evolve over time. Simulation experiments are conducted on random transition matrices, using various initial state matrices and two activation functions.
- 25 April 2026
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 539
Simulations for fuzzy automata over the product structure: From approximation to exact solution
- 25 April 2026
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 539
Simulations for fuzzy automata over the product structure: From approximation to exact solution
- Open Access
Truncating and Shifting Weights for Max-Plus Automata
In this paper, for any real number λ, we transform the complete max-plus semiring into a commutative, complete, additively idempotent semiring , called the lower λ-truncation of . It is obtained by removing from all real numbers smaller than λ, inheriting the addition operation, shifting the original products by −λ, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over , to , where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over can be transformed into presimulations and prebisimulations between the original automata over . Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring .Open AccessTruncating and Shifting Weights for Max-Plus Automata
In this paper, for any real number λ, we transform the complete max-plus semiring into a commutative, complete, additively idempotent semiring , called the lower λ-truncation of . It is obtained by removing from all real numbers smaller than λ, inheriting the addition operation, shifting the original products by −λ, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over , to , where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over can be transformed into presimulations and prebisimulations between the original automata over . Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring . - Open Access
- 1 January 2026
- Published by National Library of Serbia in Filomat
- Vol. 40 (1) , 309-320
Approximate children fuzzy automata over the product structure
The general problem of determinization of fuzzy automata over the product structure is un-solvable, which necessitates the use of approximate methods. This paper introduces a new approach to the approximate determinization of fuzzy finite automata by utilizing a transition to a different structure, known as the truncated product structure. This structure is residuated and has a locally finite semiring reduct, which enables efficient computation. The proposed method constructs a so-called Children automa-ton and employs approximate weak simulations to achieve more effective determinization. In comparison to existing techniques, this approach significantly enhances the performance and precision of the resulting crisp-deterministic fuzzy automata.
- 1 January 2026
- Published by National Library of Serbia in Filomat
- Vol. 40 (1) , 309-320
Open AccessApproximate children fuzzy automata over the product structure
The general problem of determinization of fuzzy automata over the product structure is un-solvable, which necessitates the use of approximate methods. This paper introduces a new approach to the approximate determinization of fuzzy finite automata by utilizing a transition to a different structure, known as the truncated product structure. This structure is residuated and has a locally finite semiring reduct, which enables efficient computation. The proposed method constructs a so-called Children automa-ton and employs approximate weak simulations to achieve more effective determinization. In comparison to existing techniques, this approach significantly enhances the performance and precision of the resulting crisp-deterministic fuzzy automata.
- Open Access
- 22 December 2025
- Published by MDPI AG in Preprints.org
Truncating and Shifting Weights for Max-Plus Automata
In this paper, for any real number $\lambdaup$, we transform the complete max-plus semiring $\mathbb{R}_\infty$ into a commutative, complete, additively idempotent semiring $\mathbb{R}_\infty^\lambdaup$, called the lower $\lambdaup$-truncation~of~$\mathbb{R}_\infty$. It is obtained by removing from $\mathbb{R}_\infty$ all real numbers smaller than $\lambdaup$, inheriting the addition operation, shifting the original products by $-\lambdaup$, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over $\mathbb{R}_\infty$, to $\mathbb{R}_\infty^\lambdaup$, where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over $\mathbb{R}_\infty^\lambdaup$ can be transformed into presimulations and prebisimulations between the original automata over $\mathbb{R}_\infty$. Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring $\mathbb{R}_\infty$.- 22 December 2025
- Published by MDPI AG in Preprints.org
Open AccessTruncating and Shifting Weights for Max-Plus Automata
In this paper, for any real number $\lambdaup$, we transform the complete max-plus semiring $\mathbb{R}_\infty$ into a commutative, complete, additively idempotent semiring $\mathbb{R}_\infty^\lambdaup$, called the lower $\lambdaup$-truncation~of~$\mathbb{R}_\infty$. It is obtained by removing from $\mathbb{R}_\infty$ all real numbers smaller than $\lambdaup$, inheriting the addition operation, shifting the original products by $-\lambdaup$, and appropriately modifying the residuum operation. The purpose of lower truncations is to transfer the iterative procedures for computing the greatest presimulations and prebisimulations between max-plus automata, in cases where they cannot be completed in a finite number of iterations over $\mathbb{R}_\infty$, to $\mathbb{R}_\infty^\lambdaup$, where they could terminate in a finite number of iterations. For instance, we prove that this necessarily happens when working with max-plus automata with integer weights. We also show how presimulations and prebisimulations computed over $\mathbb{R}_\infty^\lambdaup$ can be transformed into presimulations and prebisimulations between the original automata over $\mathbb{R}_\infty$. Although they do not play a significant role from the standpoint of computing presimulations and prebisimulations, for theoretical reasons we also introduce two types of upper truncations of the complete max-plus semiring $\mathbb{R}_\infty$. - 15 December 2025
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 23 (1) , 33
Matrix Factorizations with Prescribed Ranges and Null Spaces
- 15 December 2025
- Published by Springer Nature in Mediterranean Journal of Mathematics
- Vol. 23 (1) , 33
Matrix Factorizations with Prescribed Ranges and Null Spaces
- 15 October 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 523
Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
- 15 October 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 523
Approximate determinization of fuzzy automata over the product structure by means of approximate weak simulations
- 15 July 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 519
Approximate state reduction of fuzzy finite automata
- 15 July 2025
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 519
Approximate state reduction of fuzzy finite automata
- 18 June 2025
- Published by Springer Nature in Semigroup Forum
- Vol. 111 (1) , 57-77
Outer inverses belonging to the prescribed Green’s equivalence classes in an involutive semigroup
- 18 June 2025
- Published by Springer Nature in Semigroup Forum
- Vol. 111 (1) , 57-77
Outer inverses belonging to the prescribed Green’s equivalence classes in an involutive semigroup
- Open Access
Hennessy-Milner Type Theorems for Fuzzy Multimodal Logics Over Heyting Algebras
In a recent paper, we have introduced two types of fuzzy simulations (forward and backward) and five types of fuzzy bisimulations (forward, backward, forward-backward, backward-forward and regular) between Kripke models for the fuzzy multimodal logics over a complete linearly ordered Heyting algebra. In this paper, for a given non-empty set $Ψ$ of modal formulae, we introduce the concept of a weak bisimulation between Kripke models. This concept can be used to express the degree of equality of fuzzy sets of formulae from $Ψ$ that are valid in two worlds $w$ and $w'$, that is, to express the degree of modal equivalence between worlds $w$ and $w'$ with respect to the formulae from $Ψ$. We prove several Hennessy-Milner type theorems. The first theorem determines that the greatest weak bisimulation for the set of plus-formulae between image-finite Kripke models coincides with the greatest forward bisimulation. The second theorem determines that the greatest weak bisimulation for the set of minus-formulae between domain-finite Kripke models coincides with the greatest backward bisimulation. Finally, the third theorem determines that the greatest weak bisimulation for the set of all modal formulae between the degree-finite Kripke models coincides with the greatest regular bisimulation.Open AccessHennessy-Milner Type Theorems for Fuzzy Multimodal Logics Over Heyting Algebras
In a recent paper, we have introduced two types of fuzzy simulations (forward and backward) and five types of fuzzy bisimulations (forward, backward, forward-backward, backward-forward and regular) between Kripke models for the fuzzy multimodal logics over a complete linearly ordered Heyting algebra. In this paper, for a given non-empty set $Ψ$ of modal formulae, we introduce the concept of a weak bisimulation between Kripke models. This concept can be used to express the degree of equality of fuzzy sets of formulae from $Ψ$ that are valid in two worlds $w$ and $w'$, that is, to express the degree of modal equivalence between worlds $w$ and $w'$ with respect to the formulae from $Ψ$. We prove several Hennessy-Milner type theorems. The first theorem determines that the greatest weak bisimulation for the set of plus-formulae between image-finite Kripke models coincides with the greatest forward bisimulation. The second theorem determines that the greatest weak bisimulation for the set of minus-formulae between domain-finite Kripke models coincides with the greatest backward bisimulation. Finally, the third theorem determines that the greatest weak bisimulation for the set of all modal formulae between the degree-finite Kripke models coincides with the greatest regular bisimulation.