Filters








16,790 Hits in 9.6 sec

Synthesis from Weighted Specifications with Partial Domains over Finite Words [article]

Emmanuel Filiot, Christof Löding, Sarah Winter
2021
We establish a landscape of decidability results for these three objectives and weighted specifications with partial domain over finite words given by deterministic weighted automata equipped with sum,  ...  In this paper, we investigate the synthesis problem of terminating reactive systems from quantitative specifications.  ...  Our setting: Partial-domain weighted specifications.  ... 
doi:10.48550/arxiv.2103.05550 fatcat:qwy325l5hvfxnh2ou3taiazmuq

Synthesis from Weighted Specifications with Partial Domains over Finite Words

Emmanuel Filiot, Christof Löding, Sarah Winter, Nitin Saxena, Sunil Simon
2020
We establish a landscape of decidability results for these three objectives and weighted specifications with partial domain over finite words given by deterministic weighted automata equipped with sum,  ...  In this paper, we investigate the synthesis problem of terminating reactive systems from quantitative specifications.  ...  with Partial Domains over Finite Words Lemma 10 .  ... 
doi:10.4230/lipics.fsttcs.2020.46 fatcat:uyef7ao55vgtxnaqfewsialsuq

Synthesis from Weighted Specifications with Partial Domains over Finite Words

Emmanuel Filiot, Christof Löding, Sarah Winter
2020
We establish a landscape of decidability results for these three objectives and weighted specifications with partial domain over finite words given by deterministic weighted automata equipped with sum,  ...  In this paper, we investigate the synthesis problem of terminating reactive systems from quantitative specifications.  ...  with Partial Domains over Finite Words Lemma 10 .  ... 
doi:10.18154/rwth-2021-03036 fatcat:mdetx2bg6bfkpnrxqmli2zyy44

Program Synthesis using Natural Language [article]

Aditya Desai, Sumit Gulwani, Vineet Hingorani, Nidhi Jain, Amey Karkare, Mark Marron, Sailesh R, Subhajit Roy
2015 arXiv   pre-print
End-users struggle with learning and using the myriad of domain-specific languages (DSLs) to effectively accomplish these tasks.  ...  From these it constructs a synthesizer by learning optimal weights and classifiers (using NLP features) that rank the outputs of a keyword-programming based translation.  ...  Introduction Program synthesis is the task of automatically synthesizing a program in some underlying domain-specific language (DSL) from a given specification [10] .  ... 
arXiv:1509.00413v1 fatcat:dpruak5jxnecfljfdzynnakcsu

Program synthesis using natural language

Aditya Desai, Sumit Gulwani, Vineet Hingorani, Nidhi Jain, Amey Karkare, Mark Marron, Sailesh R, Subhajit Roy
2016 Proceedings of the 38th International Conference on Software Engineering - ICSE '16  
End-users struggle with learning and using the myriad of domain-specific languages (DSLs) to effectively accomplish these tasks.  ...  From these it constructs a synthesizer by learning optimal weights and classifiers (using NLP features) that rank the outputs of a keywordprogramming based translation.  ...  INTRODUCTION Program synthesis is the task of automatically synthesizing a program in some underlying domain-specific language (DSL) from a given specification [12] .  ... 
doi:10.1145/2884781.2884786 dblp:conf/icse/DesaiGHJKMRR16 fatcat:sib5iou5gfefbe72znwlumuhqa

Compact Regions for Place/Transition Nets

Robin Bergenthum
2015 Applications and Theory of Petri Nets  
This paper presents compact regions to synthesize a Petri net from a partial language. We synthesize a Petri net using the theory of regions.  ...  Every region defines a valid place where a place is valid if it enables every word of the partial language. The new compact region definition relies on compact tokenflows.  ...  The main steps of a region based synthesis algorithm are: Let there be a language over a set of labels and build a transition for every label.  ... 
dblp:conf/apn/Bergenthum15 fatcat:7bkw33br25hmxcvt3y4wqfm6ce

Optimal Repair For Omega-regular Properties [article]

Vrunda Dave, Shankara Narayanan Krishna, Vishnu Murali, Ashutosh Trivedi
2022 arXiv   pre-print
With a negative result to the impair verification problem, we study the problem of designing a minimal mask of the Kripke structure such that the resulting traces satisfy the specifications despite the  ...  We dub this problem as the mask synthesis problem.  ...  Mask synthesis for Mean-RMs The mask synthesis problem for Mean-RMs is already undecidable for finite words [9, Theorem 17] and this result carries over to the case of ω-words.  ... 
arXiv:2207.13416v1 fatcat:2kxezzunzvftvmv6oiaqon7gke

Embedded and Real-time Systems [chapter]

Edward L. Lamie
2009 Real-Time Embedded Multithreading Using ThreadX  
A secret predicate S over the runs of a system G is opaque to an external user having partial observability over G, if he can never infer from the observation of a run of G that the run belongs to S.  ...  with respect to requirements, properties or higher level specifications. • Control synthesis, which consists in "forcing" (specifications of) systems to behave as desired by coupling them with a supervisor  ... 
doi:10.1016/b978-1-85617-601-9.00001-2 fatcat:oo46lkp3gnbhbjc463pu7fs2hi

