Results 1  10
of
477,259
On (Omega)Regular Model Checking
, 2008
"... Checking infinitestate systems is frequently done by encoding infinite sets of states as regular languages. Computing such a regular representation of, say, the set of reachable states of a system requires acceleration techniques that can finitely compute the effect of an unbounded number of transi ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
Checking infinitestate systems is frequently done by encoding infinite sets of states as regular languages. Computing such a regular representation of, say, the set of reachable states of a system requires acceleration techniques that can finitely compute the effect of an unbounded number
RIGHT CONGRUENCES FOR $\omega$REGULAR LANGUAGES
, 1995
"... Let $\Sigma $ be an alphabet and $\Sigma^{*} $ be a free monoid generated by $\Sigma $. One of the main feature of the study of regular languages (of finite words) over $\Sigma $ is the study of the right congruences (i.e., equivalence relations preserved under the concatenation from right) of $\Sig ..."
Abstract
 Add to MetaCart
Let $\Sigma $ be an alphabet and $\Sigma^{*} $ be a free monoid generated by $\Sigma $. One of the main feature of the study of regular languages (of finite words) over $\Sigma $ is the study of the right congruences (i.e., equivalence relations preserved under the concatenation from right
Quantitative Solution of OmegaRegular Games
"... We consider twoplayer games played for an infinite number of rounds, with ωregular winning conditions. The games may be concurrent, in that the players choose their moves simultaneously and independently, and probabilistic, in that the moves determine a probability distribution for the successor s ..."
Abstract

Cited by 62 (18 self)
 Add to MetaCart
We consider twoplayer games played for an infinite number of rounds, with ωregular winning conditions. The games may be concurrent, in that the players choose their moves simultaneously and independently, and probabilistic, in that the moves determine a probability distribution for the successor
Extending Automated Compositional Verification to the Full Class of OmegaRegular Languages ⋆
"... Abstract. Recent studies have suggested the applicability of learning to automated compositional verification. However, current learning algorithms fall short when it comes to learning liveness properties. We extend the automaton synthesis paradigm for the infinitary languages by presenting an algor ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
an algorithm to learn an arbitrary regular set of infinite sequences (an ωregular language) over an alphabet Σ. Our main result is an algorithm to learn a nondeterministic Büchi automaton that recognizes an unknown ωregular language. This is done by learning a unique projection of it on Σ ∗ using
The C Programming Language
, 1988
"... The C programming language was devised in the early 1970s as a system implementation language for the nascent Unix operating system. Derived from the typeless language BCPL, it evolved a type structure; created on a tiny machine as a tool to improve a meager programming environment, it has become on ..."
Abstract

Cited by 1527 (16 self)
 Add to MetaCart
The C programming language was devised in the early 1970s as a system implementation language for the nascent Unix operating system. Derived from the typeless language BCPL, it evolved a type structure; created on a tiny machine as a tool to improve a meager programming environment, it has become
OmegaRegular Halfpositional Winning Conditions
"... Abstract. We study infinite games where one of the players always has a positional (memoryless) winning strategy, while the other player may use a historydependent strategy. We investigate winning conditions which guarantee such a property for all arenas, or all finite arenas. Our main result is t ..."
Abstract
 Add to MetaCart
is that this property is decidable in single exponential time for a given prefix independent ωregular winning condition. We also exhibit a big class of winning conditions (XPS) which has this property. Key words: automata, infinite games, omegaregular languages, positional strategies, winning condtions 1
The synchronous dataflow programming language LUSTRE
 Proceedings of the IEEE
, 1991
"... This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems  such as automatic control and monitoring systems  as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools in t ..."
Abstract

Cited by 647 (53 self)
 Add to MetaCart
This paper describes the language Lustre, which is a dataflow synchronous language, designed for programming reactive systems  such as automatic control and monitoring systems  as well as for describing hardware. The dataflow aspect of Lustre makes it very close to usual description tools
Semantics of ContextFree Languages
 In Mathematical Systems Theory
, 1968
"... "Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of th ..."
Abstract

Cited by 559 (0 self)
 Add to MetaCart
"Meaning " may be assigned to a string in a contextfree language by defining "attributes " of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods
Concurrent OmegaRegular Games
, 2000
"... We consider twoplayer games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine a successor state. We consider ..."
Abstract

Cited by 43 (12 self)
 Add to MetaCart
omegaregular winning conditions on the resulting infinite state sequence. To model the independent choice of moves, both players are allowed to use randomization for selecting their moves. This gives rise to the following qualitative modes of winning, which can be studied without numerical
Results 1  10
of
477,259