Jelena Ignjatović
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Jelena Ignjatović has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Miroslav Ćirić
Faculty of Sciences and Mathematics, University of Niš, Višegradska 33, 18108 Niš, Serbia
24 shared publications - Predrag S. Stanimirovic
Faculty of Sciences and Mathematics, University of Niš, Niš, Serbia
5 shared publications - Zorana Jančić
Univ Nis, Fac Sci & Math, Visegradska 33, Nish 18000, Serbia
5 shared publications - Ivan Stankovic
Faculty of Sciences and Mathematics, Nis
3 shared publications - Ivana Micić
University of Niš, Faculty of Sciences and Mathematics, Niš, Serbia
3 shared publications - Nada Damljanović
Faculty of Technical Sciences, Čačak
3 shared publications
Latest Publications
- 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
- 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
- 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. - Open Access
- 7 October 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (19) , 3136
Idempotent-Aided Factorizations of Regular Elements of a Semigroup
In the present paper, we introduce the concept of idempotent-aided factorization (I.-A. factorization) of a regular element of a semigroup, which can be understood as a semigroup-theoretical extension of full-rank factorization of matrices over a field. I.-A. factorization of a regular element d is defined by means of an idempotent e from its Green’s -class as decomposition into the product , so that the element u belongs to the Green’s -class of the element d and the Green’s -class of the idempotent e, while the element v belongs to the Green’s -class of the element d and the Green’s -class of the idempotent e. The main result of the paper is a theorem which states that each regular element of a semigroup possesses an I.-A. factorization with respect to each idempotent from its Green’s -class. In addition, we prove that when one of the factors is given, then the other factor is uniquely determined. I.-A. factorizations are then used to provide new existence conditions and characterizations of group inverses and -inverses in a semigroup. In our further research, these factorizations will be applied to matrices with entries in a field, and efficient algorithms for realization of such factorizations will be provided.- 7 October 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (19) , 3136
Open AccessIdempotent-Aided Factorizations of Regular Elements of a Semigroup
In the present paper, we introduce the concept of idempotent-aided factorization (I.-A. factorization) of a regular element of a semigroup, which can be understood as a semigroup-theoretical extension of full-rank factorization of matrices over a field. I.-A. factorization of a regular element d is defined by means of an idempotent e from its Green’s -class as decomposition into the product , so that the element u belongs to the Green’s -class of the element d and the Green’s -class of the idempotent e, while the element v belongs to the Green’s -class of the element d and the Green’s -class of the idempotent e. The main result of the paper is a theorem which states that each regular element of a semigroup possesses an I.-A. factorization with respect to each idempotent from its Green’s -class. In addition, we prove that when one of the factors is given, then the other factor is uniquely determined. I.-A. factorizations are then used to provide new existence conditions and characterizations of group inverses and -inverses in a semigroup. In our further research, these factorizations will be applied to matrices with entries in a field, and efficient algorithms for realization of such factorizations will be provided. - 20 September 2023
- Published by Springer Nature in Semigroup Forum
- Vol. 107 (2) , 251-293
Outer inverses in semigroups belonging to the prescribed Green’s equivalence classes
- 20 September 2023
- Published by Springer Nature in Semigroup Forum
- Vol. 107 (2) , 251-293
Outer inverses in semigroups belonging to the prescribed Green’s equivalence classes
- Open Access
- 3 September 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 386, 67-81
Weighted Automata over Vector Spaces
In this paper we deal with three models of weighted automata that take weights in the field of real numbers. The first of these models are classical weighted finite automata, the second one are crispdeterministic weighted automata, and the third one are weighted automata over a vector space. We explore the interrelationships between weighted automata over a vector space and other two models.
- 3 September 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 386, 67-81
Open AccessWeighted Automata over Vector Spaces
In this paper we deal with three models of weighted automata that take weights in the field of real numbers. The first of these models are classical weighted finite automata, the second one are crispdeterministic weighted automata, and the third one are weighted automata over a vector space. We explore the interrelationships between weighted automata over a vector space and other two models.
- Open Access
- 27 August 2023
- Published by Springer Nature in Research Square
Outer inverses in semigroups belonging to the prescribed Green’s equivalence classes
We provide existence criteria and characterizations for outer inverses in a semigroup belonging to the prescribed Green’s ℛ-, ℒ- and ℋ-classes. These results generalize the well-known problem of finding outer inverses of a matrix over a field with the prescribed range or/and null space. Outer inverses belonging to the prescribed Green’s ℛ- and ℒ-classes also represent extensions of Drazin’s (b, c)-inverses and Mary’s inverses along an element. We provide an overview of other such extensions that have emerged recently and compare them with the extensions introduced in this paper. Mathematics Subject Classification (2010). 20M99, 15A09, 15A24.
- 27 August 2023
- Published by Springer Nature in Research Square
Open AccessOuter inverses in semigroups belonging to the prescribed Green’s equivalence classes
We provide existence criteria and characterizations for outer inverses in a semigroup belonging to the prescribed Green’s ℛ-, ℒ- and ℋ-classes. These results generalize the well-known problem of finding outer inverses of a matrix over a field with the prescribed range or/and null space. Outer inverses belonging to the prescribed Green’s ℛ- and ℒ-classes also represent extensions of Drazin’s (b, c)-inverses and Mary’s inverses along an element. We provide an overview of other such extensions that have emerged recently and compare them with the extensions introduced in this paper. Mathematics Subject Classification (2010). 20M99, 15A09, 15A24.
- Open Access
- 1 January 2023
- Published by National Library of Serbia in Filomat
- Vol. 37 (11) , 3335-3355
Bisimulations for weighted networks with weights in a quantale
In this paper we introduce two types of simulations (forward and backward) and five types of bisimulations (forward, backward, forward-backward, backward-forward, and regular) for weighted networks with weights taken in a quntale, we describe their basic properties and provide procedures for testing the existence of a simulation or bisimulation of a given type and computing the greatest one, in cases when such simulations or bisimulations exist.We also describe basic properties of homogeneous simulations and bisimulations, which relate actors within the same weighted network, and establish relationships between heterogeneous bisimulations between two different networks and homogeneous bisimulations on these networks. In addition, we characterize the greatest forward, backward and regular bisimulations between weighted networks by means of multi-valued multimodal logics.
- 1 January 2023
- Published by National Library of Serbia in Filomat
- Vol. 37 (11) , 3335-3355
Open AccessBisimulations for weighted networks with weights in a quantale
In this paper we introduce two types of simulations (forward and backward) and five types of bisimulations (forward, backward, forward-backward, backward-forward, and regular) for weighted networks with weights taken in a quntale, we describe their basic properties and provide procedures for testing the existence of a simulation or bisimulation of a given type and computing the greatest one, in cases when such simulations or bisimulations exist.We also describe basic properties of homogeneous simulations and bisimulations, which relate actors within the same weighted network, and establish relationships between heterogeneous bisimulations between two different networks and homogeneous bisimulations on these networks. In addition, we characterize the greatest forward, backward and regular bisimulations between weighted networks by means of multi-valued multimodal logics.