Embedded and Real-time Systems [chapter]

Edward L. Lamie
2009 Real-Time Embedded Multithreading Using ThreadX and MIPS  
A secret predicate S over the runs of a system G is opaque to an external user having partial observability over G, if he can never infer from the observation of a run of G that the run belongs to S.  ...  with respect to requirements, properties or higher level specifications. • Control synthesis, which consists in "forcing" (specifications of) systems to behave as desired by coupling them with a supervisor  ... 
doi:10.1016/b978-1-85617-631-6.00001-9 fatcat:sq7s43icwvgk7lro4lpmj46g4a

Coverability: Realizability Lower Bounds [article]

Krishnendu Chatterjee, Nir Piterman
2018 arXiv   pre-print
We consider the case of coverability with no further specifications, where we have to show that the nondeterminism of the produced system is sufficient to produce all the words required in the output language  ...  We then turn to the case of coverability with additional specification and give a precondition for the existence of a system that produces all required words and at the same time produces only computations  ...  The classical approach of synthesis from linear temporal logic specifications only checks that all behaviors of the controlled system satisfy the specification.  ... 
arXiv:1804.03454v1 fatcat:ftc5xv3dufcy5fnpchw5hsemna

Maximum Realizability for Linear Temporal Logic Specifications [article]

Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu
2018 arXiv   pre-print
Automatic synthesis from linear temporal logic (LTL) specifications is widely used in robotic motion planning, control of autonomous systems, and load distribution in power networks.  ...  A common specification pattern in such applications consists of an LTL formula describing the requirements on the behaviour of the system, together with a set of additional desirable properties.  ...  Introduction Automatic synthesis from temporal logic specifications is increasingly becoming a viable alternative for system design in a number of domains such as control and robotics [11, 5] .  ... 
arXiv:1804.00415v1 fatcat:ofmete4uord3rnf5krtccp6b7y

The Complexity of Quantitative Information Flow Problems

Pavol Cerný, Krishnendu Chatterjee, Thomas A. Henzinger
2011 2011 IEEE 24th Computer Security Foundations Symposium  
the original partial program).  ...  The QIF memoryless synthesis problem asks whether it is possible to resolve nondeterministic choices in a given partial program in such a way that in the resulting deterministic program, the quantitative  ...  This work was partially supported by the ERC Advanced Grant QUAREM, the FWF NFN Grant S11402-N23 and S11407-N23 (RiSE), and a Microsoft faculty fellowship.  ... 
doi:10.1109/csf.2011.21 dblp:conf/csfw/CernyCH11 fatcat:uydx3fdnnvdjblrznd6vkzvywu

Towards Domain-specific Model Editors with Automatic Model Completion

Sagar Sen, Benoit Baudry, Hans Vangheluwe
2009 Simulation (San Diego, Calif.)  
We present a methodology to synthesize model editors equipped with automatic completion from a modelling language's declarative specification consisting of a metamodel with a visual syntax.  ...  Taking this idea further, in this paper we present an integrated software system capable of generating recommendations for model completion of partial models built in editors for domain-specific modelling  ...  Once we include this transformation into the synthesis of a domain-specific model editor we are able to synthesize domain-specific model editors with automatic model completion.  ... 
doi:10.1177/0037549709340530 fatcat:fvyf6rkywbdb5j7bhprijgykh4

Reactive Synthesis with Maximum Realizability of Linear Temporal Logic Specifications [article]

Rayna Dimitrova, Mahsa Ghasemi, Ufuk Topcu
2019 arXiv   pre-print
Driven by this fact, we develop an optimization variant of synthesis from LTL formulas, where the goal is to design a controller that satisfies a set of hard specifications and minimally violates a set  ...  Inspired by the idea of bounded synthesis, we fix a bound on the implementation size and search for an implementation that is optimal with respect to the said value function.  ...  Soft specifications with given weights.  ... 
arXiv:1910.02561v1 fatcat:f37z6jrfwne4tfqcd2mbuxjhba

Temporal logic motion planning in unknown environments

A. I. Medina Ayala, S. B. Andersson, C. Belta
2013 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems  
In this paper, we consider a robot motion planning problem from a specification given as a syntactically co-safe linear temporal logic formula over a set of properties known to be satisfied at the regions  ...  The robot is assumed to be equipped with deterministic motion and accurate sensing capabilities. The environment is assumed to be partitioned into a finite number of identical square cells.  ...  The semantics of scLTL formulas are defined over infinite words in 2 Σ .  ... 
doi:10.1109/iros.2013.6697120 dblp:conf/iros/AyalaAB13 fatcat:cdw56b2efvfulpccflnvr5t6xu
« Previous Showing results 1 — 15 out of 16,790 results