Sciweavers

2465 search results - page 26 / 493
» Automata on Linear Orderings
Sort
View
IANDC
2007
133views more  IANDC 2007»
13 years 7 months ago
On decidability of monadic logic of order over the naturals extended by monadic predicates
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
Alexander Rabinovich
CSL
2006
Springer
13 years 11 months ago
Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
Abstract. Expansions of the natural number ordering by unary predicates are studied, using logics which in expressive power are located between first-order and monadic second-order...
Alexander Moshe Rabinovich, Wolfgang Thomas
FOSSACS
2005
Springer
14 years 1 months ago
Third-Order Idealized Algol with Iteration Is Decidable
The problems of contextual equivalence and approximation are studied for the third-order fragment of Idealized Algol with iteration (IA∗ 3). They are approached via a combination...
Andrzej S. Murawski, Igor Walukiewicz
FSTTCS
2004
Springer
14 years 1 months ago
Who is Pointing When to Whom?
This paper introduces an extension of linear temporal logic that allows to express properties about systems that are composed of entities (like objects) that can refer to each othe...
Dino Distefano, Joost-Pieter Katoen, Arend Rensink
FUIN
2008
92views more  FUIN 2008»
13 years 7 months ago
Translation of Timed Promela to Timed Automata with Discrete Data
The aim of the work is twofold. In order to face the problem of modeling time constraints in Promela, a timed extension of the language is presented. Next, timed Promela is transla...
Wojciech Nabialek, Agata Janowska, Pawel Janowski