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.
Filters
Synthesizing Computable Functions from Rational Specifications over Infinite Words
[article]
2021
arXiv
pre-print
Preserved Fulltext
Other Versions
In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing computability notion over infinite inputs. ...
We prove that the synthesis problem of computable functions from rational specifications is undecidable. ...
In this paper, our goal is to synthesize, from specifications which are semantically binary relations of infinite words, stream-processing programs, which are semantically streaming computable functions ...
arXiv:2103.05674v3
fatcat:q5p5rnhct5cqpa3mwz2a5evqqu
Synthesizing Computable Functions from Rational Specifications over Infinite Words
2021
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 2022; you can also visit the original URL.
The file type is application/pdf.
In this paper, we consider the synthesis of computable functions of infinite words, for a classical Turing computability notion over infinite inputs. ...
We prove that the synthesis problem of computable functions from rational specifications is undecidable. ...
F S T T C S 2 0 2 1
43:12 Synthesizing Computable Functions from Rational Specifications over Infinite Words Proof sketch. Two-player ω-regular games are decidable (see, e.g., [16] ). ...
doi:10.4230/lipics.fsttcs.2021.43
fatcat:x3ryiem3srcjrbl24hf6hkub4y
Synthesis of Computable Regular Functions of Infinite Words
2020
International Conference on Concurrency Theory
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.
Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming ω-string transducers as well as deterministic two-way transducers with look-ahead. ...
is, synthesize a Turing machine computing it. ...
Our result on rational functions has been extended recently to rational functions of infinite words over an infinite alphabet in [12] . ...
doi:10.4230/lipics.concur.2020.43
dblp:conf/concur/DaveFKL20
fatcat:dqlhdiqfjjh33olaba5kypewve
Recent Challenges and Ideas in Temporal Synthesis
[chapter]
2012
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 2017; you can also visit the original URL.
The file type is application/pdf.
This has to do with theoretical limitations, like the complexity of the problem, algorithmic limitations, like the need to determinize automata on infinite words and solve parity games, methodological ...
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification against all environments. ...
The strategy f T generates computations over the set I ∪ O of signals. ...
doi:10.1007/978-3-642-27660-6_8
fatcat:dphuat2tk5ds3bd637h3xibxmq
The synthesis of Petri nets from path-automatic specifications
2004
Information and Computation
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.
Path-automatic specifications are rational presentations of sets of finite or infinite graphs. A specification is made of a regular set of paths and rational relations on this set. ...
We show that it is decidable whether some model of a path-automatic specification may be realized by some finite Petri net with transitions in bijection with the specified actions. ...
relations used in path-automatic specifications to be asynchronous. ...
doi:10.1016/j.ic.2004.04.004
fatcat:hllpjgblkrc6hciai4v5ufyvvq
Synthesis of Computable Regular Functions of Infinite Words
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2022 pre-print arXiv:1906.04199v4 fatcat:77dps3nd7neebj57llrn4w5ktyOther Versions
Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming ω-string transducers as well as deterministic two-way transducers with look-ahead. ...
is, synthesize a Turing machine computing it. ...
In other words, our goal is to synthesize algorithms from specifications of functions of infinite words. ...
arXiv:1906.04199v5
fatcat:2hxdfmslwndntbkdodu5xkc4gy
Cooperative Reactive Synthesis
[article]
2015
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.
A modern approach to engineering correct-by-construction systems is to synthesize them automatically from formal specifications. ...
We show how to synthesize systems that achieve the highest possible cooperation level for a given specification in Linear Temporal Logic (LTL). ...
The set of finite (infinite) words over Σ is denoted by Σ * (Σ ω ), where ε is the word of length 0. A set L ⊆ Σ ω of infinite words is called a (word) language. ...
arXiv:1507.02531v1
fatcat:ehr6eyy3bnbd7kqu6wosnsf3na
Synthesis of Computable Regular Functions of Infinite Words
2022
Logical Methods 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 2022; you can also visit the original URL.
The file type is application/pdf.
Regular functions from infinite words to infinite words can be equivalently specified by MSO-transducers, streaming $\omega$-string transducers as well as deterministic two-way transducers with look-ahead ...
if it is, synthesize a Turing machine computing it. ...
In other words, our goal is to synthesize algorithms from specifications of functions of infinite words. ...
doi:10.46298/lmcs-18(2:23)2022
fatcat:jzpyaup37japjahpa56h3xb2am
Decidable Synthesis of Programs with Uninterpreted Functions
[chapter]
2020
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 2020; you can also visit the original URL.
The file type is application/pdf.
We identify a decidable synthesis problem for a class of programs of unbounded size with conditionals and iteration that work over infinite data domains. ...
The programs in our class use uninterpreted functions and relations, and abide by a restriction called coherence that was recently identified to yield decidable verification. ...
In this work we use it to synthesize coherent programs that have finitely many variables working over infinite domains endowed with functions and relations. ...
doi:10.1007/978-3-030-53291-8_32
fatcat:hertfunhojfglaq3tgjpxgac64
Symbolic Monitoring against Specifications Parametric in Time and Data
[article]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
In this work, we propose an automata-based formalism to monitor logs in the form of actions associated with time stamps and arbitrarily data values over infinite domains. ...
Monitoring consists in deciding whether a log meets a given specification. ...
The term "Data" refers to the ability to manage logs over infinite domains (apart from timestamps). ...
arXiv:1905.04486v1
fatcat:cs7rla3itrh2pmkf6gcklzeruq
Channel Synthesis Revisited
[chapter]
2014
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 2020; you can also visit the original URL.
The file type is application/pdf.
Investigating the links between channels and the growth of rational sets of words, we give new characterizations for relations with channels. ...
In the particular case where the relation is given as a union of functions, we obtain as a consequence the decidability of the synthesis problem with a linear complexity. ...
For any rational relation R, there exists a rational function f ⊆ R with the same domain. Furthermore, a transducer realizing f can be effectively computed from a transducer realizing R. ...
doi:10.1007/978-3-319-04921-2_12
fatcat:25gp2j6qv5hurkutifo2ucj6lm
Parameterized Synthesis with Safety Properties
[article]
2020
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 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we present a novel learning based approach to the synthesis of reactive controllers for parameterized systems from safety specifications. ...
Despite the simplicity of L*-PSynth it competes well against (and in many cases even outperforms) the state-of-the-art tools for synthesizing parameterized systems. ...
Since we are interested in synthesizing systems from safety specifications, the games we are faced with are so-called safety games [23] . ...
arXiv:2009.13459v1
fatcat:r4y2laxzizeippl37xxqin5fda
Symbolic Monitoring Against Specifications Parametric in Time and Data
[chapter]
2019
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 2020; you can also visit the original URL.
The file type is application/pdf.
In this work, we propose an automata-based formalism to monitor logs in the form of actions associated with time stamps and arbitrarily data values over infinite domains. ...
Monitoring consists in deciding whether a log meets a given specification. ...
The term "Data" refers to the ability to manage logs over infinite domains (apart from timestamps). ...
doi:10.1007/978-3-030-25540-4_30
fatcat:46cypwvetrgzlflhryzpib2cqu
Non-Zero Sum Games for Reactive Synthesis
[chapter]
2016
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.
First, we consider infinite words while they consider finite words. ...
Given a measurable value function Val, we denote by E M (Val) the expected value or expectation of Val over plays in M . In this paper, we focus on the mean-payoff function MP. ...
doi:10.1007/978-3-319-30000-9_1
fatcat:5p2o2ejvkfaung233lastkqux4
The Complexity of Synthesizing Uniform Strategies
2013
Electronic Proceedings in Theoretical 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.
Other Versions
Our framework naturally generalizes many other situations from the literature. ...
We propose a formal language to specify uniformity properties, interpreted over two-player turn-based arenas equipped with a binary relation between plays. ...
Infinite-duration game models have been intensively studied for their applications in computer science [3] and logic [13] . ...
doi:10.4204/eptcs.112.17
fatcat:ivlu6ajcgbdi5ggpmsrozmtfd4
« Previous
Showing results 1 — 15 out of 9,482 results