Interval duration logic: expressiveness and decidability
type: Item
instance of: scholarly article
zbMATH Open document ID: 1270.68175
DOI: 10.1016/S1571-0661(04)80480-8
author: Paritosh K. Pandya
published in: Electronic Notes in Theoretical Computer Science
publication date: 2013-08-15T00:00:00Z
Mathematics Subject Classification ID: 68Q60
Mathematics Subject Classification ID: 03B70
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6198631
describes a project that uses: Uppaal
describes a project that uses: Kronos
describes a project that uses: MONA
describes a project that uses: DCVALID
describes a project that uses: IDLVALID
MaRDI profile type: Publication
cites work: Q4038702
cites work: Event-clock automata: a determinizable class of timed automata
cites work: Timed regular expressions
cites work: A propositional modal logic of time intervals
cites work: Model-checking dense-time duration calculus
cites work: Model-checking discrete duration calculus
cites work: Duration calculus: Logical foundations
cites work: Decidable integration graphs.
cites work: Q3128862
cites work: Q2771065
cites work: Q3126783
cites work: A calculus of durations
cites work: Q4281508
title: Interval duration logic: expressiveness and decidability
description: scientific article; zbMATH DE number 6198631