Results 1  10
of
21,448
Learning Nondeterministic Mealy Machines
"... In applications where abstract models of reactive systems are to be inferred, one important challenge is that the behavior of such systems can be inherently nondeterministic. To cope with this challenge, we developed an algorithm to infer nondeterministic computation models in the form of Mealy mac ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
In applications where abstract models of reactive systems are to be inferred, one important challenge is that the behavior of such systems can be inherently nondeterministic. To cope with this challenge, we developed an algorithm to infer nondeterministic computation models in the form of Mealy
Networks of Mealy Multiset Automata
"... We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Molecular Biology Systems biology represents a new crossdisciplinary approach in biology which has only recently been made ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Molecular Biology Systems biology represents a new crossdisciplinary approach in biology which has only recently been
EQUIVALENCE RELATIONS OF MEALY AUTOMATA
"... Two independent equivalence relations are considered for Mealy automata. Simulation equivalence, on the one hand, arises from a new multistep simulation concept under the constraint that the process of switching from one automaton to the other is reversible. Retiming equivalence, on the other han ..."
Abstract
 Add to MetaCart
Two independent equivalence relations are considered for Mealy automata. Simulation equivalence, on the one hand, arises from a new multistep simulation concept under the constraint that the process of switching from one automaton to the other is reversible. Retiming equivalence, on the other
Improving Active Mealy Machine Learning for Protocol Conformance Testing
 MACHINE LEARNING
"... Using a wellknown industrial case study from the verification literature, the bounded retransmission protocol, we show how active learning can be used to establish the correctness of protocol implementation I relative to a given reference implementation R. Using active learning, we learn a model MR ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Using a wellknown industrial case study from the verification literature, the bounded retransmission protocol, we show how active learning can be used to establish the correctness of protocol implementation I relative to a given reference implementation R. Using active learning, we learn a model
A.: Coalgebraic Logic and Synthesis of Mealy Machines
"... Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds to a finite formula in the language. For the converse, we give a compositional synthesis algorithm which transforms every ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds to a finite formula in the language. For the converse, we give a compositional synthesis algorithm which transforms
NonDeterministic Kleene Coalgebras
"... In this paper, we present a systematic way of deriving (1) languages of (generalised) regular expressions, and (2) sound and complete axiomatizations thereof, for a wide variety of systems. This generalizes both the results of Kleene (on regular languages and deterministic finite automata) and Miln ..."
Abstract

Cited by 25 (9 self)
 Add to MetaCart
) and Milner (on regular behaviours and finite labelled transition systems), and includes many other systems such as Mealy and Moore machines.
Mealy Machines Are A Better Model Of Lexical Analyzers
 Computer Languages
, 1996
"... Lexical analyzers partition input characters into tokens. When ambiguities arise during lexical analysis, the longestmatch rule is generally adopted to resolve the ambiguities. The longestmatch rule causes the lookahead problem in traditional lexical analyzers, which are based on Moore machines. ..."
Abstract

Cited by 4 (3 self)
 Add to MetaCart
. In Moore machines, output tokens are associated with states of the automata. By contrast, because Mealy machines associate output tokens with state transitions, the lookahead behaviors can be encoded in their state transition tables. Therefore, we believe that lexical analyzers should be based on Mealy
Software ENgineering Coalgebraic logic and synthesis of Mealy machines
, 2007
"... CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ..."
Abstract
 Add to MetaCart
CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms.
Synthesis of Mealy Machines Using Derivatives Abstract
"... Centrum voor Wiskunde en Informatica (CWI) is the national research institute for Mathematics and Computer Science. It is sponsored by the Netherlands Organisation for Scientific Research (NWO). CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI& ..."
Abstract
 Add to MetaCart
Centrum voor Wiskunde en Informatica (CWI) is the national research institute for Mathematics and Computer Science. It is sponsored by the Netherlands Organisation for Scientific Research (NWO). CWI is a founding member of ERCIM, the European Research Consortium for Informatics and Mathematics. CWI's research has a themeoriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms.
The Nondeterministic Divide
, 1990
"... The nondeterministic divide partitions a vector into two nonempty slices by allowing the point of division to be chosen nondeterministically. Support for highlevel divideandconquer programming provided by the nondeterministic divide is investigated. A diva algorithm is a recursive divideand ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
The nondeterministic divide partitions a vector into two nonempty slices by allowing the point of division to be chosen nondeterministically. Support for highlevel divideandconquer programming provided by the nondeterministic divide is investigated. A diva algorithm is a recursive divide
Results 1  10
of
21,448