Sciweavers

495 search results - page 31 / 99
» Automata and differentiable words
Sort
View
ICALP
2000
Springer
13 years 11 months ago
Decidable First-Order Transition Logics for PA-Processes
We show the decidability of model checking PA-processes against several first-order logics based upon the reachability predicate. The main tool for this result is the recognizabil...
Denis Lugiez, Ph. Schnoebelen
LPAR
2010
Springer
13 years 5 months ago
Coping with Selfish On-Going Behaviors
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...
Orna Kupferman, Tami Tamir
JLP
2010
105views more  JLP 2010»
13 years 2 months ago
Quantitative analysis of weighted transition systems
We present a general framework for the analysis of quantitative and qualitative properties of reactive systems, based on a notion of weighted transition systems. We introduce and ...
Claus R. Thrane, Uli Fahrenberg, Kim G. Larsen
LICS
2006
IEEE
14 years 1 months ago
Avoiding Determinization
Automata on infinite objects are extensively used in system specification, verification, and synthesis. While some applications of the automata-theoretic approach have been wel...
Orna Kupferman
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