3229 search results - page 238 / 646 » The Theory of Timed Automata |
168
click to vote
EMSOFT
2006
Springer
15 years 10 months ago
2006
Springer
Synchronous data-flow languages such as Scade/Lustre manage infinite sequences, or streams, as primitive values making them naturally adapted to the description of datadominated s...
151
click to vote
ZUM
2000
Springer
15 years 10 months ago
2000
Springer
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
159
click to vote
PODC
1991
ACM
15 years 10 months ago
1991
ACM
Abstract. Self-stabilizing message driven protocols are deļ¬ned and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is deļ...
156
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Recent advances in technology allow multi-agent systems to be deployed in cooperation with or as a service for humans. Typically, those systems are designed assuming individually ...
169
click to vote
FORTE
2008
15 years 8 months ago
2008
In software engineering, graphical formalisms, like state-transition tables and automata, are very often indispensable parts of the specifications. Such a formalism usually leads t...