scientific article; zbMATH DE number 1852175
zbMATH Open1002.68506MaRDI QIDQ4787254FDOQ4787254
Yong Li, Xuandong Li, Tao Zheng, Guoliang Zheng, Yu Pei, Jian-hua Zhao
Publication date: 9 January 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2144/21440465
Title of this publication is not available (Why is that?)
Recommendations
- Positive loop-closed automata: A decidable class of hybrid systems
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
- PTIME parametric verification of safety properties for reasonable linear hybrid automata
- Theoretical Aspects of Computing - ICTAC 2004
- scientific article; zbMATH DE number 1303060
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Linear programming (90C05) Specification and verification (program logics, model checking, etc.) (68Q60)
Cited In (7)
- Positive loop-closed automata: A decidable class of hybrid systems
- Deriving Unbounded Reachability Proof of Linear Hybrid Automata during Bounded Checking Procedure
- Decidability and complexity for the verification of safety properties of reasonable linear hybrid automata
- Title not available (Why is that?)
- Symbolic analysis of linear hybrid automata -- 25 years later
- Title not available (Why is that?)
- Title not available (Why is that?)
Uses Software
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4787254)
