Compatibility of refining and controlling plant automata with bisimulation quotients
From MaRDI portal
Recommendations
- Controller synthesis for bisimulation equivalence
- Bisimulation relations for dynamical, control, and hybrid systems
- Bisimulation relations for dynamical and control systems
- Computing bisimulations for finite-control -calculus
- Bisimulation, the supervisory control problem and strong model matching for finite state machines
- Bisimulation of automata
- Bisimulations of Boolean Control Networks
- Approximate bisimulation: a bridge between computer science and control theory
- A semiring approach to equivalences, bisimulations and control
- Control of Nondeterministic Discrete-Event Systems for Bisimulation Equivalence
Cites work
- A relation-algebraic theory of bisimulations
- A semiring approach to equivalences, bisimulations and control
- Complete Lattices and Up-To Techniques
- Control of Infinite Behavior of Finite Automata
- Decidability of Second-Order Theories and Automata on Infinite Trees
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 408813 (Why is no real title available?)
- scientific article; zbMATH DE number 234018 (Why is no real title available?)
- scientific article; zbMATH DE number 5585443 (Why is no real title available?)
- Linear Automaton Transformations
- Model refinement using bisimulation quotients
- On the synthesis of discrete controllers for timed systems
- Optimal and robust controller synthesis using energy timed automata with uncertainty
- Synthesis of Optimal Control Policies for Some Infinite-State Transition Systems
- Three Partition Refinement Algorithms
- Using bisimulations for optimality problems in model refinement
This page was built for publication: Compatibility of refining and controlling plant automata with bisimulation quotients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174416)
