Reasoning about Data Repetitions with Counter Systems
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 pro...
Main Authors: | Stephane Demri, Diego Figueira, M Praveen |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2016-08-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1645/pdf |
Similar Items
-
Reasoning about Strategies: on the Satisfiability Problem
by: Fabio Mogavero, et al.
Published: (2017-03-01) -
The complexity of linear-time temporal logic over the class of ordinals
by: Stephane Demri, et al.
Published: (2010-12-01) -
A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes
by: Ahmed Bouajjani, et al.
Published: (2009-04-01) -
Dense-Timed Petri Nets: Checking Zenoness, Token liveness and Boundedness
by: Parosh Abdulla, et al.
Published: (2007-02-01) -
Logic Meets Algebra: the Case of Regular Languages
by: Pascal Tesson, et al.
Published: (2007-02-01)