7 search results - page 2 / 2 » Approximating Labelled Markov Processes Again! |
131
Voted
FOSSACS
2003
Springer
15 years 10 months ago
2003
Springer
In previous work we have investigated a notion of approximate bisimilarity for labelled Markov processes. We argued that such a notion is more realistic and more feasible to compu...
142
Voted
EMMCVPR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In this paper, we present a novel successive relaxation linear programming scheme for solving the important class of consistent labeling problems for which an L1 metric i...