A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Reasoning about Data Repetitions with Counter Systems
2013
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
We study linear-time temporal logics interpreted over data words with multiple attributes. We restrict the atomic formulas to equalities of attribute values in successive positions and to repetitions of attribute values in the future or past. We demonstrate correspondences between satisfiability problems for logics and reachability-like decision problems for counter systems. We show that allowing/disallowing atomic formulas expressing repetitions of values in the past corresponds to the
doi:10.1109/lics.2013.8
dblp:conf/lics/DemriFP13
fatcat:bz4azd6m2nag5b2jgz4hfalu2e