scientific article; zbMATH DE number 1705170

zbMATH Open0986.68066MaRDI QIDQ2771065FDOQ2771065

Authors: Paritosh K. Pandya 

Publication date: 14 February 2002

Title of this publication is not available (Why is that?)

Recommendations

• Model-checking in dense real-time
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• The Complexity of CTL* + Linear Past
• Quantified computation tree logic
• Verification of Linear Duration Invariants by Model Checking CTL Properties

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44) Logic in computer science (03B70)

Cited In (8)

• Interval duration logic: expressiveness and decidability
• Formalizing timing diagram requirements in discrete duration calculus
• Computable semantics for \(\text{CTL}^*\) on discrete-time and continuous-space dynamic systems
• Finding extremal models of discrete duration calculus formulae using symbolic search
• Title not available (Why is that?)
• Title not available (Why is that?)
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• An algebraic specification for CTL with time constraints

Uses Software

• DCVALID
• IDLVALID

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2771065)