Sciweavers

BIRTHDAY
2008
Springer
13 years 7 months ago
Church's Problem and a Tour through Automata Theory
Abstract. Church's Problem, stated fifty years ago, asks for a finitestate machine that realizes the transformation of an infinite sequence into an infinite sequence such tha...
Wolfgang Thomas
BIRTHDAY
2008
Springer
13 years 7 months ago
Proof Search Tree and Cut Elimination
Grigori Mints
BIRTHDAY
2008
Springer
13 years 7 months ago
Checking Temporal Properties of Discrete, Timed and Continuous Behaviors
We survey some of the problems associated with checking whether a given behavior (a sequence, a Boolean signal or a continuous signal) satisfies a property specified in an appropri...
Oded Maler, Dejan Nickovic, Amir Pnueli
BIRTHDAY
2008
Springer
13 years 7 months ago
Tree Automata over Infinite Alphabets
A number of models of computation on trees labeled with symbols from an infinite alphabet is considered. We study closure and decision properties of each of the models and compare ...
Michael Kaminski, Tony Tan
BIRTHDAY
2008
Springer
13 years 7 months ago
Linear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving add...
Eldar Fischer, Johann A. Makowsky
BIRTHDAY
2008
Springer
13 years 7 months ago
Temporal Verification of Probabilistic Multi-Agent Systems
Abstract. Probabilistic systems of interacting intelligent agents are considered. They have two sources of uncertainty: uncertainty of communication channels and uncertainty of act...
Michael I. Dekhtyar, Alexander Ja. Dikovsky, Mars ...
BIRTHDAY
2008
Springer
13 years 7 months ago
From Domain to Requirements
This is a discursive paper. That is, it shows some formulas (but only as examples so that the reader may be convinced that there is, perhaps, some substance to our claims), no theo...
Dines Bjørner
BIRTHDAY
2008
Springer
13 years 7 months ago
A Category of Explicit Fusions
Name passing calculi are nowadays an established field on its own. Besides their practical relevance, they offered an intriguing challenge, since the standard operational, denotati...
Filippo Bonchi, Maria Grazia Buscemi, Vincenzo Cia...
BIRTHDAY
2008
Springer
13 years 7 months ago
Some Results on the Expressive Power and Complexity of LSCs
Abstract. We survey some of the main results regarding the complexity and expressive power of Live Sequence Charts (LSCs). We first describe the two main semantics given to LSCs: a...
David Harel, Shahar Maoz, Itai Segall