114 search results - page 16 / 23 » A Determinizable Class of Timed Automata |
123
click to vote
FTRTFT
1998
Springer
15 years 4 months ago
1998
Springer
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...
109
Voted
LATA
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
111
click to vote
FSTTCS
2010
Springer
14 years 10 months ago
2010
Springer
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
JALC
2007
15 years 10 days ago
2007
We determine the complexity of learning problems for unary regular languages. We begin by investigating the minimum consistent dfa (resp. nfa) problem which is known not to be app...
133
Voted
LICS
1998
IEEE
15 years 4 months ago
1998
IEEE
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...