CONCUR 2004 - Concurrency Theory

DOI10.1007/B100113MaRDI QIDQ5311490zbMATH OpenOpenAlexFDO

Authors Nicolas Markey, Jean-François Raskin

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b100113

zbMATH Keywords

clock regionmodel checkingpath checkingtimed automatontimed pathtimed temporal logics

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Model checking restricted sets of timed paths
• Model-checking timed temporal logics
• Model-checking in dense real-time
• Is your model checker on time? On the complexity of model checking for timed modal logics

Cited in

(3)

• Model checking restricted sets of timed paths
• Weak Kripke structures and LTL
• Model checking a path (preliminary report)

This page was built for publication: CONCUR 2004 - Concurrency Theory

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