The main objective of the dissertation is to provide a detailed study of several different types of simulations and bisimulations for Kripke models of fuzzy multimodal logics. Two types of simulations (forward and backward) and five types of bisimulations (forward, backward, forward-backward, backward-forward and regular) are presented hereby. For each type of simulation and bisimulation, an algorithm is created to test the existence of the simulation or bisimulation and, if it exists, the algorithm computes the greatest one. The dissertation presents the application of bisimulations in the state reduction of fuzzy Kripke models, while preserving their semantic properties. Next, weak simulations and bisimulations were considered and the Hen...
The majority of works on modal fuzzy logics consider Kripkestyle possible worlds semantics as the pr...
In our paper we consider the notion of bounded bisimulation of Kripke models for intuitionistic firs...
The Paige and Tarjan algorithm (PT) for computing the coarsest refinement of a state partition which...
The main objective of the dissertation is to provide a detailed study of several different types of ...
The main objective of the dissertation is to provide a detailed study of several different types of ...
Simulations and bisimulations are known to be useful for abstracting and comparing formal systems, a...
Recently, two types of simulations (forward and backward simulations) and four types of bisimulation...
In this paper we give perspicuous proofs of the existence of model descriptions for finite Kripke m...
There has been a long history of using fuzzy-language equivalence to compare the behavior of fuzzy s...
Abstract—There has been a long history of using fuzzy lan-guage equivalence to compare the behavior ...
There has been a long history of using fuzzy-language equivalence to compare the behavior of fuzzy s...
Bisimulation is a well-known behavioral equivalence for discrete event systems and has recently been...
In this paper we provide a simplified, possibilistic semantics for the logics K45(G), i.e. a many-va...
This article concerns the maximal synthesis for Hennessy-Milner Logic on Kripke structures with labe...
Gödel modal logics combine Kripke frames of modal logics with the semantics of the well-known fuzzy...
The majority of works on modal fuzzy logics consider Kripkestyle possible worlds semantics as the pr...
In our paper we consider the notion of bounded bisimulation of Kripke models for intuitionistic firs...
The Paige and Tarjan algorithm (PT) for computing the coarsest refinement of a state partition which...
The main objective of the dissertation is to provide a detailed study of several different types of ...
The main objective of the dissertation is to provide a detailed study of several different types of ...
Simulations and bisimulations are known to be useful for abstracting and comparing formal systems, a...
Recently, two types of simulations (forward and backward simulations) and four types of bisimulation...
In this paper we give perspicuous proofs of the existence of model descriptions for finite Kripke m...
There has been a long history of using fuzzy-language equivalence to compare the behavior of fuzzy s...
Abstract—There has been a long history of using fuzzy lan-guage equivalence to compare the behavior ...
There has been a long history of using fuzzy-language equivalence to compare the behavior of fuzzy s...
Bisimulation is a well-known behavioral equivalence for discrete event systems and has recently been...
In this paper we provide a simplified, possibilistic semantics for the logics K45(G), i.e. a many-va...
This article concerns the maximal synthesis for Hennessy-Milner Logic on Kripke structures with labe...
Gödel modal logics combine Kripke frames of modal logics with the semantics of the well-known fuzzy...
The majority of works on modal fuzzy logics consider Kripkestyle possible worlds semantics as the pr...
In our paper we consider the notion of bounded bisimulation of Kripke models for intuitionistic firs...
The Paige and Tarjan algorithm (PT) for computing the coarsest refinement of a state partition which...