Berriri, Asma Kushik, Natalia Zeghlache, Djamal

Implementations of an OpenFlow (OF) switch, a crucial Software Defined Networking (SDN) component, are prone to errors caused by developer mistakes or/and ambiguous requirements stated in the OF documents. The paper is devoted to test derivation for related OF switch implementations. A model based test generation strategy is proposed. It relies on ...

Berriri, Asma Kushik, Natalia Djamal, Zeghlache

Implementations of an OpenFlow (OF) switch, a crucial Software Defined Networking (SDN) component, are prone to errors caused by developer mistakes or/and ambiguous requirements stated in the OF documents. The paper is devoted to test derivation for related OF switch implementations. A model based test generation strategy is proposed. It relies on ...

Figueira, Diego Ramanathan, Varun Weil, Pascal

The class of synchronous relations, also known as automatic or regular, is one of the most studied subclasses of rational relations. It enjoys many desirable closure properties and is known to be logically characterized: the synchronous relations are exactly those that are defined by a first-order formula on the structure of all finite words, with ...

Figueira, Diego Ramanathan, Varun Weil, Pascal

The class of synchronous relations, also known as automatic or regular, is one of the most studied subclasses of rational relations. It enjoys many desirable closure properties and is known to be logically characterized: the synchronous relations are exactly those that are defined by a first-order formula on the structure of all finite words, with ...

Figueira, Diego

We study the class of languages recognized by multi-counter finite state automata. These are finite automata reading letters from a finite alphabet A, equipped with n counters of natural numbers, which can be incremented or decremented by transitions. The acceptance condition requires the last state to be from the final set of states. This is equiv...

Dennunzio, Alberto Formenti, Enrico Grinberg, Darij Margara, Luciano

Let $\mathbb{K}$ be a finite commutative ring, and let $\mathbb{L}$ be a commutative $\mathbb{K}$-algebra. Let $A$ and $B$ be two $n \times n$-matrices over $\mathbb{L}$ that have the same characteristic polynomial. The main result of this paper states that the set $\left\{ A^0,A^1,A^2,\ldots\right\}$ is finite if and only if the set $\left\{ B^0,B...

Harmer, Russ Oshurko, Eugenia

International audience

Harmer, Russ Oshurko, Eugenia

International audience

Harmer, Russ Oshurko, Eugenia

International audience

Foughali, Mohammed Ingrand, Félix Seceleanu, Cristina

Failure of robotic software may cause catastrophic damages. In order to establish a higher level of trust in robotic systems, formal methods are often proposed. However, their applicability to the functional layer of robots remains limited because of the informal nature of specifications, their complexity and size. In this paper, we formalize the r...