Filters








20,551 Hits in 3.3 sec

Synthesizing Switching Logic Using Constraint Solving [chapter]

Ankur Taly, Sumit Gulwani, Ashish Tiwari
2008 Lecture Notes in Computer Science  
The generated controlled invariant is then used to arrive at the maximally liberal switching logic.  ...  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.  ...  We present a constraint-based approach, inspired by [7] , to solve the switching logic synthesis problem.  ... 
doi:10.1007/978-3-540-93900-9_25 fatcat:otiswayldjhwrpsk2kokaurpn4

Synthesizing switching logic using constraint solving

Ankur Taly, Sumit Gulwani, Ashish Tiwari
2010 International Journal on Software Tools for Technology Transfer (STTT)  
The generated controlled invariant is then used to arrive at the maximally liberal switching logic.  ...  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.  ...  We present a constraint-based approach, inspired by [7] , to solve the switching logic synthesis problem.  ... 
doi:10.1007/s10009-010-0172-8 fatcat:pnu6bunc4zbjtfuiwo5jwvdq34

A decomposition approach for SMT-based schedule synthesis for time-triggered networks

Francisco Pozo, Wilfried Steiner, Guillermo Rodriguez-Navas, Hans Hansson
2015 2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)  
This paper presents a decomposition approach that will allow us to improve to synthesize schedules with up to two orders of magnitude in terms of the number of constraints that can be handled.  ...  Synthesizing such static schedules is known to be an NP-complete problem where the complexity is driven by the large number of constraints imposed by the network.  ...  We have developed a simple decomposition synthesizer, that without the implementation of application constraints, solves the constraints in different logical contexts enabling a much better scalability  ... 
doi:10.1109/etfa.2015.7301436 dblp:conf/etfa/PozoSRH15 fatcat:oneugy56pnfdhmvenzyljsh54e

SMT-based synthesis of TTEthernet schedules: A performance study

Francisco Pozo, Guillermo Rodriguez-Navas, Hans Hansson, Wilfried Steiner
2015 10th IEEE International Symposium on Industrial Embedded Systems (SIES)  
In the past, specialized solvers have been used for synthesizing time-triggered schedules, but more recently general-purpose tools like Satisfiability Modulo Theories (SMT) solvers have reported synthesis  ...  This paper presents a study identifying and assessing which SMT solver parameters have the highest impact on the performance when synthesizing schedules for time-triggered networks.  ...  The approach to solve schedules with SMT-based solvers has two main steps: add constraints into the logic context of the solver with the function yices assert f ormula() and solve the logic context with  ... 
doi:10.1109/sies.2015.7185055 dblp:conf/sies/PozoRHS15 fatcat:j3x2rpnuyrcs3d4nkq2xbyybau

TACCL: Guiding Collective Algorithm Synthesis using Communication Sketches [article]

Aashaka Shah, Vijay Chidambaram, Meghan Cowan, Saeed Maleki, Madan Musuvathi, Todd Mytkowicz, Jacob Nelson, Olli Saarikivi, Rachee Singh
2022 arXiv   pre-print
We use TACCL to synthesize algorithms for three collectives and two hardware topologies: DGX-2 and NDv2.  ...  TACCL uses the novel communication sketch abstraction to obtain crucial information from the designer that is used to significantly reduce the state space and guide the synthesizer towards better algorithms  ...  Step 1: Routing solves a path for each chunk independent of other chunks. Chunks may be sent at the same time along a link and instead a relaxed bandwidth constraint is used.  ... 
arXiv:2111.04867v3 fatcat:nqfv5rowazd6pfh6dfxrj3ewyi

Synthesis of optimal switching logic for hybrid systems

Susmit Jha, Sanjit A. Seshia, Ashish Tiwari
2011 Proceedings of the ninth ACM international conference on Embedded software - EMSOFT '11  
We formalize and solve the problem of optimal switching logic synthesis for quantitative specifications over long run behavior. Our paper generalizes earlier work on synthesis for safety.  ...  Given a multi-modal dynamical system, optimal switching logic synthesis involves generating conditions for switching between the system modes such that the resulting hybrid system satisfies a quantitative  ...  Purely constraint based approaches for solving switching logic synthesis problem have also being used for reachability specifications [30] .  ... 
doi:10.1145/2038642.2038660 dblp:conf/emsoft/JhaST11 fatcat:mztlrf3tengn3i3ohd7sphx56i

Synthesizing Switching Logic to Minimize Long-Run Cost [article]

Susmit Jha, Sanjit A. Seshia, Ashish Tiwari
2011 arXiv   pre-print
We present an automated technique to synthesize switching logic for such quantitative measures.  ...  We formalize and solve the problem of optimal switching logic synthesis for quantitative specifications over long run behavior.  ...  Purely constraint based approaches for solving switching logic synthesis problem have also being used for reachability specifications [30] .  ... 
arXiv:1103.0800v2 fatcat:kb74pp7zibbh3evot2otliy26y

Sciduction: Combining Induction, Deduction, and Structure for Verification and Synthesis [article]

