The complexity of some reachability problems for a system on a finite group

DOI10.1016/0167-6911(89)90079-0zbMath0685.93004OpenAlexW1966034670MaRDI QIDQ1262244

Peter J. Ramadge, Christian Golaszewski

Publication date: 1989

Published in: Systems \& Control Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6911(89)90079-0

zbMATH Keywords

computational complexityreachabilityperiodic systems on cyclic groups

Mathematics Subject Classification ID

General systems theory (93A99)

Related Items (2)

A survey of computational complexity results in systems and control ⋮ The presence of a zero in an integer linear recurrent sequence is NP-hard to decide

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Supervisory Control of a Class of Discrete Event Processes
• Supervisory control of discrete-event processes with partial observations
• Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata

This page was built for publication: The complexity of some reachability problems for a system on a finite group