32 citations · 41 across the 9 of their papers we have counts for
10 papers
Rigorous Function Calculi in Ariadne
Pieter Collins, Luca Geretti, Sanja Zivanovic Gonzalez +2
Almost all problems in applied mathematics, including the analysis of dynamical systems, deal with spaces of real-valued functions on Euclidean domains in their formulation and sol…
HermesBDD: A Multi-Core and Multi-Platform Binary Decision Diagram Package
Luigi Capogrosso, Luca Geretti, Marco Cristani +2
BDDs are representations of a Boolean expression in the form of a directed acyclic graph. BDDs are widely used in several fields, particularly in model checking and hardware verifi…
Decomposition of transition systems into sets of synchronizing state machines
Viktor Teren, Jordi Cortadella, Tiziano Villa
Transition systems (TS) and Petri nets (PN) are important models of computation ubiquitous in formal methods for modeling systems. An important problem is how to extract from a giv…
Equivalence Checking and Intersection of Deterministic Timed Finite State Machines
Davide Bresolin, Khaled El-Fakih, Tiziano Villa +1
There has been a growing interest in defining models of automata enriched with time, such as finite automata extended with clocks (timed automata). In this paper, we study determin…
The Quotient in Preorder Theories
Íñigo X. Íncer Romeo, Leonardo Mangeruca, Tiziano Villa +1
Seeking the largest solution to an expression of the form A x <= B is a common task in several domains of engineering and computer science. This largest solution is commonly called…
Higher Order Method for Differential Inclusions
Sanja Zivanovic Gonzalez, Pieter Collins, Luca Geretti +2
Uncertainty is unavoidable in modeling dynamical systems and it may be represented mathematically by differential inclusions. In the past, we proposed an algorithm to compute valid…
Hardware realization of residue number system algorithms by Boolean functions minimization
Danila Gorodecky, Tiziano Villa
Residue number systems (RNS) represent numbers by their remainders modulo a set of relatively prime numbers. This paper pro- poses an efficient hardware implementation of modular m…
Deterministic Timed Finite State Machines: Equivalence Checking and Expressive Power
Davide Bresolin, Khaled El-Fakih, Tiziano Villa +1
There has been a growing interest in defining models of automata enriched with time. For instance, timed automata were introduced as automata extended with clocks. In this paper, w…
Discussion on Supervisory Control by Solving Automata Equation
Victor Bushkov, Nina Yevtushenko, Tiziano Villa
In this paper we consider the supervisory control problem through language equation solving. The equation solving approach allows to deal with more general topologies and to find a…
Efficient Solution of Language Equations Using Partitioned Representations
Alan Mishchenko, Robert Brayton, Roland Jiang +2
A class of discrete event synthesis problems can be reduced to solving language equations f . X ⊆ S, where F is the fixed component and S the specification. Sequential synthes…