Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Deterministic timed finite state machines: Equivalence checking and expressive power
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 …
instance, timed automata were introduced as automata extended with clocks. In this paper …
Quotient for assume-guarantee contracts
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 …
quotient for assume-guarantee contracts. The quotient set and its related operation can be …
Equivalence checking and intersection of deterministic timed finite state machines
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 …
as finite automata extended with clocks (timed automata). In this paper, we study …
Power loss reduction by optimal location of DG using fuzzy logic
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 …
electricity demand and shortage in transmission and distribution network, making new …
Component-based design by solving language equations
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 …
interacting components, of which some are given (known) and some need to be synthesized …
The quotient in preorder theories
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 …
several domains of engineering and computer science. This largest solution is commonly …
Adaptive Homing is in P
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 …
when a non-initialized discrete event system is given for testing and thus, has to be set to the …
Learning communicating state machines
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) …
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 …
languages/automata and finite state machines (FSMs), using the software package BALM-II …
О возможностях автоматного описания параллельной композиции временных автоматов
АС Твардовский, АВ Лапутенко - Труды Института системного …, 2018 - cyberleninka.ru
Конечные автоматы широко используются для анализа и синтеза дискретных систем.
При описании систем, поведение которых зависит от времени, конечный автомат …
При описании систем, поведение которых зависит от времени, конечный автомат …