Sciweavers

47 search results - page 4 / 10
» Preorder Relations
Sort
View
CORR
2010
Springer
153views Education» more  CORR 2010»
14 years 10 months ago
Characterising Probabilistic Processes Logically
Abstract. In this paper we work on (bi)simulation semantics of processes that exhibit both nondeterministic and probabilistic behaviour. We propose a probabilistic extension of the...
Yuxin Deng, Rob J. van Glabbeek
JSC
2010
100views more  JSC 2010»
14 years 4 months ago
An invariant-based approach to the verification of asynchronous parameterized networks
A uniform verification problem for parameterized systems is to determine whether a temporal property is satisfied for every instance of the system which is composed of an arbitrar...
Igor V. Konnov, Vladimir A. Zakharov
FOSSACS
2004
Springer
15 years 3 months ago
Bisimulation on Speed: Lower Time Bounds
More than a decade ago, Moller and Tofts published their seminal work on relating processes that are annotated with lower time bounds, with respect to speed. Their paper has left o...
Gerald Lüttgen, Walter Vogler
IMPERIAL
1993
15 years 2 months ago
Prioritising Preference Relations
We describe some ideas and results about the following problem: Given a set, a family of \preference relations" on the set, and a \priority" among those preference relat...
Mark Ryan
APAL
2006
67views more  APAL 2006»
14 years 10 months ago
Pretopologies and a uniform presentation of sup-lattices, quantales and frames
We introduce the notion of infinitary preorder and use it to obtain a predicative presentation of sup-lattices by generators and relations. The method is uniform in that it extend...
Giulia Battilotti, Giovanni Sambin