SMT-based bounded schedulability analysis of the clock constraint specification language

DOI10.1007/978-3-030-16722-6_4MaRDI QIDQ6091318zbMATH OpenFDO

Authors

Publication date 24 November 2023

Published in Fundamental Approaches to Software Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/978-3-030-16722-6_4

zbMATH Keywords

CCSLlogical timereal-time systemschedulabilitySMT

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• An executable semantics of clock constraint specification language and its applications
• Instant-based and state-based analysis of infinite logical clock
• Divergence detection for CCSL specification via clock causality chain
• Time: it is only logical!
• Coalgebraic semantic model for the clock constraint specification language

Cited in

(1)

• Time: it is only logical!

This page was built for publication: SMT-based bounded schedulability analysis of the clock constraint specification language

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