713 search results - page 39 / 143 » Model Checking and Transitive-Closure Logic |
120
click to vote
APN
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
120
click to vote
ESOP
2003
Springer
15 years 9 months ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
112
click to vote
MFCS
2009
Springer
15 years 10 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...
117
click to vote
FSEN
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. We present Trio2Promela, a tool for model checking TRIO specifications by means of Spin. TRIO is a linear-time temporal logic with both future and past operators and a qu...
157
click to vote
UML
2004
Springer
15 years 9 months ago
2004
Springer
This paper discusses a model-based design flow for requirements in distributed embedded software development. Such requirements are specified using a language similar to Linear T...