Automated Reasoning for Hybrid Systems — Two Case Studies —

DOI10.1007/978-3-540-78913-0_15zbMath1138.68526OpenAlexW1583398073MaRDI QIDQ3498414

Peter Höfner

Publication date: 15 May 2008

Published in: Relations and Kleene Algebra in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78913-0_15

Mathematics Subject Classification ID

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

Related Items (2)

An algebra of hybrid systems ⋮ Automated verification of refinement laws

Uses Software

• SPASS+T
• Prover9
• Mace4

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The algorithmic analysis of hybrid systems
• Kleene getting lazy
• An algebra of hybrid systems
• A theory of timed automata
• Process algebra for hybrid systems
• Automated Reasoning in Kleene Algebra
• SRASS - A Semantic Relevance Axiom Selection System
• KAT-ML: an interactive theorem prover for Kleene algebra with tests
• Kleene algebra with domain
• Formal Methods for Components and Objects
• Relational and Kleene-Algebraic Methods in Computer Science
• Relational Methods in Computer Science

This page was built for publication: Automated Reasoning for Hybrid Systems — Two Case Studies —