Asynchronous l-complete approximations

DOI10.1016/J.SYSCONLE.2014.08.005MaRDI QIDQ464604zbMATH OpenOpenAlexFDO

Authors Anne-Kathrin Schmuck, Jörg Raisch

Publication date 27 October 2014

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

Full work available at URL https://arxiv.org/abs/1402.5759

zbMATH Keywords

\(l\)-complete approximationsbehavioral systems theoryfinite state abstractionstate property

Mathematics Subject Classification ID

System structure simplification (93B11) Design techniques (robust design, computer-aided design, etc.) (93B51)

Abstract: This paper extends the $l$-complete approximation method developed for time invariant systems to a larger system class, ensuring that the resulting approximation can be realized by a finite state machine. To derive the new abstraction method, called asynchronous $l$-complete approximation, an asynchronous version of the well-known concepts of state property, memory span and $l$-completeness is introduced, extending the behavioral systems theory in a consistent way.

Recommendations

• Complete abstractions of dynamical systems by timed automata
• Discrete supervisory control of hybrid systems based on \(l\)-complete approximations
• Approximately Bisimilar Finite Abstractions of Stable Linear Systems
• Bisimilar Finite Abstractions of Interconnected Systems
• Asynchronous pseudo-systems

Cites work

• scientific article; zbMATH DE number 3887558 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3711820 (Why is no real title available?)
• scientific article; zbMATH DE number 4123587 (Why is no real title available?)
• An Approximate Simulation Approach to Symbolic Control
• Computing Abstractions of Nonlinear Systems
• Discrete supervisory control of hybrid systems based on \(l\)-complete approximations
• Hierarchical control system design using approximate simulation
• Paradigms and puzzles in the theory of dynamical systems
• Supervisory control of hybrid systems within a behavioural framework
• Symbolic models for control systems
• Verification and Control of Hybrid Systems

Cited in

(4)

• Modelling and supervisory control of hybrid dynamical systems via fuzzy \(l\)-complete approximation approach
• Refinements of behavioural abstractions for the supervisory control of hybrid systems
• Toward a Topological Characterization of Asynchronous Complexity
• Supervisory control synthesis for deterministic context free specification languages. Enforcing controllability least restrictively

This page was built for publication: Asynchronous \(l\)-complete approximations

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