Abstract. We describe an efficient algorithm for learning deterministic real-time automata (DRTA) from positive data. This data can be obtained from observations of the process to be modeled. The DRTA model we learn from such data can be used reason and gain knowledge about real-time systems such as network protocols, business processes, reactive sys-tems, etc.
We develop a novel learning algorithm RTI for identifying a deterministic real-time automaton (DRTA)...
A model for discrete event systems (DES) can be learned from observations. We propose a simple type ...
A model for discrete event systems (DES) can be learned from observations. We propose a simple type ...
We describe an efficient algorithm for learning deterministic real-time automata (DRTA) from positiv...
We describe an algorithm for learning simple timed automata, known as real-time automata. The transi...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We describe an algorithm for learning sim-ple timed automata, known as real-time au-tomata. The tran...
We develop a novel learning algorithm RTI for identifying a deterministic real-time automaton (DRTA)...
We develop a novel learning algorithm RTI for identifying a deterministic real-time automaton (DRTA)...
A common model for discrete event systems is a deterministic finite automaton (DFA). An advantage of...
A common model for discrete event systems is a deterministic finite automaton (DFA). An advantage of...
We develop a novel learning algorithm RTI for identifying a deterministic real-time automaton (DRTA)...
A model for discrete event systems (DES) can be learned from observations. We propose a simple type ...
A model for discrete event systems (DES) can be learned from observations. We propose a simple type ...
We describe an efficient algorithm for learning deterministic real-time automata (DRTA) from positiv...
We describe an algorithm for learning simple timed automata, known as real-time automata. The transi...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We adapt an algorithm (RTI) for identifying (learning) a deterministic real-time automaton (DRTA) to...
We describe an algorithm for learning sim-ple timed automata, known as real-time au-tomata. The tran...
We develop a novel learning algorithm RTI for identifying a deterministic real-time automaton (DRTA)...
We develop a novel learning algorithm RTI for identifying a deterministic real-time automaton (DRTA)...
A common model for discrete event systems is a deterministic finite automaton (DFA). An advantage of...
A common model for discrete event systems is a deterministic finite automaton (DFA). An advantage of...
We develop a novel learning algorithm RTI for identifying a deterministic real-time automaton (DRTA)...
A model for discrete event systems (DES) can be learned from observations. We propose a simple type ...
A model for discrete event systems (DES) can be learned from observations. We propose a simple type ...