On control of systems modelled as deterministic Rabin automata

DOI10.1007/BF01439153zbMath0853.93008OpenAlexW1966652050MaRDI QIDQ1902499

J. G. Thistle

Publication date: 22 November 1995

Published in: Discrete Event Dynamic Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01439153

zbMATH Keywords

synthesiscontrollabilitysupervisory controlautomataRabin acceptance conditionsChurch's problem

Mathematics Subject Classification ID

Controllability (93B05) Formal languages and automata (68Q45) General systems (93A10)

Related Items (6)

Using logic to solve the submodule construction problem ⋮ Supervisory control of discrete event systems ⋮ On the relation between reactive synthesis and supervisory control of non-terminating processes ⋮ Control of \(\omega\)-automata under state fairness assumptions ⋮ Supervisory control and reactive synthesis: a comparative introduction ⋮ Supervisory Control with Complete Observations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Defining liveness
• Verification of concurrent programs: The automata-theoretic framework
• Supervisory Control of a Class of Discrete Event Processes
• Some tractable supervisory control problems for discrete-event systems modeled by Buchi automata
• Control of Infinite Behavior of Finite Automata
• Supervision of Infinite Behavior of Discrete-Event Systems
• On supervisory control of sequential behaviors
• Solving Sequential Conditions by Finite-State Strategies
• Testing and generating infinite sequences by a finite automaton
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: On control of systems modelled as deterministic Rabin automata