ML p(r)ior | Compositional Algorithms for Succinct Safety Games

Compositional Algorithms for Succinct Safety Games

2016-02-03
We study the synthesis of circuits for succinct safety specifications given in the AIG format. We show how AIG safety specifications can be decomposed automatically into sub specifications. Then we propose symbolic compositional algorithms to solve the synthesis problem compositionally starting for the sub-specifications. We have evaluated the compositional algorithms on a set of benchmarks including those proposed for the first synthesis competition organised in 2014 by the Synthesis Workshop affiliated to the CAV conference. We show that a large number of benchmarks can be decomposed automatically and solved more efficiently with the compositional algorithms that we propose in this paper.
PDF

Highlights - Most important sentences from the article

Login to like/save this paper, take notes and configure your recommendations

Related Articles

2018-01-07
1801.02124 | stat.ML

This paper considers the problem of inverse reinforcement learning in zero-sum stochastic games when… show more
PDF

Highlights - Most important sentences from the article

2019-01-11

We describe an approximate dynamic programming approach to compute lower bounds on the optimal value… show more
PDF

Highlights - Most important sentences from the article

2015-09-18

In this paper, we introduce an SMT-based method that automatically synthesizes a distributed self-st… show more
PDF

Highlights - Most important sentences from the article

2018-03-05

This paper considers parametric Markov decision processes (pMDPs) whose transitions are equipped wit… show more
PDF

Highlights - Most important sentences from the article

2018-11-15
1811.06503 | cs.GT

Computing Nash equilibria for strategic multi-agent systems is challenging for expensive black box s… show more
PDF

Highlights - Most important sentences from the article

2016-12-23
1612.08070 | quant-ph

Understanding quantum speed-up over classical computing is fundamental for the development of effici… show more
PDF

Highlights - Most important sentences from the article

2018-01-16
1801.05079 | cs.CC

The one way function based on the Collatz problem is proposed. It is based on the problem's conditio… show more
PDF

Highlights - Most important sentences from the article

2018-07-24
1807.08970 | quant-ph

Suppose we have a small quantum computer with only M qubits. Can such a device genuinely speed up ce… show more
PDF

Highlights - Most important sentences from the article

2017-05-23

LTLf synthesis is the process of finding a strategy that satisfies a linear temporal specification o… show more
PDF

Highlights - Most important sentences from the article

2013-04-21

Consider a complete communication network on $n$ nodes, each of which is a state machine. In synchro… show more
PDF

Highlights - Most important sentences from the article

2019-06-12
1906.05224 | cs.GT

The idea of approximating the Shapley value of an n-person game by random sampling was introduced by… show more
PDF

Highlights - Most important sentences from the article

2017-10-26

In this paper, we consider online algorithms. Typically the model is investigated with respect to co… show more
PDF

Highlights - Most important sentences from the article

2012-07-03
1207.0560 | cs.DS

We extend the work of Narasimhan and Bilmes [30] for minimizing set functions representable as a dif… show more
PDF

Highlights - Most important sentences from the article

2013-11-06
1311.1338 | cs.DS

The experimental analysis of meta-heuristic algorithm performance is usually based on comparing aver… show more
PDF

Highlights - Most important sentences from the article

2019-03-29

The synthesis - the automatic construction - of reactive systems from linear temporal logic (LTL) sp… show more
PDF

Highlights - Most important sentences from the article

2016-07-01

We consider the fixed-delay synthesis problem for continuous-time Markov chains extended with fixed-… show more
PDF

Highlights - Most important sentences from the article