512 search results - page 90 / 103 » Automata as Abstractions |
ECAI
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. This paper shows that we can take advantage of information about the probabilities of the occurrences of events, when this information is available, to refine the classic...
QEST
2010
IEEE
13 years 5 months ago
2010
IEEE
We study Timed Branching Processes (TBPs), a natural extension of (multitype) Branching Processes (BPs) where each entity is equipped with a finite set of private continuous variab...
RTSS
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—We apply automata theory to specifying behavioral interfaces of objects and show how to check schedulability and compatibility of real time asynchronous objects. The beh...
CONCUR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. When dealing with process calculi and automata which express both nondeterministic and probabilistic behavior, it is customary to introduce the notion of scheduler to res...
FASE
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Existing algorithms for regular inference (aka automata learning) allows to infer a finite state machine by observing the output that the machine produces in response to ...