Sciweavers

228 search results - page 6 / 46
» A Theory of Restrictions for Logics and Automata
Sort
View
CONCUR
2011
Springer
12 years 8 months ago
A Spectrum of Behavioral Relations over LTSs on Probability Distributions
Probabilistic nondeterministic processes are commonly modeled as probabilistic LTSs (PLTSs, a.k.a. probabilistic automata). A number of logical characterizations of the main behavi...
Silvia Crafa, Francesco Ranzato
LICS
1999
IEEE
14 years 26 days ago
First-Order Logic vs. Fixed-Point Logic in Finite Set Theory
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...
Albert Atserias, Phokion G. Kolaitis
HYBRID
2010
Springer
13 years 6 months ago
Timed I/O automata: a complete specification theory for real-time systems
A specification theory combines notions of specifications and implementations with a satisfaction relation, a refinement relation and a set of operators supporting stepwise design...
Alexandre David, Kim G. Larsen, Axel Legay, Ulrik ...
CORR
2008
Springer
141views Education» more  CORR 2008»
13 years 8 months ago
Model checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
Stéphane Demri, Ranko Lazic, Arnaud Sangnie...
CSL
2006
Springer
14 years 8 days 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