Filters








284,591 Hits in 5.6 sec

Environment Assumptions for Synthesis [chapter]

Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann
2008 Lecture Notes in Computer Science  
A common reason for unrealizability is that assumptions on the environment of the system are incomplete.  ...  Our aim is to construct an assumption ψ that constrains only the environment and is as weak as possible. We present a two-step algorithm for computing assumptions.  ...  The authors thank Rupak Majumdar for stimulating and fruitful discussions.  ... 
doi:10.1007/978-3-540-85361-9_14 fatcat:wshathssiban3bttmlpsrp3zcy

Environment Assumptions for Synthesis [article]

Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann
2008 arXiv   pre-print
A common reason for unrealizability is that assumptions on the environment of the system are incomplete.  ...  Our aim is to construct an assumption ψ that constrains only the environment and is as weak as possible. We present a two-step algorithm for computing assumptions.  ...  The probabilistic games are not needed for synthesis, but we will use them for constructing environment assumptions.  ... 
arXiv:0805.4167v1 fatcat:ihtnqw3p6neg5cr2pbh7fc65li

Planning and Synthesis Under Assumptions [article]

Benjamin Aminof, Giuseppe De Giacomo, Aniello Murano, Sasha Rubin
2019 arXiv   pre-print
For such assumptions, we study how to do synthesis/planning for agent goals, ranging from a classical reachability to goal on traces specified in \LTL and \LTLf/\LDLf, characterizing the problem both mathematically  ...  In this paper we study this form of synthesis in detail. We consider assumptions as constraints on the possible strategies that the environment can have in order to respond to the agent's actions.  ...  In particular, for Ω to be non-empty (as required for it to be an environment assumption) we must have that ω is environment realizable. Definition 4 (Synthesis under Assumptions -linear-time). 1.  ... 
arXiv:1807.06777v2 fatcat:iwbvuvypfnc3hiobqogb6m3vhi

How to Handle Assumptions in Synthesis

Roderick Bloem, Rüdiger Ehlers, Swen Jacobs, Robert Könighofer
2014 Electronic Proceedings in Theoretical Computer Science  
In this paper, we discuss the question of how to deal with assumptions on environment behavior.  ...  The increased interest in reactive synthesis over the last decade has led to many improved solutions but also to many new questions.  ...  Standard Synthesis In standard synthesis, the environment is treated as an adversary, i.e., synthesized systems must be correct for any possible behavior of the environment.  ... 
doi:10.4204/eptcs.157.7 fatcat:ulztbhnxvjcoxhzsnzooixkt3q

On well-separation of GR(1) specifications

Shahar Maoz, Jan Oliver Ringert
2016 Proceedings of the 2016 24th ACM SIGSOFT International Symposium on Foundations of Software Engineering - FSE 2016  
Specifications for reactive synthesis, an automated procedure to obtain a correct-by-construction reactive system, consist of assumptions and guarantees.  ...  One way a controller may satisfy the specification is by preventing the environment from satisfying the assumptions, without satisfying the guarantees.  ...  We have implemented this approach in our synthesis environment as an extension of [20] for assumption traceability.  ... 
doi:10.1145/2950290.2950300 dblp:conf/sigsoft/MaozR16 fatcat:u67occrfzngo5g3fxs3qrvuoea

LTLƒ Synthesis with Fairness and Stability Assumptions

Shufang Zhu, Giuseppe De Giacomo, Geguang Pu, Moshe Y. Vardi
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
In synthesis, assumptions are constraints on the environment that rule out certain environment behaviors.  ...  for LTLƒ synthesis.  ...  Work supported in part by European 4 We recommend viewing the figures online for a better vision.  ... 
doi:10.1609/aaai.v34i03.5704 fatcat:bee2tylzyrf6tlgt7pzksm5wem

LTLf Synthesis with Fairness and Stability Assumptions [article]

