Work

The benefits of relaxing punctuality

Year: 1991

Type: conference-paper

Abstract: The most natural, compositional, way of modeling real-time systems uses a dense domain for time.The satistiability of timing constraints that are capable of expressing punctuality in this model, however, is known to be undecidable.We introduce a temporal language that can constrain the time difference between events only with finite, yet arbitrary, precision and show the resulting logic to be EXPSPACE-complete.This result allows us to develop an algorithm for the verification of timing properties of real-time systems with a dense semantics.

Source: ACM Symposium on Principles of Distributed Computing (PODC)

DOI: 10.1145/112600.112613

Authors: Rajeev Alur, Tomás Feder, Thomas A. Henzinger

Institutions: Stanford University, Core Competence

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

Funders: National Science Foundation, Advanced Research Projects Agency, Office of Naval Research

Awards: Algorithms and Tools for the Automatic Analysis of Embedded Systems, CAREER: Computer - Aided Verification, G6671297155