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.
Filters
Size-Change Termination and Satisfiability for Linear-Time Temporal Logics
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
Thus, the typical decision problems for such linear-time temporal logics reduce relatively simply to the emptiness problem for alternating parity automata. ...
In the automata-theoretic framework, finite-state automata are used as a machine model to capture the operational content of temporal logics. ...
PSL extends LTL with tools from the domain of formal languages, namely semi-extended regular expressions. ...
doi:10.1007/978-3-642-24364-6_3
fatcat:qktjgpig2rc4tl6mvcvkhs2pvm
PHENOMENOLOGY OF RETAINED REFRACTORINESS: ON SEMI-MEMRISTIVE DISCRETE MEDIA
2012
International Journal of Bifurcation and Chaos in Applied Sciences and Engineering
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
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:
2011 pre-print arXiv:1111.3525v1 fatcat:sztcxiekp5hn3c4gijrjpfskjq
We present phenomenological classification of the automata behaviour for all possible excitation intervals and recovery intervals. ...
The model is an excitable cellular automaton abstraction of a spatially extended semi-memristive medium where a cell's resting state symbolises low-resistance and refractory state high-resistance. ...
Automata from C 1 , C 3 and C 4 show rather quasi-chaotic response to spatially extended random excitation, and this is the reason for their high morphological diversity. ...
doi:10.1142/s0218127412300364
fatcat:y5phmntvsreenpqdvuyeqf4leu
A timed automaton model for ET-LOTOS verification
[chapter]
1997
Formal Description Techniques and Protocol Specification, Testing and Verification
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.
This extension is currently used to define the timed semantics of t he future ISO standard E-LOTOS (for Extended LOTOS) . ...
We show that this subclass is equivalent to timed automata and we show that this model can be used for ET-LOTOS verification. ...
This tool implements a semi-decision procedure for the reachability analysis of hybrid automata. ...
doi:10.1007/978-0-387-35271-8_12
fatcat:bwzb4olukjcxdmvvqslv4e5k5y
Two-Way Parikh Automata
2019
Foundations of Software Technology and 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 2020; you can also visit the original URL.
The file type is application/pdf.
Parikh automata extend automata with counters whose values can only be tested at the end of the computation, with respect to membership into a semi-linear set. ...
More interestingly, it is also known that, while they strictly extend the expressive power of DPA, unambiguous PA (UPA) are (non-trivially) closed under complement (as well as union and intersection) [ ...
Parikh automata strictly extend the expressive power of finite automata. ...
doi:10.4230/lipics.fsttcs.2019.40
dblp:conf/fsttcs/FiliotGM19
fatcat:qgr3gco5krd4fkygrl22xccwrq
Two-Way Parikh Automata with a Visibly Pushdown Stack
[chapter]
2019
Green Chemistry and Sustainable Technology
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 finally give applications to decision problems for expressive transducer models from nested words to words, including the equivalence problem. ...
In this paper, we investigate the complexity of the emptiness problem for Parikh automata equipped with a pushdown stack. ...
Parikh automata extend finite automata with counter operations and an acceptance condition given as a semi-linear set, pushdown Parikh automata extend pushdown automata in the same way. ...
doi:10.1007/978-3-030-17127-8_11
dblp:conf/fossacs/DartoisFT19
fatcat:ux3ozqxv3zcofaxodgyualgn5q
Regular Linear Temporal Logic with Past
[chapter]
2010
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 2011; you can also visit the original URL.
The file type is application/pdf.
RLTL is a temporal logic that extends the expressive power of linear temporal logic (LTL) to all ω-regular languages. ...
This result is shown using a novel linear size translation of RLTL expressions into 2-way alternating parity automata on words. ...
We wish to thank the anonymous reviewers for their helpful comments and suggestions. ...
doi:10.1007/978-3-642-11319-2_22
fatcat:r5atariepjdctdw4xo3xztp5la
Page 5648 of Mathematical Reviews Vol. , Issue 2004g
[page]
2004
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Summary: “We present a semi-incremental algorithm for con- structing minimal acyclic deterministic finite automata. ...
: natural expression of self-reproduction. ...
In the Maze of Data Languages
[article]
2012
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 data languages the positions of strings and trees carry a label from a finite alphabet and a data value from an infinite alphabet. ...
Extensions of automata and logics over finite alphabets have been defined to recognize data languages, both in the string and tree cases. ...
We write dom`pwq for the extended set t0, . . . , |v|`1u of positions. We extend the val w p¨q function in the natural way: val w p0q " and val w p|v|`1q " . ...
arXiv:1208.5980v1
fatcat:zur4mgkwqbep5a3nfkieh5vzvu
Decidable Weighted Expressions with Presburger Combinators
[article]
2017
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.
We show that important decision problems such as emptiness, universality and comparison are PSpace-c for these expressions. We then investigate the extension of these expressions with Kleene star. ...
First, we consider a slight extension of an expression formalism, introduced by Chatterjee. et. al. in the context of infinite words, by which to combine values given by unambiguous (max,+)-automata, using ...
Acknowledgements We are very grateful to Ismaël Jecker and Nathan Lhote for fruitful discussions on this work, and for their help in establishing the undecidability result. ...
arXiv:1706.08855v1
fatcat:qh4gdmlaqrbsrctw7g6bchccqy
Decidable Weighted Expressions with Presburger Combinators
[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 2019; you can also visit the original URL.
The file type is application/pdf.
We show that important decision problems such as emptiness, universality and comparison are PSPACE-C for these expressions. We then investigate the extension of these expressions with Kleene star. ...
First, we consider a slight extension of an expression formalism, introduced by Chatterjee. et. al. in the context of infinite words, by which to combine values given by unambiguous (max, +)-automata, ...
Acknowledgements We are very grateful to Ismaël Jecker and Nathan Lhote for fruitful discussions on this work, and for their help in establishing the undecidability result. ...
doi:10.1007/978-3-662-55751-8_20
fatcat:pyz54egixfhodpusybhukbpvka
A Web odyssey
2003
SIGMOD record
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.
What does the age of the Web mean for database the ory? It is a challenge and an opportunity, an exciting journey of rediscovery. These are some notes from the road. ...
For example, it is shown that this fragment of MSO can express FO extended with regular path expressions. ...
Relational calculus can express non-eventually computable queries, but a positive" fragment can be dened that only expresses eventually computable queries. ...
doi:10.1145/776985.776999
fatcat:bnoqb57m4narbanpijq5eeghdi
A Web Odyssey
2001
Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '01
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.
What does the age of the Web mean for database the ory? It is a challenge and an opportunity, an exciting journey of rediscovery. These are some notes from the road. ...
For example, it is shown that this fragment of MSO can express FO extended with regular path expressions. ...
Relational calculus can express non-eventually computable queries, but a positive" fragment can be dened that only expresses eventually computable queries. ...
doi:10.1145/375551.375554
dblp:conf/pods/Vianu01
fatcat:4r527z4hdbelbflp7ijl74edoe
Integer Parameter Synthesis for Timed Automata
[chapter]
2013
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.
In [9], the undecidability proof is extended for parametric timed automata that use only strict inequalities. ...
It is then a challenging issue to define a subclass of parametric timed automata, which retains enough of its expressive power and such that, for both reachability and unavoidability properties, the existence ...
Acknowledgments The authors thank Claude Jard and Enea Zaffanella for the related discussions, as well as an anonymous reviewer from CONCUR'12 for her/his very useful comments. ...
doi:10.1007/978-3-642-36742-7_28
fatcat:3toaihqjfvdrrlswzxudahvhxm
The Many Facets of String Transducers (Invited Talk)
2019
Symposium on Theoretical Aspects of 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.
The last decade brought considerable research around various transducer models, aiming to achieve similar robustness as for automata and languages. ...
We present classical connections between automata, logic and algebra extended to transducers, some genuine definability questions, and review approaches to the equivalence problem. ...
Walukiewicz, for their comments on a draft version of this paper. ...
doi:10.4230/lipics.stacs.2019.2
dblp:conf/stacs/MuschollP19
fatcat:ir6th7r24vfjhlz6clrybdsmfu
Algorithmic Algebraic Model Checking III: Approximate Methods
2006
Electronical Notes 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.
We present computationally efficient techniques for approximate model-checking using bisimulation-partitioning, polyhedra, grids and time discretization for semi-algebraic hybrid systems, and demonstrate ...
how they relate to and extend other existing techniques. ...
This is because the quantified semi-algebraic expression for the successor is relatively simple (polyhedron). ...
doi:10.1016/j.entcs.2005.11.017
fatcat:tspwrhbuijdwvm4kbd3cr6eice
« Previous
Showing results 1 — 15 out of 7,932 results