1454 search results - page 229 / 291 » Stateful traits and their formalization |
192
click to vote
BIRTHDAY
2003
Springer
16 years 1 days ago
2003
Springer
Abstract. Bounded fairness is a stronger notion than ordinary eventuality-based fairness, one that guarantees occurrence of an event within a fixed number of occurrences of anothe...
155
click to vote
CAV
2003
Springer
16 years 1 days ago
2003
Springer
The paper considers the problem of checking abstraction between two finite-state fair discrete systems (FDS). In automata-theoretic terms this is trace inclusion between two nond...
171
click to vote
CHARME
2003
Springer
16 years 1 days ago
2003
Springer
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
215
click to vote
CONCUR
2003
Springer
16 years 23 hour ago
2003
Springer
We present a process-algebraic language for Probabilistic I/O Automata (PIOA). To ensure that PIOA specifications given in our language satisfy the “input-enabled” property, w...
177
click to vote
DSVIS
2003
Springer
16 years 19 hour ago
2003
Springer
Based on a revision of the common task understanding in model-based approaches a formal meta model is proposed which allows more expressive task descriptions. A task is considered ...