Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems

DOI10.1007/978-3-540-70594-9_18zbMATH Open1156.68499OpenAlexW1804217705MaRDI QIDQ3521995FDOQ3521995

Michel Sintzoff

Publication date: 28 August 2008

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70594-9_18

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Discrete-time control/observation systems (93C55) Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Compatibility of refining and controlling plant automata with bisimulation quotients
• Model Refinement Using Bisimulation Quotients

   Recommendations

• [[:Publication:4953385|Title not available (Why is that?)]]
• Unconstrained optimal control of regular languages
• Optimal supervisory control of finite state automata
• Symbolic supervisory control of infinite transition systems under partial observation using abstract interpretation
• Infinite time regular synthesis

This page was built for publication: Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems

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