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.
Filters
Dynamic multi-objective optimization of battlefield support resources based on Interactive Genetic Algorithm
2019
IOP Conference Series: Materials Science and Engineering
Preserved Fulltext
changed and the original resource support scheme can not meet the needs of wartime support tasks, this paper readjusts the support resources dynamically to ensure the strong support of combat forces, constructs ...
Formula (16) is a constructive constraint on the number of guaranteed resource points. 1 min ( ) ( ) ( ) i iq iq iq iq iq i I q Q f w F t G e =− z (1) 2 , min ( ) max { } kj kj k K j J f d z ...
Formula (2) is used to minimize the transition time of guaranteed resource distribution. Formula (3) denotes the number of guaranteed resource minimize the adjustment position. ...
doi:10.1088/1757-899x/569/5/052054
fatcat:lghx3pj7zvedrpscamkn542xha
Assume-Guarantee Synthesis for Prompt Linear Temporal Logic
2020
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence
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.
environment satisfies a second prompt-LTL formula (the guarantee). ...
We study assume-guarantee synthesis for prompt-LTL: the goal is to construct a system such that for all environments satisfying a first prompt-LTL formula (the assumption) the system composed with this ...
Eve wins in G A,B if and only if there exists a solution to the assume-guarantee synthesis problem. As a tool for proving Theorem 5 we construct another game. ...
doi:10.24963/ijcai.2020/17
dblp:conf/ijcai/FijalkowMMV20
fatcat:uwn7gwnbe5gtjmls6l6nauafke
Compositional Synthesis of Modular Systems (Full Version)
[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.
The certificates then allow for constructing separate requirements for the individual processes. ...
By bounding the size of the certificates, we can bias the synthesis procedure towards solutions that are desirable in the sense that the assumptions between the processes are small. ...
. , ψn i,
where ψi is the LTL formula that captures the exact behavior of si , i.e., the LTL
formula with L(ψi ) = {comp(si , γ) ∪ γ ′ | γ ∈ (2Ii )ω , γ ′ ∈ (2V \Vi )ω }, since we use
this construction ...
arXiv:2106.14783v1
fatcat:fvkgcu457veldjpkbpm5qlojlq
Quantitative Assume Guarantee Synthesis
[chapter]
2017
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 2018; you can also visit the original URL.
The file type is application/pdf.
has an efficient symbolic solution. ...
In assume-guarantee synthesis, we are given a specification A, G , describing an assumption on the environment and a guarantee for the system, and we construct a system that interacts with an environment ...
We relate quantitative assume-guarantee synthesis with the solution of quantitative two-player assume-guarantee games. ...
doi:10.1007/978-3-319-63390-9_19
fatcat:q6ok6myynzbqhkojjjwpobslwi
Temporal Logic Control of Discrete-Time Piecewise Affine Systems
2012
IEEE Transactions on Automatic Control
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.
First, by defining appropriate partitions for its state and input spaces, we construct a finite abstraction of the PWA system in the form of a control transition system. ...
present a computational framework for automatic synthesis of a feedback control strategy for a discrete-time piecewise affine (PWA) system from a specification given as a linear temporal logic (LTL) formula ...
This leads to the language inclusion , which implies that if satisfies an arbitrary LTL formula , then so does , and guarantees the correctness of the solution. ...
doi:10.1109/tac.2011.2178328
fatcat:deuiqn7y7fboxguk24kdm75zqe
Formal analysis of piecewise affine systems through formula-guided refinement
2010
49th IEEE Conference on Decision and Control (CDC)
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.
We derive conditions guaranteeing the equivalence of an infinite system and its finite abstraction with respect to a specific temporal logic formula and propose methods aimed at the construction of such ...
formula-equivalent abstractions. ...
We describe the construction of a formula equivalent finite quotient for T e in Sec. VI, which leads to the solution of Problem 1. ...
doi:10.1109/cdc.2010.5717909
dblp:conf/cdc/YordanovTBCB10
fatcat:jh2stc3jvfdypevby5p6flvmrm
Formal analysis of piecewise affine systems through formula-guided refinement
2013
Automatica
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.
We derive conditions guaranteeing the equivalence of an infinite system and its finite abstraction with respect to a specific LTL formula and propose a method for the construction of such formula-equivalent ...
Our approach is based on the construction and refinement of finite abstractions of infinite systems. ...
exact solution 7 con(X φ T / ∼ ) = X φ T . (3) We formalize the conditions guaranteeing that Eq. (3) holds (an exact solution to Problem 1 is computed) as follows 8
Definition 2. ...
doi:10.1016/j.automatica.2012.09.027
fatcat:kvto5vcw3fhonef6ak44wfzakq
Type-I Topological Logic $\mathbb{C}^{1}_\mathcal{T}$ and Approximate Reasoning
[chapter]
2005
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.
We construct a self-extensive type-I knowledge library and the type-I expert system. ...
We present the concept of the formulae mass, theknowledge mass and the approximating knowledge closure of the knowledge library by means of topological closure. ...
In more exactly words, this construction guarantees that A * → B * is the adhesive formula of {A → B}.
Theorem 1. ...
doi:10.1007/11539506_32
fatcat:j7xwqixxfzcvxdrjck4mri2qam
A recursive construction of particular solutions to a system of coupled linear partial differential equations with polynomial source term
1996
Journal of Computational and Applied Mathematics
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 the case of a system of coupled PDEs this condition can exclude the existence of a recursion formula. ...
., n = 3) has a nonhomogeneous partfthat is a vector of polynomials or can be approximated by a vector of polynomials, a particular solution can be written as a linear combination of particular solutions ...
Fully written out the equation is In the examples in [-5] , the choice of Jo always agrees with the above construction, thus the recursivity is guaranteed for those cases. 04~ ~4~ 04~ c~x4 + 2- + = f ...
doi:10.1016/0377-0427(95)00038-0
fatcat:lnediquswjffzlignwcey7jcje
On approximation algorithms for the minimum satisfiability problem
1996
Information Processing Letters
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.
We consider the following minimum satisfiability (MINSAT) problem: Given a CNF formula, find a truth assignment to the variables that minimizes the number of satisfied clauses. ...
Further, we show that if there is an approximation algorithm with a performance guarantee p for MINSAT, then there is an approximation algorithm with the same performance guarantee p for the minimum vertex ...
We say that a heuristic for a minimization problem II provides a performance guarantee p if the value of the solution produced by the heuristic is at most p times the value of an optimal solution for all ...
doi:10.1016/0020-0190(96)00031-2
fatcat:smi3lqp2qrhvpnz5rp5oyparky
Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts
[article]
2018
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 2019; you can also visit the original URL.
The file type is application/pdf.
Other Versions
If such a fixpoint is found, we construct a witness that is directly translated into an implementation. ...
We propose a novel, completely automated approach to program synthesis which reduces the problem to deciding the validity of a set of forall-exists formulas. ...
Note that the formula ∀𝑥. 𝑆(𝑥) ∧ 𝑅 𝑛 (𝑥) ⇒ ∃𝑦. 𝑇 (𝑥, 𝑦) is valid by construction at any iteration of the algorithm. ...
arXiv:1709.04986v2
fatcat:4bq44mfugndhbeolkvrenus7xe
Validity-Guided Synthesis of Reactive Systems from Assume-Guarantee Contracts
[chapter]
2018
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 2018; you can also visit the original URL.
The file type is application/pdf.
If such a fixpoint is found, we construct a witness that is directly translated into an implementation. ...
We propose a novel, completely automated approach to program synthesis which reduces the problem to deciding the validity of a set of ∀∃-formulas. ...
Note that the formula ∀x. S(x) ∧ R n (x) ⇒ ∃y. T (x, y) is valid by construction at any iteration of the algorithm. ...
doi:10.1007/978-3-319-89963-3_10
fatcat:7ae7juzryfgkvagaxaqpptatly
Concession Period Decision Models for Public Infrastructure Projects Based on Option Games
2015
Mathematical Problems in Engineering
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.
on concession period, and demonstrated those models in the formulas mentioned in the paper. ...
Concession period is an important decision-making variable for the investment and construction of public infrastructure projects. ...
and sharing risks and attain the analytical solutions to the optimal concession period. ...
doi:10.1155/2015/671764
fatcat:iveryw34wbbtdp2x2hald7qeyq
Optimal Observation Mode Scheduling for Systems under Temporal Constraints
[article]
2016
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 2019; you can also visit the original URL.
The file type is application/pdf.
First, we aim to construct a control and observation mode switching strategy that guarantees satisfaction of a finite-time temporal property given as a formula of syntactically co-safe fragment of LTL ...
We present correct and optimal solutions to both problems and demonstrate their usability on a case study motivated by robotic applications. ...
Then the strategy C for the NTS with observation modes constructed according to Eq. 5 is a solution to Problem 1. ...
arXiv:1602.08260v1
fatcat:artfvtxopngz7fxhmxrhfjchei
Language-Guided Controller Synthesis for Linear Systems
2014
IEEE Transactions on Automatic Control
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.
The procedure is based on the iterative construction and refinement of an automaton that enforces the satisfaction of the formula. ...
Extensions to discrete-time piecewise affine systems and specifications given as formulas of full linear temporal logic are included. ...
An important property of scLTL formulas is that, even though they have infinite-time semantics, their satisfaction is guaranteed in finite time. ...
doi:10.1109/tac.2013.2295664
fatcat:p7lwgyst4ngi7idsevyosnsavy
« Previous
Showing results 1 — 15 out of 316,497 results