Sciweavers

744 search results - page 28 / 149
» Observations on the Decidability of Transitions
Sort
View
JAPLL
2010
111views more  JAPLL 2010»
13 years 3 months ago
The complexity of satisfiability for fragments of hybrid logic - Part I
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...
Arne Meier, Martin Mundhenk, Thomas Schneider 0002...
CONCUR
2000
Springer
14 years 1 months ago
Weak Bisimulation for Probabilistic Systems
Abstract. In this paper, we introduce weak bisimulation in the framework of Labeled Concurrent Markov Chains, that is, probabilistic transition systems which exhibit both probabili...
Anna Philippou, Insup Lee, Oleg Sokolsky
CONCUR
2009
Springer
14 years 29 days ago
Weak Time Petri Nets Strike Back!
We consider the model of Time Petri Nets where time is associated with transitions. Two semantics for time elapsing can be considered: the strong one, for which all transitions are...
Pierre-Alain Reynier, Arnaud Sangnier
ICPR
2008
IEEE
14 years 10 months ago
Action recognition based on homography constraints
In this paper, we present a new approach for viewinvariant action recognition using constraints derived from the eigenvalues of planar homographies associated with triplets of bod...
Hassan Foroosh, Nazim Ashraf, Yuping Shen
ICCAD
2007
IEEE
105views Hardware» more  ICCAD 2007»
14 years 3 months ago
Victim alignment in crosstalk aware timing analysis
Modeling the effect of coupling noise on circuit delay is a key issue in static timing analysis (STA) and involves the “victimaggressor alignment” problem. As delay-noise depe...
Ravikishore Gandikota, Kaviraj Chopra, David Blaau...