Abstract | ||
---|---|---|
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in MediaObjects/InlineFigure2.png. The constraint language includes periodicity constraints, comparison constraints of the form x = y and x |
Year | DOI | Venue |
---|---|---|
2005 | 10.1007/11539452_39 | CONCUR |
Keywords | Field | DocType |
constraint language,qualitative constraint,atomic formula,ltl-like logic,periodicity constraint,comparison constraint,model checking,programming language,satisfiability | Discrete mathematics,Existential quantification,Computer science,Modulo,Boolean satisfiability problem,Satisfiability,Decidability,PSPACE,Boolean algebra,Linear logic | Conference |
ISBN | Citations | PageRank |
3-540-28309-9 | 8 | 0.54 |
References | Authors | |
21 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Stéphane Demri | 1 | 832 | 60.65 |
Régis Gascon | 2 | 76 | 5.23 |