Digitisation and full abstraction for dense-time model checking

DOI10.1007/3-540-46002-0_4MaRDI QIDQ4472226zbMATH OpenFDO

Authors Joël Ouaknine

Publication date 4 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2280/22800037.htm

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

• Digitizing interval duration logic.
• Predicate abstraction for dense real-time systems
• Analysis of timed systems using time-abstracting bisimulations
• Timed CSP = closed timed automata
• Model-checking in dense real-time

Cited in

(10)

• Verification of duration systems using an approximation approach
• Checking noninterference in timed CSP
• Translating between models of concurrency
• Timed CSP = closed timed automata
• Time-Bounded Verification
• Time-Progress Evaluation for Dense-Time Automata with Concave Path Conditions
• On discretization of delays in timed automata and digital circuits
• Digitizing interval duration logic.
• Continuous KAOS, ASM, and formal control system design across the continuous/discrete modeling interface: a simple train stopping application
• Performance analysis of probabilistic timed automata using digital clocks

Describes a project that uses

Uses Software

• HyTech
• Uppaal

This page was built for publication: Digitisation and full abstraction for dense-time model checking

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