---
_id: '10884'
abstract:
- lang: eng
text: "We revisit the parameterized model checking problem for token-passing systems
and specifications in indexed CTL ∗ \\X. Emerson and Namjoshi (1995, 2003) have
shown that parameterized model checking of indexed CTL ∗ \\X in uni-directional
token rings can be reduced to checking rings up to some cutoff size. Clarke et
al. (2004) have shown a similar result for general topologies and indexed LTL
\\X, provided processes cannot choose the directions for sending or receiving
the token.\r\nWe unify and substantially extend these results by systematically
exploring fragments of indexed CTL ∗ \\X with respect to general topologies.
For each fragment we establish whether a cutoff exists, and for some concrete
topologies, such as rings, cliques and stars, we infer small cutoffs. Finally,
we show that the problem becomes undecidable, and thus no cutoffs exist, if processes
are allowed to choose the directions in which they send or from which they receive
the token."
acknowledgement: "This work was supported by the Austrian Science Fund through grant
P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23);
ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants
PROSEED, ICT12-059, and VRG11-005."
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Benjamin
full_name: Aminof, Benjamin
id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
last_name: Aminof
- first_name: Swen
full_name: Jacobs, Swen
last_name: Jacobs
- first_name: Ayrat
full_name: Khalimov, Ayrat
last_name: Khalimov
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing
systems. In: Verification, Model Checking, and Abstract Interpretation.
Vol 8318. Springer Nature; 2014:262-281. doi:10.1007/978-3-642-54013-4_15'
apa: 'Aminof, B., Jacobs, S., Khalimov, A., & Rubin, S. (2014). Parameterized
model checking of token-passing systems. In Verification, Model Checking, and
Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States:
Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_15'
chicago: Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized
Model Checking of Token-Passing Systems.” In Verification, Model Checking,
and Abstract Interpretation, 8318:262–81. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_15.
ieee: B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking
of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation,
San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.
ista: 'Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking
of token-passing systems. Verification, Model Checking, and Abstract Interpretation.
VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318,
262–281.'
mla: Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.”
Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer
Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.
short: B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking,
and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.
conference:
end_date: 2014-01-21
location: San Diego, CA, United States
name: 'VMCAI: Verifcation, Model Checking, and Abstract Interpretation'
start_date: 2014-01-19
date_created: 2022-03-18T13:01:22Z
date_published: 2014-01-30T00:00:00Z
date_updated: 2025-04-15T06:29:59Z
day: '30'
department:
- _id: KrCh
doi: 10.1007/978-3-642-54013-4_15
ec_funded: 1
external_id:
arxiv:
- '1311.4425'
intvolume: ' 8318'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.1311.4425'
month: '01'
oa: 1
oa_version: Preprint
page: 262-281
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Verification, Model Checking, and Abstract Interpretation
publication_identifier:
eisbn:
- '9783642540134'
eissn:
- 1611-3349
isbn:
- '9783642540127'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Parameterized model checking of token-passing systems
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 8318
year: '2014'
...
---
_id: '475'
abstract:
- lang: eng
text: 'First cycle games (FCG) are played on a finite graph by two players who push
a token along the edges until a vertex is repeated, and a simple cycle is formed.
The winner is determined by some fixed property Y of the sequence of labels of
the edges (or nodes) forming this cycle. These games are traditionally of interest
because of their connection with infinite-duration games such as parity and mean-payoff
games. We study the memory requirements for winning strategies of FCGs and certain
associated infinite duration games. We exhibit a simple FCG that is not memoryless
determined (this corrects a mistake in Memoryless determinacy of parity and mean
payoff games: a simple proof by Bj⋯orklund, Sandberg, Vorobyov (2004) that claims
that FCGs for which Y is closed under cyclic permutations are memoryless determined).
We show that θ (n)! memory (where n is the number of nodes in the graph), which
is always sufficient, may be necessary to win some FCGs. On the other hand, we
identify easy to check conditions on Y (i.e., Y is closed under cyclic permutations,
and both Y and its complement are closed under concatenation) that are sufficient
to ensure that the corresponding FCGs and their associated infinite duration games
are memoryless determined. We demonstrate that many games considered in the literature,
such as mean-payoff, parity, energy, etc., satisfy these conditions. On the complexity
side, we show (for efficiently computable Y) that while solving FCGs is in PSPACE,
solving some families of FCGs is PSPACE-hard. '
alternative_title:
- EPTCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Benjamin
full_name: Aminof, Benjamin
id: 4A55BD00-F248-11E8-B48F-1D18A9856A87
last_name: Aminof
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Aminof B, Rubin S. First cycle games. In: Electronic Proceedings in Theoretical
Computer Science, EPTCS. Vol 146. Open Publishing Association; 2014:83-90.
doi:10.4204/EPTCS.146.11'
apa: 'Aminof, B., & Rubin, S. (2014). First cycle games. In Electronic Proceedings
in Theoretical Computer Science, EPTCS (Vol. 146, pp. 83–90). Grenoble, France:
Open Publishing Association. https://doi.org/10.4204/EPTCS.146.11'
chicago: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” In Electronic
Proceedings in Theoretical Computer Science, EPTCS, 146:83–90. Open Publishing
Association, 2014. https://doi.org/10.4204/EPTCS.146.11.
ieee: B. Aminof and S. Rubin, “First cycle games,” in Electronic Proceedings
in Theoretical Computer Science, EPTCS, Grenoble, France, 2014, vol. 146,
pp. 83–90.
ista: 'Aminof B, Rubin S. 2014. First cycle games. Electronic Proceedings in Theoretical
Computer Science, EPTCS. SR: Strategic Reasoning, EPTCS, vol. 146, 83–90.'
mla: Aminof, Benjamin, and Sasha Rubin. “First Cycle Games.” Electronic Proceedings
in Theoretical Computer Science, EPTCS, vol. 146, Open Publishing Association,
2014, pp. 83–90, doi:10.4204/EPTCS.146.11.
short: B. Aminof, S. Rubin, in:, Electronic Proceedings in Theoretical Computer
Science, EPTCS, Open Publishing Association, 2014, pp. 83–90.
conference:
end_date: 2014-04-06
location: Grenoble, France
name: 'SR: Strategic Reasoning'
start_date: 2014-04-05
corr_author: '1'
date_created: 2018-12-11T11:46:41Z
date_published: 2014-04-01T00:00:00Z
date_updated: 2025-04-14T13:51:05Z
day: '01'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4204/EPTCS.146.11
ec_funded: 1
external_id:
arxiv:
- '1404.0843'
file:
- access_level: open_access
checksum: 4d7b4ab82980cca2b96ac7703992a8c8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:17:08Z
date_updated: 2020-07-14T12:46:35Z
file_id: '5260'
file_name: IST-2018-952-v1+1_2014_Rubin_First_cycle.pdf
file_size: 100115
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 146'
language:
- iso: eng
month: '04'
oa: 1
oa_version: Published Version
page: 83 - 90
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25F5A88A-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11402-N23
name: Moderne Concurrency Paradigms
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25892FC0-B435-11E9-9278-68D0E5697425
grant_number: ICT15-003
name: Efficient Algorithms for Computer Aided Verification
publication: Electronic Proceedings in Theoretical Computer Science, EPTCS
publication_status: published
publisher: Open Publishing Association
publist_id: '7345'
pubrep_id: '952'
quality_controlled: '1'
scopus_import: '1'
status: public
title: First cycle games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 146
year: '2014'
...
---
_id: '2246'
abstract:
- lang: eng
text: 'Muller games are played by two players moving a token along a graph; the
winner is determined by the set of vertices that occur infinitely often. The central
algorithmic problem is to compute the winning regions for the players. Different
classes and representations of Muller games lead to problems of varying computational
complexity. One such class are parity games; these are of particular significance
in computational complexity, as they remain one of the few combinatorial problems
known to be in NP ∩ co-NP but not known to be in P. We show that winning regions
for a Muller game can be determined from the alternating structure of its traps.
To every Muller game we then associate a natural number that we call its trap
depth; this parameter measures how complicated the trap structure is. We present
algorithms for parity games that run in polynomial time for graphs of bounded
trap depth, and in general run in time exponential in the trap depth. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Andrey
full_name: Grinshpun, Andrey
last_name: Grinshpun
- first_name: Pakawat
full_name: Phalitnonkiat, Pakawat
last_name: Phalitnonkiat
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
- first_name: Andrei
full_name: Tarfulea, Andrei
last_name: Tarfulea
citation:
ama: Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. Alternating traps in Muller
and parity games. Theoretical Computer Science. 2014;521:73-91. doi:10.1016/j.tcs.2013.11.032
apa: Grinshpun, A., Phalitnonkiat, P., Rubin, S., & Tarfulea, A. (2014). Alternating
traps in Muller and parity games. Theoretical Computer Science. Elsevier.
https://doi.org/10.1016/j.tcs.2013.11.032
chicago: Grinshpun, Andrey, Pakawat Phalitnonkiat, Sasha Rubin, and Andrei Tarfulea.
“Alternating Traps in Muller and Parity Games.” Theoretical Computer Science.
Elsevier, 2014. https://doi.org/10.1016/j.tcs.2013.11.032.
ieee: A. Grinshpun, P. Phalitnonkiat, S. Rubin, and A. Tarfulea, “Alternating traps
in Muller and parity games,” Theoretical Computer Science, vol. 521. Elsevier,
pp. 73–91, 2014.
ista: Grinshpun A, Phalitnonkiat P, Rubin S, Tarfulea A. 2014. Alternating traps
in Muller and parity games. Theoretical Computer Science. 521, 73–91.
mla: Grinshpun, Andrey, et al. “Alternating Traps in Muller and Parity Games.” Theoretical
Computer Science, vol. 521, Elsevier, 2014, pp. 73–91, doi:10.1016/j.tcs.2013.11.032.
short: A. Grinshpun, P. Phalitnonkiat, S. Rubin, A. Tarfulea, Theoretical Computer
Science 521 (2014) 73–91.
corr_author: '1'
date_created: 2018-12-11T11:56:33Z
date_published: 2014-02-13T00:00:00Z
date_updated: 2026-04-16T10:08:15Z
day: '13'
department:
- _id: KrCh
doi: 10.1016/j.tcs.2013.11.032
external_id:
arxiv:
- '1303.3777'
isi:
- '000331433100007'
intvolume: ' 521'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://arxiv.org/abs/1303.3777
month: '02'
oa: 1
oa_version: Submitted Version
page: 73 - 91
publication: Theoretical Computer Science
publication_identifier:
issn:
- 0304-3975
publication_status: published
publisher: Elsevier
publist_id: '4703'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Alternating traps in Muller and parity games
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 521
year: '2014'
...
---
_id: '10902'
abstract:
- lang: eng
text: We consider how to edit strings from a source language so that the edited
strings belong to a target language, where the languages are given as deterministic
finite automata. Non-streaming (or offline) transducers perform edits given the
whole source string. We show that the class of deterministic one-pass transducers
with registers along with increment and min operation suffices for computing optimal
edit distance, whereas the same class of transducers without the min operation
is not sufficient. Streaming (or online) transducers perform edits as the letters
of the source string are received. We present a polynomial time algorithm for
the partial-repair problem that given a bound α asks for the construction of a
deterministic streaming transducer (if one exists) that ensures that the ‘maximum
fraction’ η of the strings of the source language are edited, within cost α, to
the target language.
acknowledgement: 'The research was supported by Austrian Science Fund (FWF) Grant
No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE), ERC Start grant (279307: Graph
Games), and Microsoft faculty fellows award. Thanks to Gabriele Puppis for suggesting
the problem of identifying a deterministic transducer to compute the optimal cost,
and to Martin Chmelik for his comments on the introduction.'
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Siddhesh
full_name: Chaubal, Siddhesh
last_name: Chaubal
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Chatterjee K, Chaubal S, Rubin S. How to travel between languages. In: 7th
International Conference on Language and Automata Theory and Applications.
Vol 7810. LNCS. Berlin, Heidelberg: Springer Nature; 2013:214-225. doi:10.1007/978-3-642-37064-9_20'
apa: 'Chatterjee, K., Chaubal, S., & Rubin, S. (2013). How to travel between
languages. In 7th International Conference on Language and Automata Theory
and Applications (Vol. 7810, pp. 214–225). Berlin, Heidelberg: Springer Nature.
https://doi.org/10.1007/978-3-642-37064-9_20'
chicago: 'Chatterjee, Krishnendu, Siddhesh Chaubal, and Sasha Rubin. “How to Travel
between Languages.” In 7th International Conference on Language and Automata
Theory and Applications, 7810:214–25. LNCS. Berlin, Heidelberg: Springer Nature,
2013. https://doi.org/10.1007/978-3-642-37064-9_20.'
ieee: K. Chatterjee, S. Chaubal, and S. Rubin, “How to travel between languages,”
in 7th International Conference on Language and Automata Theory and Applications,
Bilbao, Spain, 2013, vol. 7810, pp. 214–225.
ista: 'Chatterjee K, Chaubal S, Rubin S. 2013. How to travel between languages.
7th International Conference on Language and Automata Theory and Applications.
LATA: Language and Automata Theory and ApplicationsLNCS, LNCS, vol. 7810, 214–225.'
mla: Chatterjee, Krishnendu, et al. “How to Travel between Languages.” 7th International
Conference on Language and Automata Theory and Applications, vol. 7810, Springer
Nature, 2013, pp. 214–25, doi:10.1007/978-3-642-37064-9_20.
short: K. Chatterjee, S. Chaubal, S. Rubin, in:, 7th International Conference on
Language and Automata Theory and Applications, Springer Nature, Berlin, Heidelberg,
2013, pp. 214–225.
conference:
end_date: 2013-04-05
location: Bilbao, Spain
name: 'LATA: Language and Automata Theory and Applications'
start_date: 2013-04-02
corr_author: '1'
date_created: 2022-03-21T07:56:21Z
date_published: 2013-04-15T00:00:00Z
date_updated: 2025-07-10T11:50:03Z
day: '15'
department:
- _id: KrCh
doi: 10.1007/978-3-642-37064-9_20
ec_funded: 1
intvolume: ' 7810'
language:
- iso: eng
month: '04'
oa_version: None
page: 214-225
place: Berlin, Heidelberg
project:
- _id: 2584A770-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P 23499-N23
name: Modern Graph Algorithmic Techniques in Formal Verification
- _id: 25863FF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S11407
name: Game Theory
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 2587B514-B435-11E9-9278-68D0E5697425
name: Microsoft Research Faculty Fellowship
publication: 7th International Conference on Language and Automata Theory and Applications
publication_identifier:
eisbn:
- '9783642370649'
eissn:
- 1611-3349
isbn:
- '9783642370632'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: LNCS
status: public
title: How to travel between languages
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7810
year: '2013'
...
---
_id: '495'
abstract:
- lang: eng
text: An automaton with advice is a finite state automaton which has access to an
additional fixed infinite string called an advice tape. We refine the Myhill-Nerode
theorem to characterize the languages of finite strings that are accepted by automata
with advice. We do the same for tree automata with advice.
alternative_title:
- EPTCS
author:
- first_name: Alex
full_name: Kruckman, Alex
last_name: Kruckman
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
- first_name: John
full_name: Sheridan, John
last_name: Sheridan
- first_name: Ben
full_name: Zax, Ben
last_name: Zax
citation:
ama: 'Kruckman A, Rubin S, Sheridan J, Zax B. A Myhill Nerode theorem for automata
with advice. In: Proceedings GandALF 2012. Vol 96. Open Publishing Association;
2012:238-246. doi:10.4204/EPTCS.96.18'
apa: 'Kruckman, A., Rubin, S., Sheridan, J., & Zax, B. (2012). A Myhill Nerode
theorem for automata with advice. In Proceedings GandALF 2012 (Vol. 96,
pp. 238–246). Napoli, Italy: Open Publishing Association. https://doi.org/10.4204/EPTCS.96.18'
chicago: Kruckman, Alex, Sasha Rubin, John Sheridan, and Ben Zax. “A Myhill Nerode
Theorem for Automata with Advice.” In Proceedings GandALF 2012, 96:238–46.
Open Publishing Association, 2012. https://doi.org/10.4204/EPTCS.96.18.
ieee: A. Kruckman, S. Rubin, J. Sheridan, and B. Zax, “A Myhill Nerode theorem for
automata with advice,” in Proceedings GandALF 2012, Napoli, Italy, 2012,
vol. 96, pp. 238–246.
ista: 'Kruckman A, Rubin S, Sheridan J, Zax B. 2012. A Myhill Nerode theorem for
automata with advice. Proceedings GandALF 2012. GandALF: Games, Automata, Logics
and Formal Verification, EPTCS, vol. 96, 238–246.'
mla: Kruckman, Alex, et al. “A Myhill Nerode Theorem for Automata with Advice.”
Proceedings GandALF 2012, vol. 96, Open Publishing Association, 2012, pp.
238–46, doi:10.4204/EPTCS.96.18.
short: A. Kruckman, S. Rubin, J. Sheridan, B. Zax, in:, Proceedings GandALF 2012,
Open Publishing Association, 2012, pp. 238–246.
conference:
end_date: 2012-09-08
location: Napoli, Italy
name: 'GandALF: Games, Automata, Logics and Formal Verification'
start_date: 2012-09-06
corr_author: '1'
date_created: 2018-12-11T11:46:47Z
date_published: 2012-10-07T00:00:00Z
date_updated: 2024-10-09T20:55:00Z
day: '07'
ddc:
- '004'
department:
- _id: KrCh
doi: 10.4204/EPTCS.96.18
ec_funded: 1
file:
- access_level: open_access
checksum: 56277f95edc9d531fa3bdc5f9579fda8
content_type: application/pdf
creator: system
date_created: 2018-12-12T10:15:31Z
date_updated: 2020-07-14T12:46:35Z
file_id: '5152'
file_name: IST-2018-944-v1+1_2012_Rubin_A_Myhill.pdf
file_size: 97736
relation: main_file
file_date_updated: 2020-07-14T12:46:35Z
has_accepted_license: '1'
intvolume: ' 96'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 238 - 246
project:
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
publication: Proceedings GandALF 2012
publication_status: published
publisher: Open Publishing Association
publist_id: '7325'
pubrep_id: '944'
quality_controlled: '1'
scopus_import: 1
status: public
title: A Myhill Nerode theorem for automata with advice
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 3E5EF7F0-F248-11E8-B48F-1D18A9856A87
volume: 96
year: '2012'
...
---
_id: '496'
abstract:
- lang: eng
text: 'We study the expressive power of logical interpretations on the class of
scattered trees, namely those with countably many infinite branches. Scattered
trees can be thought of as the tree analogue of scattered linear orders. Every
scattered tree has an ordinal rank that reflects the structure of its infinite
branches. We prove, roughly, that trees and orders of large rank cannot be interpreted
in scattered trees of small rank. We consider a quite general notion of interpretation:
each element of the interpreted structure is represented by a set of tuples of
subsets of the interpreting tree. Our trees are countable, not necessarily finitely
branching, and may have finitely many unary predicates as labellings. We also
show how to replace injective set-interpretations in (not necessarily scattered)
trees by ''finitary'' set-interpretations.'
alternative_title:
- LICS
article_number: '6280474'
article_processing_charge: No
author:
- first_name: Alexander
full_name: Rabinovich, Alexander
last_name: Rabinovich
- first_name: Sasha
full_name: Rubin, Sasha
id: 2EC51194-F248-11E8-B48F-1D18A9856A87
last_name: Rubin
citation:
ama: 'Rabinovich A, Rubin S. Interpretations in trees with countably many branches.
In: IEEE; 2012. doi:10.1109/LICS.2012.65'
apa: 'Rabinovich, A., & Rubin, S. (2012). Interpretations in trees with countably
many branches. Presented at the LICS: Logic in Computer Science, Dubrovnik, Croatia:
IEEE. https://doi.org/10.1109/LICS.2012.65'
chicago: Rabinovich, Alexander, and Sasha Rubin. “Interpretations in Trees with
Countably Many Branches.” IEEE, 2012. https://doi.org/10.1109/LICS.2012.65.
ieee: 'A. Rabinovich and S. Rubin, “Interpretations in trees with countably many
branches,” presented at the LICS: Logic in Computer Science, Dubrovnik, Croatia,
2012.'
ista: 'Rabinovich A, Rubin S. 2012. Interpretations in trees with countably many
branches. LICS: Logic in Computer Science, LICS, , 6280474.'
mla: Rabinovich, Alexander, and Sasha Rubin. Interpretations in Trees with Countably
Many Branches. 6280474, IEEE, 2012, doi:10.1109/LICS.2012.65.
short: A. Rabinovich, S. Rubin, in:, IEEE, 2012.
conference:
end_date: 2012-06-28
location: Dubrovnik, Croatia
name: 'LICS: Logic in Computer Science'
start_date: 2012-06-25
date_created: 2018-12-11T11:46:47Z
date_published: 2012-01-01T00:00:00Z
date_updated: 2025-09-30T08:34:47Z
day: '01'
department:
- _id: KrCh
doi: 10.1109/LICS.2012.65
ec_funded: 1
external_id:
isi:
- '000309059900061'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arise.or.at/pubpdf/Interpretations_in_Trees_with_Countably_Many_Branches.pdf
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 2581B60A-B435-11E9-9278-68D0E5697425
call_identifier: FP7
grant_number: '279307'
name: 'Quantitative Graph Games: Theory and Applications'
- _id: 25832EC2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: S 11407_N23
name: Rigorous Systems Engineering
publication_status: published
publisher: IEEE
publist_id: '7324'
quality_controlled: '1'
scopus_import: '1'
status: public
title: Interpretations in trees with countably many branches
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2012'
...