Given a plant Å and a specification Å , the largest solution of the FSM equation Å ¯ Å Å contains all possible discrete controllers Å . Often we are interested in computin...
Nina Yevtushenko, Tiziano Villa, Robert K. Brayton...
Let the k-graph Fank consist of k edges that pairwise intersect exactly in one vertex x, plus one more edge intersecting each of these edges in a vertex different from x. We prov...
In this article, we review the major paradigms for approximate similarity queries and propose a classification schema that easily allows existing approaches to be compared along ...
Service Oriented Architecture (SOA) promotes the utilization of available services to develop completely new applications in a context which has not been foreseen as these services...
Markovian behavioral equivalences are a means to relate and manipulate the formal descriptions of systems with an underlying CTMC semantics. There are three fundamental approaches ...