Compositional Abstraction in Real-Time Model Checking

DOI10.1007/978-3-540-85778-5_17zbMath1171.68545OpenAlexW2170306229MaRDI QIDQ3543301

Jasper Berendsen, Frits W. Vaandrager

Publication date: 2 December 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85778-5_17

Mathematics Subject Classification ID

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

Related Items (6)

On Implementable Timed Automata ⋮ Event algebra for transition systems composition application to timed automata ⋮ Compositional Abstraction in Real-Time Model Checking ⋮ The axiomatization of override and update ⋮ Methodologies for Specification of Real-Time Systems Using Timed I/O Automata ⋮ Compositional Abstraction for Stochastic Systems

Uses Software

• Uppaal

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The existence of refinement mappings
• A process algebra with distributed priorities
• Turning SOS rules into equations
• Process algebra with guards: Combining hoare logic with process algebra
• Forward and backward simulations. I. Untimed Systems
• The Theory of Timed I/O Automata
• Compositional Abstraction in Real-Time Model Checking
• Foundations of a Compositional Interchange Format for Hybrid Systems
• A theory of normed simulations
• The Spotlight Principle
• Frontiers of Combining Systems
• Formal Methods for the Design of Real-Time Systems
• CONCUR 2005 – Concurrency Theory

This page was built for publication: Compositional Abstraction in Real-Time Model Checking