481 search results - page 26 / 97 » Model Checking Abstract State Machines and Beyond |
115
click to vote
MODELLIERUNG
2004
15 years 3 months ago
2004
ion from the implementation they use. Some tools rather consequently use this abstract model; others at least partly keep the implementational view, modeling components, e.g., by o...
126
click to vote
ATVA
2006
Springer
15 years 5 months ago
2006
Springer
e Abstraction of Programs With Non-linear Computation Songtao Xia1 Ben Di Vito2 Cesar Munoz3 1 NASA Postdoc at NASA Langley Research Center, Hampton, VA 2 NASA Langley Research Cen...
117
click to vote
ACSD
2003
IEEE
15 years 5 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...
137
click to vote
ASE
2006
15 years 2 months ago
2006
Finite state machines have been used to model a number of classes of system and there has thus been much interest in the automatic generation of test sequences from finite state m...
114
click to vote
FSTTCS
2001
Springer
15 years 6 months ago
2001
Springer
Abstract. This paper addresses the state explosion problem in automata based LTL model checking. To deal with large space requirements we turn to use a distributed approach. All th...