Sciweavers

937 search results - page 1 / 188
» On the Complexity of Partial Order Properties
Sort
View
WG
1992
Springer
13 years 8 months ago
On the Complexity of Partial Order Properties
The recognition complexityof ordered set properties is considered, i.e.how many questions have to be asked to decide if an unknown ordered set has a prescribed property. We prove ...
Stefan Felsner, Dorothea Wagner
ENTCS
2006
173views more  ENTCS 2006»
13 years 4 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal
ORDER
2010
110views more  ORDER 2010»
13 years 3 months ago
The Complexity of Embedding Orders into Small Products of Chains
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
Olivier Raynaud, Eric Thierry
HYBRID
2005
Springer
13 years 10 months ago
Existence of Cascade Discrete-Continuous State Estimators for Systems on a Partial Order
In this paper, a cascade discrete-continuous state estimator on a partial order is proposed and its existence investigated. The continuous state estimation error is bounded by a mo...
Domitilla Del Vecchio, Richard M. Murray
ECCC
2010
87views more  ECCC 2010»
13 years 2 months ago
Testing monotonicity of distributions over general partial orders
We investigate the number of samples required for testing the monotonicity of a distribution with respect to an arbitrary underlying partially ordered set. Our first result is a n...
Arnab Bhattacharyya, Eldar Fischer, Ronitt Rubinfe...