Sciweavers

1022 search results - page 61 / 205
» Relators and Metric Bisimulations
Sort
View
DM
2010
82views more  DM 2010»
14 years 12 months ago
The complexity of the weight problem for permutation and matrix groups
Given a metric d on a permutation group G, the corresponding weight problem is to decide whether there exists an element G such that d(, e) = k, for some given value k. Here we ...
Peter J. Cameron, Taoyang Wu
JSS
2006
97views more  JSS 2006»
14 years 11 months ago
An empirical study into class testability
In this paper we investigate factors of the testability of object-oriented software systems. The starting point is given by a study of the literature to obtain both an initial mod...
Magiel Bruntink, Arie van Deursen
LICS
2009
IEEE
15 years 6 months ago
On the Computational Complexity of Verifying One-Counter Processes
—One-counter processes are pushdown systems over a singleton stack alphabet (plus a stack-bottom symbol). We study the complexity of two closely related verification problems ov...
Stefan Göller, Richard Mayr, Anthony Widjaja ...
FOSSACS
2007
Springer
15 years 6 months ago
On the Expressiveness and Complexity of ATL
ATL is a temporal logic geared towards the specification and verification of properties in multi-agents systems. It allows to reason on the existence of strategies for coalitions...
François Laroussinie, Nicolas Markey, Ghass...
ECAI
2010
Springer
15 years 29 days ago
Foundations of Tree-like Local Model Updates
Abstract. Model update is an approach to enhance model checking functions by providing computer aided modifications in system development [2, 9]. It has been observed that one majo...
Yan Zhang, Michael Kelly, Yi Zhou