Succinct discrete time approximations of distributed hybrid automata

DOI10.1145/1755952.1755955zbMath1361.68125OpenAlexW2148178569MaRDI QIDQ2985857

P. S. Thiagarajan, Shaofa Yang

Publication date: 10 May 2017

Published in: Proceedings of the 13th ACM international conference on Hybrid systems: computation and control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1755952.1755955

zbMATH Keywords

discrete time approximationdistributed hybrid automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

Related Items (1)

Modular discrete time approximations of distributed hybrid automata

Cites Work

• Unnamed Item
• Unnamed Item
• What's decidable about hybrid automata?
• Partial-order methods for the verification of concurrent systems. An approach to the state-explosion problem
• Discrete-time control for rectangular hybrid automata
• Unfoldings: A partial-order approach to model checking.
• Marked directed graphs
• Stability Analysis of Networked Control Systems Using a Switched Linear Systems Approach
• Decentralized Control of Discrete-Event Systems With Bounded or Unbounded Delay Communication
• Hybrid Systems: Computation and Control
• Hybrid Systems: Computation and Control

This page was built for publication: Succinct discrete time approximations of distributed hybrid automata