Deterministic timed finite state machines: Equivalence checking and expressive power

D Bresolin, K El-Fakih, T Villa… - arxiv preprint arxiv …, 2014 - arxiv.org
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 …

Quotient for assume-guarantee contracts

ÍÍ Romeo, A Sangiovanni-Vincentelli… - 2018 16th ACM/IEEE …, 2018 - ieeexplore.ieee.org
We introduce a novel notion of quotient set for a pair of contracts and the operation of
quotient for assume-guarantee contracts. The quotient set and its related operation can be …

Equivalence checking and intersection of deterministic timed finite state machines

D Bresolin, K El-Fakih, T Villa… - Formal Methods in System …, 2021 - Springer
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 …

Power loss reduction by optimal location of DG using fuzzy logic

RB Magadum, DB Kulkarni - 2015 International Conference on …, 2015 - ieeexplore.ieee.org
Due to increase in the population and change in the life style there is huge increase in
electricity demand and shortage in transmission and distribution network, making new …

Component-based design by solving language equations

T Villa, A Petrenko, N Yevtushenko… - Proceedings of the …, 2015 - ieeexplore.ieee.org
An important step in the design of a complex system is its decomposition into a number of
interacting components, of which some are given (known) and some need to be synthesized …

The quotient in preorder theories

ÍXÍ Romeo, L Mangeruca, T Villa… - arxiv preprint arxiv …, 2020 - arxiv.org
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 …

Adaptive Homing is in P

N Kushik, N Yevtushenko - arxiv preprint arxiv:1504.02444, 2015 - arxiv.org
Homing preset and adaptive experiments with Finite State Machines (FSMs) are widely used
when a non-initialized discrete event system is given for testing and thus, has to be set to the …

Learning communicating state machines

A Petrenko, F Avellaneda - … 13th International Conference, TAP 2019, Held …, 2019 - Springer
We consider the problems of learning and conformance testing of components in a modular
system. We assume that each component can be modelled as a Finite State Machine (FSM) …

Solving Parallel Equations with balm-ii

G Castagnetti, M Piccolo, T Villa, N Yevtushenko… - 2012 - iris.univr.it
In this report we describe how to solve parallel language equations over regular
languages/automata and finite state machines (FSMs), using the software package BALM-II …

О возможностях автоматного описания параллельной композиции временных автоматов

АС Твардовский, АВ Лапутенко - Труды Института системного …, 2018 - cyberleninka.ru
Конечные автоматы широко используются для анализа и синтеза дискретных систем.
При описании систем, поведение которых зависит от времени, конечный автомат …