Compatibility of refining and controlling plant automata with bisimulation quotients

DOI10.1007/978-3-031-28083-2_6OpenAlexW4323527402MaRDI QIDQ6174416

Roland Glück

Publication date: 17 August 2023

Published in: Relational and Algebraic Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-28083-2_6

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal and robust controller synthesis using energy timed automata with uncertainty
• Using Bisimulations for Optimality Problems in Model Refinement
• Model Refinement Using Bisimulation Quotients
• Linear Automaton Transformations
• Complete Lattices and Up-To Techniques
• Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
• A Semiring Approach to Equivalences, Bisimulations and Control
• Three Partition Refinement Algorithms
• Control of Infinite Behavior of Finite Automata
• On the synthesis of discrete controllers for timed systems
• Decidability of Second-Order Theories and Automata on Infinite Trees

This page was built for publication: Compatibility of refining and controlling plant automata with bisimulation quotients