Sciweavers

201 search results - page 23 / 41
» On the Decidability of Model-Checking for P Systems
Sort
View
SYNTHESE
2008
114views more  SYNTHESE 2008»
14 years 11 months ago
Quantified coalition logic
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
IPPS
2002
IEEE
15 years 4 months ago
The Self-Tuning dynP Job-Scheduler
In modern resource management systems for supercomputers and HPC-clusters the job-scheduler plays a major role in improving the performance and usability of the system. The perfor...
Achim Streit
CAI
2006
Springer
14 years 11 months ago
Formal Verification of Security Model Using SPR Tool
In this paper, formal verification methodologies and the SPR (Safety Problem Resolver) model checking tool are used for verifying a security model's safety. The SPR tool makes...
Il-Gon Kim, Miyoung Kang, Jin-Young Choi, Peter D....
CHARME
2005
Springer
122views Hardware» more  CHARME 2005»
15 years 5 months ago
Regular Vacuity
The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties i...
Doron Bustan, Alon Flaisher, Orna Grumberg, Orna K...
CAV
2003
Springer
122views Hardware» more  CAV 2003»
15 years 5 months ago
Timed Control with Partial Observability
We consider the problem of synthesizing controllers for timed systems modeled using timed automata. The point of departure from earlier work is that we consider controllers that ha...
Patricia Bouyer, Deepak D'Souza, P. Madhusudan, An...