Verifying abstractions of timed systems

DOI10.1007/3-540-61604-7_75zbMath1514.68148OpenAlexW1521052220MaRDI QIDQ6162104

Robert K. Brayton, Rajeev Alur, Serdar Tasiran, Robert Kurshan

Publication date: 28 June 2023

Published in: CONCUR '96: Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61604-7_75

Mathematics Subject Classification ID

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

Related Items

Better abstractions for timed automata, A survey of timed automata for the development of real-time systems, Modularity for timed and hybrid systems, Hardness of preorder checking for basic formalisms

Cites Work

• Unnamed Item
• CCS expressions, finite state processes, and three problems of equivalence
• Using mappings to prove timing properties
• A theory of timed automata
• Liveness in timed and untimed systems