50 lines
1.0 KiB
Markdown
50 lines
1.0 KiB
Markdown
---
|
|
id: LIT-20260109152249
|
|
title: Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
|
|
type: literature
|
|
created: 2026-01-09T20:22:49Z
|
|
modified: 2026-01-09T21:14:05Z
|
|
citekey:
|
|
---
|
|
|
|
# Hybrid automata: An algorithmic approach to the specification and verification of hybrid systems
|
|
|
|
## First Pass
|
|
**Category:**
|
|
New methods paper
|
|
|
|
**Context:**
|
|
This paper was released in the early 1990's when formal
|
|
methods was gaining some steam for proving algorithms. This
|
|
paper talks about the challenges of hybrid systems, where
|
|
there are discrete changes on top of continuous dynamics.
|
|
|
|
**Correctness:**
|
|
It's an extremely well cited paper.
|
|
|
|
**Contributions:**
|
|
The [[Hybrid Automata]]
|
|
|
|
**Clarity:**
|
|
4/5. Dense. Mathematical.
|
|
|
|
## Second Pass
|
|
**What is the main thrust?**
|
|
|
|
**What is the supporting evidence?**
|
|
|
|
**What are the key findings?**
|
|
|
|
## Third Pass
|
|
**Recreation Notes:**
|
|
|
|
**Hidden Findings:**
|
|
|
|
**Weak Points? Strong Points?**
|
|
|
|
## Spawned Zettels
|
|
[[Hybrid Automata]]
|
|
[[Linear Hybrid Automata]]
|
|
[[Timed Automata]]
|
|
[[reactive-programs]]
|