Temporal reasoning through automatic translation of tock-CSP into timed automata

DOI10.1007/978-3-030-92137-8_5zbMath1498.68147arXiv2104.13434OpenAlexW3215983834MaRDI QIDQ2154047

Ana Cavalcanti, Abdulrazaq Abba, Jeremy L. Jacob

Publication date: 13 July 2022

Full work available at URL: https://arxiv.org/abs/2104.13434

zbMATH Keywords

timed automatatranslationtock-CSP

Mathematics Subject Classification ID

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

Cites Work

• Semantics with applications: an appetizer.
• Specification of communicating processes: temporal logic versus refusals-based refinement
• On correct refinement of programs
• A theory of timed automata
• Understanding concurrent systems
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Communicating sequential processes
• Model-checking Timed Temporal Logics
• FDR3 — A Modern Refinement Checker for CSP
• Guided Test Generation from CSP Models
• Programming in Haskell
• Unnamed Item