NDLI: LTL with the Freeze Quantifier and Register Automata

Content Provider	IEEE Xplore Digital Library
Author	Demri, S. Lazic, R.
Copyright Year	2006
Description	Author affiliation: LSV, CNRS (Demri, S.)
Abstract	Temporal logics, first-order logics, and automata over data words have recently attracted considerable attention. A data word is a word over a finite alphabet, together with a datum (an element of an infinite domain) at each position. Examples include timed words and XML documents. To refer to the data, temporal logics are extended with the freeze quantifier, first-order logics with predicates over the data domain, and automata with registers or pebbles. We investigate relative expressiveness and complexity of standard decision problems for LTL with the freeze quantifier (LTLdarr), 2-variable first-order logic $(FO^{2})$ over data words, and register automata. The only predicate available on data is equality. Previously undiscovered connections among those formalisms, and to counter automata with incrementing errors, enable us to answer several questions left open in recent literature. We show that the future-time fragment of LTLdarr which corresponds to $FO^{2}$ over finite data words can be extended considerably while preserving decidability, but at the expense of non-primitive recursive complexity, and that most of further extensions are undecidable. We also prove that surprisingly, over infinite data words, LTLdarr without the 'until' operator, as well as nonemptiness of one-way universal register automata, are undecidable even when there is only 1 register
Sponsorship	IEEE Comput. Soc. Tech. Committ. on Mathematical Found. of Comput
Starting Page	17
Ending Page	26
File Size	254798
Page Count	10
File Format	PDF
ISBN	0769526314
ISSN	10436871
DOI	10.1109/LICS.2006.31
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-08-12
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Automata Computer science Registers XML Counting circuits Logic testing Art Clocks
Content Type	Text
Resource Type	Article
Subject	Mathematics Software

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

On the freeze quantifier in constraint LTL: decidability and complexity

LTL with the freeze quantifier and register automata

LTL with the Freeze Quantifier and Register Automata

The Effects of Bounding Syntactic Resources on Presburger LTL

LTL with the freeze quantifier and register automata (2006)

LTL with the freeze quantifier and register automata (2006)

An Automata-Theoretic Approach to Constraint LTL

Improving Pattern-Based LTL Formulas for Automata Model Checking

Uniform descriptions for model based testing

LTL with the Freeze Quantifier and Register Automata

Similar Documents

On the freeze quantifier in constraint LTL: decidability and complexity

LTL with the freeze quantifier and register automata

LTL with the Freeze Quantifier and Register Automata

The Effects of Bounding Syntactic Resources on Presburger LTL

LTL with the freeze quantifier and register automata (2006)

LTL with the freeze quantifier and register automata (2006)

An Automata-Theoretic Approach to Constraint LTL

Improving Pattern-Based LTL Formulas for Automata Model Checking

Uniform descriptions for model based testing

LTL with the Freeze Quantifier and Register Automata