Bisimulations have been widely used in many areas of computer science to model
equivalence between various systems, and to reduce the number of states of these systems …

Weakly linear systems of fuzzy relation inequalities and equations have recently emerged
from research in the theory of fuzzy automata. From the general aspect of the theory of fuzzy …

Recently, two types of simulations (forward and backward simulations) and four types of
bisimulations (forward, backward, forward–backward, and backward–forward bisimulations) …

We consider weighted finite automata over strong bimonoids, where these weight structures
can be considered as semirings which might lack distributivity. Then, in general, the well …

Weighted automata model quantitative aspects of systems like memory or power
consumption. Recently, Chatterjee, Doyen, and Henzinger introduced a new kind of …

We show that L-weighted automata, L-rational series, and L-valued monadic second order
logic have the same expressive power, for any bounded lattice L and for finite and infinite …

In this paper we study subsystems, reverse subsystems and double subsystems of a fuzzy
transition system. We characterize them in terms of fuzzy relation inequalities and equations …

To handle fuzzy uncertainty in system modeling, nondeterministic finite automata have been
generalized into fuzzy automata. After a reexamination of the notions of fuzzy automata in …

Multi-valued model-checking is an extension of classical model-checking used to verify the
properties of systems with uncertain information content. It is used in systems where the …

Finding paths with optimal properties is a foundational problem in computer science. The
notions of shortest paths (minimal sum of edge costs), minimax paths (minimal maximum …