Shufang Zhu, Giuseppe De Giacomo, Geguang Pu, Moshe Vardi
2019 arXiv   pre-print
In synthesis, assumptions are constraints on the environment that rule out certain environment behaviors.  ...  for LTLf synthesis.  ...  First, planning for LTL f goals can be considered as a form of LTL f synthesis under assumptions, where the assumptions are the dynamics of the environment encoded in the planning domain (Green 1969;  ... 
arXiv:1912.07804v1 fatcat:5vpuwabnbfhsnhrkgekfb2cyi4

Two-Stage Technique for LTLf Synthesis Under LTL Assumptions

Giuseppe De Giacomo, Antonio Di Stasio, Moshe Y. Vardi, Shufang Zhu
2020 Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning  
In synthesis, assumption are constraints on the environments that rule out certain environment behaviors.  ...  Unfortunately, while synthesis in LTLf and in LTL have the same worst-case complexity (both are 2EXPTIME-complete), the algorithms available for LTL synthesis are much harder in practice than those for  ...  The agent has to realize its task Goal only on those traces that satisfy the assumption Env on the environment. It is of interest to study synthesis under assumptions for LTL f goals.  ... 
doi:10.24963/kr.2020/31 dblp:conf/kr/GiacomoSVZ20 fatcat:ir4y2ihxifcvzlqe3lh5rcssj4

Gist: A Solver for Probabilistic Games [chapter]

Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Arjun Radhakrishna
2010 Lecture Notes in Computer Science  
environment assumptions for unrealizable specifications.  ...  Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable  ...  Environment assumptions for synthesis. Our tool implements a two-step algorithm for computing the environment assumptions as presented in [2] .  ... 
doi:10.1007/978-3-642-14295-6_57 fatcat:fgor2uhdlrcw7ngv2utv7lqtmu

Assume-Guarantee Scenarios: Semantics and Synthesis [chapter]

Shahar Maoz, Yaniv Sa'ar
2012 Lecture Notes in Computer Science  
entities and with support not only for safety and liveness system guarantees but also for safety and liveness environment assumptions.  ...  The behavior of open reactive systems is best described in an assume-guarantee style specification: a system guarantees certain prescribed behavior provided that its environment follows certain given assumptions  ...  However, closed synthesis does not support environment assumptions.  ... 
doi:10.1007/978-3-642-33666-9_22 fatcat:n7g75ylzerhfhgu6msw5nzwgmu

GIST: A Solver for Probabilistic Games [article]

Krishnendu Chatterjee, Thomas A. Henzinger, Barbara Jobstmann, Arjun Radhakrishna
2010 arXiv   pre-print
environment assumptions for unrealizable specifications.  ...  Gist is a tool that (a) solves the qualitative analysis problem of turn-based probabilistic games with ω-regular objectives; and (b) synthesizes reasonable environment assumptions for synthesis of unrealizable  ...  Environment assumptions for synthesis. Our tool implements a two-step algorithm for computing the environment assumptions as presented in [3] .  ... 
arXiv:1004.2367v1 fatcat:2typwnm52fairfz7v2qmn5zhgq

Synthesis of live behaviour models for fallible domains

Nicolás D'Ippolito, Victor Braberman, Nir Piterman, Sebastián Uchitel
2011 Proceeding of the 33rd international conference on Software engineering - ICSE '11  
We revisit synthesis of live controllers for event-based operational models.  ...  Furthermore, for environments that satisfy these conditions and have an underlying probabilistic behaviour, the measure of traces that satisfy our fairness condition is 1, giving a characterisation of  ...  We now present a technique for synthesising controllers even when their environment exhibits failures.  ... 
doi:10.1145/1985793.1985823 dblp:conf/icse/DIppolitoBPU11 fatcat:atpkiq6nkne3fj7qlou2bi5fxi

Mining assumptions for synthesis

Wenchao Li, Lili Dworkin, Sanjit A. Seshia
2011 Ninth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMPCODE2011)  
In several instances, specifications are found unrealizable as a result of insufficient environmental assumptions.  ...  We present an approach to this problem for synthesis from LTL based on specification mining.  ...  Their work can synthesize general environment assumptions (as an intersection of safety and liveness assumptions [4] ) for any LTL synthesis problem.  ... 
doi:10.1109/memcod.2011.5970509 dblp:conf/memocode/LiDS11 fatcat:rttr6zrfajga3j2zmht5pgntry

Low-Effort Specification Debugging and Analysis

Rüdiger Ehlers, Vasumathi Raman
2014 Electronic Proceedings in Theoretical Computer Science  
Reactive synthesis deals with the automated construction of implementations of reactive systems from their specifications.  ...  In this paper, we provide techniques for report-based specification debugging, wherein salient properties of a specification are analyzed, and the result presented to the user in the form of a report.  ...  Falsifying the (Safety) Assumptions Positions in the synthesis game can be winning for several reasons: either the system can drive the environment into falsifying the assumptions (i.e., ensure that the  ... 
doi:10.4204/eptcs.157.12 fatcat:pqrdqzblpvbrrbfec53m7wz22m

Synthesizing a Lego Forklift Controller in GR(1): A Case Study

Shahar Maoz, Jan Oliver Ringert
2016 Electronic Proceedings in Theoretical Computer Science  
We conducted a case study to learn about the challenges that software engineers may face when using GR(1) synthesis for the development of a reactive robotic system.  ...  Reactive synthesis is an automated procedure to obtain a correct-by-construction reactive system from a given specification.  ...  The context of our case study is the synthesis of software for a robotic system. Synthesis is limited to a single controller that interacts with its environment.  ... 
doi:10.4204/eptcs.202.5 fatcat:ldqxxpny35clncpgsxodvsunfq
« Previous Showing results 1 — 15 out of 284,591 results