Deciding concurrent planar monotonic linear hybrid systems

DOI10.1007/978-3-319-22975-1_17zbMATH Open1465.68198OpenAlexW2199263795MaRDI QIDQ2945600FDOQ2945600

Authors: Pavithra Prabhakar, Nima Roohi, Mahesh Viswanathan 

Publication date: 14 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-22975-1_17

Recommendations

• A Decidable Class of Planar Linear Hybrid Systems
• A decidable class of planar linear hybrid systems
• What's decidable about hybrid automata?
• Reachability Problems for Hybrid Automata
• scientific article; zbMATH DE number 1303067

Mathematics Subject Classification ID

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

Cites Work

• A theory of timed automata
• O-minimal hybrid systems.
• Title not available (Why is that?)
• Title not available (Why is that?)
• The algorithmic analysis of hybrid systems
• Reachability analysis of dynamical systems having piecewise-constant derivatives
• Algorithmic analysis of polygonal hybrid systems. I: Reachability
• Title not available (Why is that?)
• STORMED Hybrid Systems
• Title not available (Why is that?)
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• A decidable class of planar linear hybrid systems
• Decidable Compositions of O-Minimal Automata

Cited In (3)

• A decidable class of planar linear hybrid systems
• Monotonic hybrid systems
• A Decidable Class of Planar Linear Hybrid Systems

This page was built for publication: Deciding concurrent planar monotonic linear hybrid systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2945600)