Synchronous composition of interval weighted automata

2010 ◽  
Vol 43 (12) ◽  
pp. 318-323 ◽  
Author(s):  
Jan Komenda ◽  
Sébastien Lahaye ◽  
Jean-Louis Boimond
Keyword(s):  
Weighted Automata ◽  
Synchronous Composition

scholarly journals Modeling of safe time Petri nets by interval weighted automata

2020 ◽  
Vol 53 (4) ◽  
pp. 187-192
Author(s):  
Jan Komenda ◽  
Aiwen Lai ◽  
José Godoy Soto ◽  
Sébastien Lahaye ◽  
Jean-louis Boimond
Keyword(s):  
Petri Nets ◽  
Time Petri Nets ◽  
Weighted Automata

scholarly journals Nested Weighted Automata

2017 ◽  
Vol 18 (4) ◽  
pp. 1-44 ◽  
Author(s):  
Krishnendu Chatterjee ◽  
Thomas A. Henzinger ◽  
Jan Otop
Keyword(s):  
Weighted Automata

scholarly journals PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA

2007 ◽  
Vol 18 (04) ◽  
pp. 799-811
Author(s):  
MATHIEU GIRAUD ◽  
PHILLIPE VEBER ◽  
DOMINIQUE LAVENIER
Keyword(s):  
Surface Area ◽  
Finite Automata ◽  
Clock Frequency ◽  
Partial Removal ◽  
Frequency Constraints ◽  
Weighted Automata ◽  
Weighted Finite Automata ◽  
Special Case

Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient ∊-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the ∊-transitions-removal problem. We introduce a new problem, a partial removal of ∊-transitions while accepting short chains of ∊-transitions.

Sign in / Sign up

Export Citation Format

Share Document