NDLI: Back to the future: towards a theory of timed regular languages

Content Provider	IEEE Xplore Digital Library
Author	Alur, R. Henzinger, T.A.
Copyright Year	1992
Description	Author affiliation: AT&T Bell Labs., Murray Hill, NJ, USA (Alur, R.)
Abstract	The authors introduce two-way timed automata-timed automata that can move back and forth while reading a timed word. Two-wayness in its unrestricted form leads, like nondeterminism, to the undecidability of language inclusion. However, if they restrict the number of times an input symbol may be revisited, then two-wayness is both harmless and desirable. The authors show that the resulting class of bounded two-way deterministic timed automata is closed under all boolean operations, has decidable (PSPACE-complete) emptiness and inclusion problems, and subsumes all decidable real-time logics we know. They obtain a strict hierarchy of real-time properties: deterministic timed automata can accept more languages as the bound on the number of times an input symbol may be revisited is increased. This hierarchy is also enforced by the number of alternations between past and future operators in temporal logic. The combination of the results leads to a decision procedure for a real-time logic with past operators.<>
Starting Page	177
Ending Page	186
File Size	783062
Page Count	10
File Format	PDF
ISBN	0818629002
DOI	10.1109/SFCS.1992.267774
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1992-10-24
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Automata Logic Computational modeling Timing Boolean functions Instruments Contracts Computer science Military computing Robustness
Content Type	Text
Resource Type	Article

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

Using timed Boolean algebra to solve false path problem in timing analysis

A model-theoretic approach to regular string relations

Regular Ideal Languages and Their Boolean Combinations

Timed Automata Robustness Analysis via Model Checking

Verifying pipelined hardware using symbolic logic simulation

Back to the Future: Towards a Theory of Timed Regular Languages (1992)

Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties

Entropy of regular timed languages

Generating functions of timed languages

Back to the future: towards a theory of timed regular languages

Similar Documents

Using timed Boolean algebra to solve false path problem in timing analysis

A model-theoretic approach to regular string relations

Regular Ideal Languages and Their Boolean Combinations

Timed Automata Robustness Analysis via Model Checking

Verifying pipelined hardware using symbolic logic simulation

Back to the Future: Towards a Theory of Timed Regular Languages (1992)

Verifying Probabilistic Timed Automata Against Omega-Regular Dense-Time Properties

Entropy of regular timed languages

Generating functions of timed languages

Back to the future: towards a theory of timed regular languages