58 search results - page 5 / 12 » Weakly maximal decidable structures |
172
Voted
FROCOS
2009
Springer
15 years 10 months ago
2009
Springer
Motivated by applications in software verification, we explore automated reasoning about the non-disjoint combination of theories of infinitely many finite structures, where the...
129
Voted
ENTCS
2008
15 years 3 months ago
2008
The satisfiability problem is the fundamental problem in proving the conflict-freeness of specifications, or in finding a counterexample for an invalid statement. In this paper, w...
98
Voted
MLQ
2007
15 years 2 months ago
2007
It is well known that MTL satisfies the finite embeddability property. Thus MTL is complete w.r.t. the class of all finite MTL-chains. In order to reach a deeper understanding ...
132
Voted
APN
2010
Springer
15 years 3 months ago
2010
Springer
Pure names are identifiers with no relation between them, except equality and inequality. In previous works we have extended P/T nets with the capability of creating and managing p...
128
click to vote
CORR
2007
Springer
15 years 3 months ago
2007
Springer
Formal verification using the model checking paradigm has to deal with two aspects: The system models are structured, often as products of components, and the specification logic...