If a program does not fulfill a given specification, a model checker delivers a counterexample, a run which demonstrates the wrong behavior. Even with a counterexample, locating...
This paper focuses on tractable instances of interval data minmax regret graph problems. More precisely, we provide polynomial and pseudopolynomial algorithms for sets of particul...
We define a relative version of the logic NIL introduced by Orłowska, Pawlak and Vakarelov and we show that satisfiability is not only decidable but also EXPTIME-complete. Such ...
Abstract. We investigate the theories LA, LAP, LAP of linear algebra, which were originally defined to study the question of whether commutativity of matrix inverses has polysize F...
We provide a generalized version of the nonlinear small gain theorem for the case of more than two coupled input-to-state stable (ISS) systems. For this result the interconnection...