Sciweavers

57 search results - page 1 / 12
» Bounded Reachability for Temporal Logic over Constraint Syst...
Sort
View
CORR
2010
Springer
70views Education» more  CORR 2010»
13 years 3 months ago
Bounded Reachability for Temporal Logic over Constraint Systems
Marcello M. Bersani, Achille Frigeri, Angelo Morze...
CORR
2011
Springer
147views Education» more  CORR 2011»
13 years 10 days ago
On Reachability for Hybrid Automata over Bounded Time
This paper investigates the time-bounded version of the reachability problem for hybrid automata. This problem asks whether a given hybrid automaton can reach a given target locat...
Thomas Brihaye, Laurent Doyen, Gilles Geeraerts, J...
SEFM
2009
IEEE
14 years 2 days ago
Right Propositional Neighborhood Logic over Natural Numbers with Integer Constraints for Interval Lengths
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
Davide Bresolin, Valentin Goranko, Angelo Montanar...
CADE
2005
Springer
14 years 5 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
ATVA
2010
Springer
125views Hardware» more  ATVA 2010»
13 years 6 months ago
Using Redundant Constraints for Refinement
Abstract. This paper is concerned with a method for computing reachable sets of linear continuous systems with uncertain input. Such a method is required for verification of hybrid...
Eugene Asarin, Thao Dang, Oded Maler, Romain Testy...