411 search results - page 64 / 83 » Timed Alternating-Time Temporal Logic |
CADE
2002
Springer
14 years 10 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
CONCUR
2004
Springer
14 years 3 months ago
2004
Springer
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
ENTCS
2007
13 years 9 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
EMSOFT
2008
Springer
13 years 11 months ago
2008
Springer
We present a framework for component-based design and scheduling of real-time embedded software. Each component has a clearly specified interface that includes the methods used fo...
PADS
2009
ACM
14 years 4 months ago
2009
ACM
Semantic composability aims to ensure that the composition of simulation components is meaningful in terms of their expressed behavior, and achieves the desired objective of the n...