Paper Info
Title
Verification of qualitative Z constraints
Abstract
We introduce an LTL-like logic with atomic formulae built over a constraint language interpreting variables in Z. The constraint language includes periodicity constraints and comparison constraints of the form x=y and x
Year
DOI
Venue
2008
10.1016/j.tcs.2008.07.023
Theor. Comput. Sci.
Keywords
DocType
Volume
constraint language,Symbolic model,Arithmetical constraint,Complexity,Temporal logic,atomic formula,Büchi automaton,qualitative Z constraint,LTL-like logic,periodicity constraint,comparison constraint
Journal
409
Issue
ISSN
Citations 
1
Theoretical Computer Science
13
PageRank 
References 
Authors
0.75
40
2
Name
Order
Citations
PageRank
Stéphane Demri183260.65
Régis Gascon2765.23