364 search results - page 21 / 73 » Model checking with Boolean Satisfiability |
DATE
2003
IEEE
14 years 24 days ago
2003
IEEE
Symbolic techniques usually use characteristic functions for representing sets of states. Boolean functional vectors provide an alternate set representation which is suitable for ...
DLOG
2006
13 years 9 months ago
2006
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
SPIN
2001
Springer
13 years 12 months ago
2001
Springer
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
RTSS
1997
IEEE
13 years 11 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
ISCAS
2002
IEEE
14 years 12 days ago
2002
IEEE
We address the problem of checking the routability of segmented channels using satisfiability. The segmented channel routing problem arises in the context of row-based field progr...