A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Filters
Lazy Abstraction-Based Controller Synthesis
[article]
2019
arXiv
pre-print
We present lazy abstraction-based controller synthesis (ABCS) for continuous-time nonlinear dynamical systems against reach-avoid and safety specifications. ...
Lazy ABCS improves this technique by constructing abstractions on demand. ...
Introduction Abstraction-based controller synthesis (ABCS) is a general procedure for automatic synthesis of controllers for continuous-time nonlinear dynamical systems against temporal specifications. ...
arXiv:1804.02722v2
fatcat:i3ftqytwoneinowlblqujoxok4
Safety controller design for incrementally stable switched systems using event-based symbolic models
2019
2019 18th European Control Conference (ECC)
In this paper, we investigate the problem of lazy safety controllers synthesis for event-based symbolic models of incrementally stable switched systems with aperiodic time sampling. ...
Based on this relationship, we prove analytically that the size of the set of controllable states obtained with the lazy safety controller designed for an event-based symbolic model is larger than the ...
the mode of the switched system and the duration during which the mode is active [3] , this section is dedicated to the synthesis of lazy safety controllers for event-based symbolic models. ...
doi:10.23919/ecc.2019.8796232
dblp:conf/eucc/KaderSG19
fatcat:duytksifsrfybfrikndd3aw3ji
Lazy Evaluation In Microsound Synthesis
2016
Proceedings of the SMC Conferences
(Abstract to follow) ...
Based on such considerations, researchers and developers have been investigating alternative software abstractions that are suitable for microsound synthesis. ...
the control flow of the program reaches it 6 " [18, p.322]. ...
doi:10.5281/zenodo.851279
fatcat:y6wzb27ljzapzoei2zjtmhkjve
Safety controller synthesis for switched systems using multi-scale symbolic models
2011
IEEE Conference on Decision and Control and European Control Conference
We present a synthesis algorithm that exploits the specificities of multiscale abstractions. The abstractions are computed on the fly during controller synthesis. ...
We propose a technique for the synthesis of safety controllers for switched systems using multi-scale abstractions. ...
CONTROLLER SYNTHESIS USING MULTI-SCALE ABSTRACTIONS We illustrate the use of multi-scale abstractions for synthesizing safety controllers. ...
doi:10.1109/cdc.2011.6160424
dblp:conf/cdc/CamaraGG11
fatcat:nfmquts2nfazpjods2ihmvkzsm
Efficient Synthesis for Monotone Transition Systems and Directed Safety Specifications*
2019
2019 IEEE 58th Conference on Decision and Control (CDC)
Once this set is computed, controller synthesis is straightforward by exploring different inputs and using their priorities. ...
In this paper, we introduce an efficient algorithm for control policy synthesis for monotone transition systems and lower (upper) safety specifications. ...
INTRODUCTION Abstraction-based synthesis techniques have been an ongoing research area in the last decade (see e.g. [1] , [2] and the references therein). ...
doi:10.1109/cdc40024.2019.9029784
dblp:conf/cdc/SaoudIG19
fatcat:o2gjqox3vfbrrpbc4ufvcdp2da
Lazy Abstraction-Based Control for Safety Specifications
[article]
2019
arXiv
pre-print
We present a lazy version of multi-layered abstraction-based controller synthesis (ABCS) for continuous-time nonlinear dynamical systems against safety specifications. ...
Our new algorithm improves this technique by computing transitions on-the-fly, and only when a particular region of the state space needs to be explored by the controller synthesis algorithm for a specific ...
INTRODUCTION Abstraction-based controller synthesis (ABCS) is a general three-step procedure for automatic synthesis of controllers for non-linear dynamical systems. ...
arXiv:1804.02666v2
fatcat:5fyvrf62bjhcjimixdiad6okrq
CoSyMA
2013
Proceedings of the 16th international conference on Hybrid systems: computation and control - HSCC '13
We introduce CoSyMA, a tool for automatic controller synthesis for incrementally stable switched systems based on multi-scale discrete abstractions. ...
We illustrate by examples the synthesized controllers and the significant performance gains during their computation. ...
We define the maximal lazy timebounded reachability controller based on Definition 2.3 as follows. Definition 2.4. ...
doi:10.1145/2461328.2461343
dblp:conf/hybrid/MouelhiGG13
fatcat:5fildph2i5fhpnpkxfoi2yquyq
BOCoSy: Small but Powerful Symbolic Output-Feedback Control
2022
25th ACM International Conference on Hybrid Systems: Computation and Control
BOCoSy solves this problem by a new lazy abstraction-refinement technique which starts with a very coarse abstraction of the external trace semantics of the given plant and iteratively removes non-admissible ...
behavior from this abstract model until a controller is found. ...
While lazy abstraction-refinement is well understood for discrete synthesis problems under full observation [15] or abstraction-based control design techniques with state-feedback [16] [17] [18] , automatic ...
doi:10.1145/3501710.3519535
fatcat:ot5h2ugqjneoxfnhwbivezpb4u
Fugue: a functional language for sound synthesis
1991
Computer
raditional software synthesis systemswhich include Music V,' cmusic,2 and Csound?are based on the same principles. ...
The interactive language supports behavioral abstraction, so composers can manage complex musical structures. instrument in the orchestra. ...
Clearly, the notion of stretching is abstract, and the software instrument designer must control its implementation. ...
doi:10.1109/2.84834
fatcat:rcouca5vwzbmdoqd4jfdvhtqba
SAFARI: SMT-Based Abstraction for Arrays with Interpolants
[chapter]
2012
Lecture Notes in Computer Science
SAFARI is based on an extension of lazy abstraction capable of handling existentially quantified formulae for symbolically representing states. ...
A heuristics, called term abstraction, favors the convergence of the tool by "tuning" interpolants and guessing additional quantified variables of invariants to prune the search space efficiently. ...
An intrinsic limitation of the approaches based on Lazy Abstraction is that they manipulate quantifier-free formulae to symbolically represent states. ...
doi:10.1007/978-3-642-31424-7_49
fatcat:jvi32v743zhnrkgp3mdabhqsje
Adaptive sliding mode control for MIMO nonlinear systems based on fuzzy logic scheme
2004
International Journal of Automation and Computing
Abstract in meeting abstracts volume, p. 136-137, also in Int. J. Astrobiol. 1 (3), 231, 2002. ...
Harper C and Winfield A, 'Direct Lyapunov Design -A Synthesis Procedure for Motor Schema Using a Second-Order Lyapunov Stability Theorem', Proc. ...
doi:10.1007/s11633-004-0051-4
fatcat:zw5njjptyreohnzqj554j7hnlq
Lazy transition systems and asynchronous circuit synthesis with relative timing assumptions
2002
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
It introduces lazy transitions systems as a new computational model to represent the timing information required for synthesis. ...
The paper presents necessary conditions to generate circuits and a synthesis algorithm that exploits the timing assumptions for optimization. ...
The first gap is between the two main approaches for automated asynchronous controller synthesis, those based on fundamental mode (global timing constraints) and those based on IO mode. ...
doi:10.1109/43.980253
fatcat:obv4tt2jn5gx5dqvtzgh5xky4e
Stepping Lazy Programs
[article]
2011
arXiv
pre-print
It represents a compromise between Launchbury's store-based semantics and a simple, axiomatic description of lazy computation as sharing-via-parameters. ...
Our novel lazy semantics introduces lazy evaluation as a form of parallel program rewriting. ...
Evaluation stops when the control string is a value. Values are numbers, strings, booleans, abstractions, lists, or store locations. Our CS machine transitions are in figure 8. ...
arXiv:1108.4706v1
fatcat:mjtxojqhyrhgteqlyv6eu4vawu
Games and Decisions for Rigorous Systems Engineering (Dagstuhl Seminar 12461)
2013
Dagstuhl Reports
The seminar brought together researchers working in rigorous software engineering, with a special focus on the interaction between synthesis and automated deduction. ...
Using PIA for both data abstraction and a new form of counter abstraction, we reduce the parameterized problem to finite-state model checking. ...
At the center of our technique is a parametric interval abstraction (PIA) where the interval boundaries are arithmetic expressions over parameters. ...
doi:10.4230/dagrep.2.11.45
dblp:journals/dagstuhl-reports/BjornerCKM12
fatcat:gs36midqlvfhzky6v7ebawumtq
Unit-Generator Graph As A Generator Of Lazily Evaluated Audio-Vector Trees
2018
Proceedings of the SMC Conferences
(Abstract to follow) ...
microsound synthesis; yet, this technique is not applicable to unit-generator-based sound synthesis due to the significant difference in abstractions of sound synthesis. ...
and applied to the sound synthesis right at the timing in logical time,
Lazy Evaluation in Sound Synthesis There are not many previous works that utilize lazy evaluation in sound synthesis. ...
doi:10.5281/zenodo.1422660
fatcat:d5e6iw4lofaihcrophyq7e57oy
« Previous
Showing results 1 — 15 out of 6,677 results