Sciweavers

46 search results - page 7 / 10
» Strategical languages of infinite words
Sort
View
JUCS
2002
90views more  JUCS 2002»
13 years 7 months ago
How Large is the Set of Disjunctive Sequences?
: We consider disjunctive sequences, that is, infinite sequences (-words) having all finite words as infixes. It is shown that the set of all disjunctive sequences can be described...
Ludwig Staiger
JAPLL
2006
90views more  JAPLL 2006»
13 years 7 months ago
Definability and decidability of binary predicates for time granularity
In this paper we study the definability and decidability of binary predicates for time granularity in monadic languages interpreted over finitely and infinitely layered structures...
Massimo Franceschet, Angelo Montanari, Adriano Per...
ACSD
2010
IEEE
222views Hardware» more  ACSD 2010»
13 years 5 months ago
Efficient Model Checking of PSL Safety Properties
Abstract--Safety properties are an important class of properties as in the industrial use of model checking a large majority of the properties to be checked are safety properties. ...
Tuomas Launiainen, Keijo Heljanko, Tommi A. Juntti...
ESOP
2008
Springer
13 years 9 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
CLIMA
2010
13 years 9 months ago
Exploring the Boundary of Half Positionality
Half positionality is the property of a language of infinite words to admit positional winning strategies, when interpreted as the goal of a two-player game on a graph. Such proble...
Alessandro Bianco, Marco Faella, Fabio Mogavero, A...