265 search results - page 13 / 53 » On varieties of meet automata |
FUIN
2006
13 years 7 months ago
2006
Abstract. We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of ...
KBSE
2003
IEEE
14 years 22 days ago
2003
IEEE
Physics-based animation programs can often be modeled in terms of hybrid automata. A hybrid automaton includes both discrete and continuous dynamical variables. The discrete varia...
UPP
2004
Springer
14 years 24 days ago
2004
Springer
Evolving solutions rather than computing them certainly represents an unconventional programming approach. The general methodology of evolutionary computation has already been know...
MEMOCODE
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper presents results on processor specification from a specialized high-level finite state machine (FSM) language. The language is an extension and enhancement of earlier...
DLT
2010
13 years 9 months ago
2010
It is known that the languages definable by formulae of the logics FO2[<,S], 2[<,S], LTL[F,P,X,Y] are exactly the variety DAD. Automata for this class are not known, nor is i...