A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Filters
Switching logic synthesis for reachability
2010
Proceedings of the tenth ACM international conference on Embedded software - EMSOFT '10
Preserved Fulltext
The goal is to synthesize the logic for switching between the modes so that the desired reachability property holds. ...
From a constructive proof of controlled reachability, we show how to synthesize the desired switching logic. We show that our synthesis procedure is sound and produces only non-zeno hybrid systems. ...
We thank the referees for their insightful comments. ...
doi:10.1145/1879021.1879025
dblp:conf/emsoft/TalyT10
fatcat:txv7ybhenjhvrnvfbvijpjhahq
Temporal logic control of switched affine systems with an application in fuel balancing
2012
2012 American Control Conference (ACC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our method builds upon recent results on temporal logic planning and embedded controller synthesis. ...
The solution strategy for the game (i.e. the discrete plan) is then implemented at the continuous level by solving finite-horizon optimal control problems that establish reachability between discrete states ...
Leveraging recent results on temporal logic planning and embedded controller synthesis [7] , [8] , [9] , in this paper we present a method for automatic synthesis of controllers for switched affine ...
doi:10.1109/acc.2012.6315141
fatcat:p7hql24g5jay3oreprckmvd72i
Verification of Computer Switching Networks: An Overview
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Logic synthesis techniques have been used successfully for synthesis of the rules for a single switch [42] . ...
To check the reachability between switch a and switch b, [7] first enumerates all the paths that connect a and b. T (.) is iteratively applied to the packet for every switch along the path. ...
doi:10.1007/978-3-642-33386-6_1
fatcat:jyp4ytxq4ralnafeq7yj4h2n64
Optimizing blocks in an SoC using symbolic code-statement reachability analysis
2010
2010 15th Asia and South Pacific Design Automation Conference (ASP-DAC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
Those blocks can then be removed before logic synthesis is performed to produce smaller and more power-efficient final circuits. ...
Our results show that we can optimize designs under different constraints and provide additional flexibility for SoC design flows. ...
Don't-Cares in Logic Synthesis Don't-Cares (DCs) play an important role in the field of logic synthesis because they provide additional flexibility for Boolean reasoning and optimization. ...
doi:10.1109/aspdac.2010.5419784
dblp:conf/aspdac/ChouCK10
fatcat:b5a4zueojzgexacy3p3hachh3a
Constraint Programming for Controller Synthesis
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this paper, we show how the problem of synthesis of a controller for a dynamic system that must satisfy some safety properties, possibly in a non deterministic and partially observable setting, can ...
be modeled as a pure constraint satisfaction problem, by replacing the reachability property by a so-called weak reachability property. ...
We would like to thank Michel Lemaître for his valuable contribution. ...
doi:10.1007/978-3-642-23786-7_10
fatcat:qch4i6czxrbvjl3u2z7ydmycx4
Mode Switching Synthesis for Reachability Specifications
[chapter]
2001
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we define a concept of control modes, and propose a framework for determining the sequence of control modes that will satisfy reachability tasks. ...
Our approach is illustrated on a helicopter example, where we determine the mode switching logic that achieves the high-altitude takeoff task from a hover mode. ...
The authors would like to thank Paulo Tabuada for extremely intense discussions on the subject. ...
doi:10.1007/3-540-45351-2_28
fatcat:dj36fiessfbhrf55moujxgfeaq
Effective synthesis of switching controllers for linear systems
2000
Proceedings of the IEEE
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
In this paper, we suggest a novel methodology for synthesizing switching controllers for continuous and hybrid systems whose dynamics are defined by linear differential equations. ...
We formulate the synthesis problem as finding the conditions upon which a controller should switch the behavior of the system from one "mode" to another in order to avoid a set of bad states and propose ...
ACKNOWLEDGMENT The authors would like to thank an anonymous referee for a thorough reading of the manuscript and for comments which improved significantly the quality of the presentation. ...
doi:10.1109/5.871306
fatcat:f76trcckp5actn26dizzqe5zy4
Synthesizing Switching Logic Using Constraint Solving
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Starting with a multi-modal dynamical system and a safety property, we present a sound technique for synthesizing a switching logic for changing modes so as to preserve the safety property. ...
The generated controlled invariant is then used to arrive at the maximally liberal switching logic. ...
procedure for solving the switching logic synthesis problem. ...
doi:10.1007/978-3-540-93900-9_25
fatcat:otiswayldjhwrpsk2kokaurpn4
Synthesizing switching logic using constraint solving
2010
International Journal on Software Tools for Technology Transfer (STTT)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2009; you can also visit the original URL.
The file type is application/pdf.
Starting with a multi-modal dynamical system and a safety property, we present a sound technique for synthesizing a switching logic for changing modes so as to preserve the safety property. ...
The generated controlled invariant is then used to arrive at the maximally liberal switching logic. ...
procedure for solving the switching logic synthesis problem. ...
doi:10.1007/s10009-010-0172-8
fatcat:pnu6bunc4zbjtfuiwo5jwvdq34
An admissible-behaviour-based analysis of the deadlock in Petri-net controllers
2008
Simulation modelling practice and theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This paper addresses the problem of verifying the discrete control logic that is typically implemented by programmable controllers. ...
The analysis of the simultaneously operated supervisorycontrol-based interlock controller and the Petri-net-based sequential controller is performed with a C-reachability graph. ...
The combined synthesis/verification approach proposed, makes possible a relatively high level of automation of the control synthesis for manufacturing systems. ...
doi:10.1016/j.simpat.2008.04.014
fatcat:dv3qg34t6ffs7acgymribngab4
Genesis: synthesizing forwarding tables in multi-tenant networks
2017
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages - POPL 2017
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Acknowledgments We thank the anonymous reviewers, Nate Foster, Aaron Gember-Jacobson, Raajay Viswanathan and Brent Stephens for their insightful feedback and suggestions. ...
NetKAT is a domain-specific language and logic for specifying and verifying network packet-processing functions for SDN, based on Kleene algebra with tests (KAT). ...
Reachability We first discuss the constraints added to Ψ for reachability policies without waypoints. ...
doi:10.1145/3009837.3009845
fatcat:75gwprmoajfilp5ijrhdd2h5ky
Switching protocol synthesis for temporal logic specifications
2012
2012 American Control Conference (ACC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
By construction, existence of a discrete switching strategy for the discrete synthesis problem guarantees the existence of a continuous switching protocol for the continuous synthesis problem, which can ...
temporal logic. ...
[14] consider a combination of safety and reachability properties. Joint synthesis of switching logics and feedback controllers for stability are studied by Lee and Dullerud [15] . ...
doi:10.1109/acc.2012.6315040
fatcat:5uqyeu4jhjchnkue2g4txogce4
ABC: An Academic Industrial-Strength Verification Tool
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
ABC is a public-domain system for logic synthesis and formal verification of binary logic circuits appearing in synchronous hardware designs. ...
A focus on the synergy of sequential synthesis and sequential verification leads to improvements in both domains. ...
Acknowledgement This work has been supported in part by SRC contracts 1361.001 and 1444.001, NSF grant CCF-0702668, and the industrial sponsors: Abound Logic, Actel, Altera, Atrenta, Calypto, IBM, Intel ...
doi:10.1007/978-3-642-14295-6_5
fatcat:wobetxmdtbbvrlhvn5ihhmqjzu
Switching Controller Synthesis for Delay Hybrid Systems under Perturbations
[article]
2021
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
To the end, a novel method is proposed to synthesize switching controllers based on the computation of differential invariants for continuous evolution and backward reachable sets of discrete jumps with ...
Furthermore, based upon this model we study the robust switching controller synthesis problem such that the controlled delay system is able to satisfy the specified safety properties regardless of perturbations ...
Shenghua Feng for fruitful discussions on this topic, and also thank the anonymous referees for their constructive comments and criticisms that improve this paper very much. ...
arXiv:2103.11565v1
fatcat:qym4sqtwlvghtpdis5e3akzite
Membership-Based Synthesis of Linear Hybrid Automata
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
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.
We solve this membership problem for linear hybrid automata by repeated reachability computations. ...
Therefore the algorithm is well-suited for online and synthesis-in-the-loop applications. ...
The procedure Membership(f, H, ε) solves Problem 4 by computing the reachable switching sets for every path π of length m in H until finding a path π where every reachable switching set P π j for 0 j m ...
doi:10.1007/978-3-030-25540-4_16
fatcat:lpt6pakwz5gu5chmxjnz5qwgmy
« Previous
Showing results 1 — 15 out of 4,638 results