The notions of bisimulation and simulation are used for graph reduction and are widely employed in many areas: modal logic, concurrency theory, set theory, formal verification, and so forth. Inâ€¦ (More)

We consider two-player games with imperfect information an d quantitative objective. The game is played on a weighted graph wi t a state space partitioned into classes of indistinguishable states,â€¦ (More)

In this paper, we study several decision problems for functi o al weighted automata. To associate values with runs, we consider four different measure functions: th e sum, the mean, the discountedâ€¦ (More)

The problem of determining the coarsest partition stable with respect to a given binary relation, is known to be equivalent to the problem of finding the maximal bisimulation on a given structure.â€¦ (More)

Genome informatics. International Conference onâ€¦

2005

We consider the problem of integrating different systems biology formalisms, namely, the process calculi based formalism, the modeling approach based on systems of differential equations, and the oneâ€¦ (More)

The importance of symbolic data structures such as Ordered Binary Decision Diagrams (OBDD) is rapidly growing in many areas of Computer Science where the large dimensions of the input models is aâ€¦ (More)

Within hybrid systems theory, o-minimal automata are often considered on the border between decidability and undecidability. In such classes of hybrid automata, the constraint of having only constantâ€¦ (More)