Sciweavers

29 search results - page 4 / 6
» Decomposing port automata
Sort
View
CSR
2006
Springer
13 years 11 months ago
Conjugacy and Equivalence of Weighted Automata and Functional Transducers
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
Marie-Pierre Béal, Sylvain Lombardy, Jacque...
ICSM
2005
IEEE
14 years 1 months ago
Quality Driven Software Migration of Procedural Code to Object-Oriented Design
In the context of software maintenance, legacy software systems are continuously re-engineered in order to correct errors, provide new functionality, or port them into modern plat...
Ying Zou
ICFEM
2003
Springer
14 years 18 days ago
Generic Interacting State Machines and Their Instantiation with Dynamic Features
Interacting State Machines (ISMs) are used to model reactive systems and to express and verify their properties. They can be seen both as automata exchanging messages simultaneousl...
David von Oheimb, Volkmar Lotz
CORR
2011
Springer
175views Education» more  CORR 2011»
13 years 2 months ago
Finitary languages
Abstract The class of ω-regular languages provide a robust specification language in verification. Every ω-regular condition can be decomposed into a safety part and a liveness...
Krishnendu Chatterjee, Nathanaël Fijalkow
TON
2008
109views more  TON 2008»
13 years 7 months ago
On hierarchical traffic grooming in WDM networks
Abstract--The traffic grooming problem is of high practical importance in emerging wide-area wavelength division multiplexing (WDM) optical networks, yet it is intractable for any ...
Bensong Chen, George N. Rouskas, Rudra Dutta