713 search results - page 21 / 143 » Model Checking and Transitive-Closure Logic |
103
click to vote
LPNMR
2004
Springer
15 years 4 months ago
2004
Springer
Abstract. Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check...
GCC
2003
Springer
15 years 4 months ago
2003
Springer
We use 2-Dimensional language to construct 2-Dimensional computer graphics model, use MSO or other logics to specify some graph property, and use automata model checking technique ...
CADE
2007
Springer
15 years 11 months ago
2007
Springer
83
Voted
FORMATS
2004
Springer
15 years 4 months ago
2004
Springer
We study the model-checking problem for weighted timed automata and the weighted CTL logic by the bisimulation approach. Weighted timed automata are timed automata extended with co...
102
click to vote
LICS
2005
IEEE
15 years 4 months ago
2005
IEEE
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...