Sanjit A. Seshia
2012 arXiv   pre-print
Deductive reasoning, which leads from general rules or concepts to conclusions about specific problem instances, includes techniques such as logical inference and constraint solving.  ...  , and inductive reasoning is used to guide the deductive engines.  ...  Acknowledgments This article is a result of ideas synthesized and verified (!) over the last few years in collaboration with several students and colleagues.  ... 
arXiv:1201.0979v1 fatcat:ij726hwu3faytg3knqrmp5trjq

Bounding supply noise induced path delay variation by a relaxation approach

Baohua Wang, P. Mazumder
2006 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (VLSID'06)  
The formulated ILP problem is solved via a relaxation approach, which produces a conservative upper-bound estimation to the worst path delay variation at any iteration.  ...  The proposed model can address various modes of supply noise analysis: function based, two-vector pattern based, or multiple cycle analysis, additionally capable of including user-specified constraints  ...  Experimental Results Relaxation algorithm SLR-opt was tested on ISCAS 85 circuits using a 0.18 µm standard cell library. Layouts of tested circuits were synthesized using a commercial tool.  ... 
doi:10.1109/vlsid.2006.53 dblp:conf/vlsid/WangM06 fatcat:zqggq4o2j5gepgkbwjxwsrqrty

Control of Hybrid Systems. Synthesizing Supervisory Controllers for Hybrid Systems

José E. R. Cury, Bruce H. Krogh
1999 Journal of The Society of Instrument and Control Engineers  
When a solution cannot be found, it is necessary to use engineering judgment to redesign the system so the problem can be solved.  ...  However, to operate systems with more stringent performance constraints and to apply computer control to systems with more complex dynamics, it would be desirable to have a systematic procedure for synthesizing  ... 
doi:10.11499/sicejl1962.38.161 fatcat:qv4iimsxunhpvdpq2jgyrghw6m

Switched Linear Systems Meet Markov Decision Processes: Stability Guaranteed Policy Synthesis [article]

Bo Wu, Murat Cubuktepe, Ufuk Topcu
2019 arXiv   pre-print
We study the problem of synthesizing a policy in an MDP that stabilizes the switched system.  ...  We make use of these stability conditions and propose three different computation approaches to find the stabilizing policy in an MDP.  ...  For future works, we will continue to investigate how to incorporate additional temporal logic constraint on mode switches.  ... 
arXiv:1904.11456v1 fatcat:hpdbqcpkgvcu5caudj5rdwy4ge

Safe Autonomy Under Perception Uncertainty Using Chance-Constrained Temporal Logic

Susmit Jha, Vasumathi Raman, Dorsa Sadigh, Sanjit A. Seshia
2017 Journal of automated reasoning  
We present a novel automated synthesis technique that compiles C2TL specification into mixed integer constraints, and uses second-order (quadratic) cone programming to synthesize optimal control of autonomous  ...  We propose a probabilistic extension of temporal logic, named Chance Constrained Temporal Logic (C2TL), that can be used to specify correctness requirements in presence of uncertainty.  ...  Our constraint-solving based formulation of synthesizing optimal control accomplishes this without any explicit convex hull approximation.  ... 
doi:10.1007/s10817-017-9413-9 fatcat:wfb2bqprcbhd5k6iapjb3yiddm

Sciduction

Sanjit A. Seshia
2012 Proceedings of the 49th Annual Design Automation Conference on - DAC '12  
In this position paper, we contend that these challenges can be tackled by integrating traditional, deductive methods with inductive inference (learning from examples) using hypotheses about system structure  ...  Acknowledgments This article is a result of ideas synthesized and verified (!) over the last few years in collaboration with several students and colleagues.  ...  Synthesizing safe switching logic is therefore undecidable too, unless additional assumptions are imposed.  ... 
doi:10.1145/2228360.2228425 dblp:conf/dac/Seshia12 fatcat:otziclzmebemdcllerhtwbknsi

Synthesis of loop-free programs

Sumit Gulwani, Susmit Jha, Ashish Tiwari, Ramarathnam Venkatesan
2012 SIGPLAN notices  
We solve the above component-based synthesis problem using a constraint-based approach that involves first generating a synthesis constraint, and then solving the constraint.  ...  The synthesis constraint is a first-order ∃∀ logic formula whose size is quadratic in the number of components. We present a novel algorithm for solving such constraints.  ...  Counterexamples have been used in incremental synthesis of programs [33, 17] and switching logic for hybrid systems [20] .  ... 
doi:10.1145/2345156.1993506 fatcat:tnzqu4rcsffixn2azukqk66nuy

Temporal logic control of switched affine systems with an application in fuel balancing

P. Nilsson, N. Ozay, U. Topcu, R. M. Murray
2012 2012 American Control Conference (ACC)  
An aircraft fuel system example is formulated; and solved using the proposed method.  ...  We consider the problem of synthesizing hierarchical controllers for discrete-time switched affine systems subject to exogenous disturbances that guarantee that the trajectories of the system satisfy a  ...  To build the controllers we use The Temporal Logic Planning (TuLiP) Toolbox [23] , a software package that is designed to synthesize controllers using the presented method, including an interface to JTLV  ... 
doi:10.1109/acc.2012.6315141 fatcat:p7hql24g5jay3oreprckmvd72i
« Previous Showing results 1 — 15 out of 20,551 results