Sciweavers

483 search results - page 49 / 97
» Linear Ranking with Reachability
Sort
View
APAL
2010
79views more  APAL 2010»
13 years 10 months ago
On lovely pairs of geometric structures
We study the theory of lovely pairs of geometric structures, in particular o-minimal structures. We characterize "linear" theories in terms of properties of the correspon...
Alexander Berenstein, Evgueni Vassiliev
CPC
2006
56views more  CPC 2006»
13 years 10 months ago
Rayleigh Matroids
A Rayleigh matroid is one which satisfies a set of inequalities analogous to the Rayleigh monotonicity property of linear resistive electrical networks. We show that every matroid...
Youngbin Choe, David G. Wagner
JSYML
1998
68views more  JSYML 1998»
13 years 9 months ago
Pseudo-Superstructures as Nonstandard Universes
A definition of nonstandard universe which gets over the limitation to the finite levels of the cumulative hierarchy is proposed. Though necessarily nonwellfounded, nonstandard ...
Mauro Di Nasso
RTSS
1998
IEEE
14 years 2 months ago
Membership Questions for Timed and Hybrid Automata
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan
CADE
2005
Springer
14 years 10 months ago
Temporal Logics over Transitive States
Abstract. We investigate the computational behaviour of `two-dimensional' propositional temporal logics over (N, <) (with and without the next-time operator ?) that are cap...
Boris Konev, Frank Wolter, Michael Zakharyaschev