Sciweavers

233 search results - page 1 / 47
» Equivalent Transformations of Automata by Using Behavioural ...
Sort
View
JUCS
2007
95views more  JUCS 2007»
13 years 4 months ago
Equivalent Transformations of Automata by Using Behavioural Automata
: This paper uses category theory to emphasize the relationships between Mealy, Moore and Rabin-Scott automata, and the behavioural automata are used as a unifying framework. Some ...
Gabriel Ciobanu, Sergiu Rudeanu
IMSCCS
2006
IEEE
13 years 10 months ago
Explicitly Parallel Regular Expressions
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
Brett D. Estrade, A. Louise Perkins, John M. Harri...
FOSSACS
2012
Springer
12 years 13 days ago
A Coalgebraic Perspective on Minimization and Determinization
Coalgebra offers a unified theory of state based systems, including infinite streams, labelled transition systems and deterministic automata. In this paper, we use the coalgebrai...
Jirí Adámek, Filippo Bonchi, Mathias...
RTCSA
2008
IEEE
13 years 11 months ago
Verification of COMDES-II Systems Using UPPAAL with Model Transformation
COMDES-II is a component-based software framework intended for Model Integrated Computing (MIC) of embedded control systems with hard real-time constraints. We present a transforma...
Xu Ke, Paul Pettersson, Krzysztof Sierszecki, Chri...
FATES
2004
Springer
13 years 10 months ago
Specifying and Generating Test Cases Using Observer Automata
We present a technique for specifying coverage criteria and a method for generating test suites for systems whose behaviours can be described as extended finite state machines (EF...
Johan Blom, Anders Hessel, Bengt Jonsson, Paul Pet...