Sciweavers

656 search results - page 80 / 132
» A Formalization of Transition P Systems
Sort
View
MPC
2010
Springer
181views Mathematics» more  MPC 2010»
15 years 5 months ago
Process Algebras for Collective Dynamics
d Abstract) Jane Hillston Laboratory for Foundations of Computer Science, The University of Edinburgh, Scotland Quantitative Analysis Stochastic process algebras extend classical p...
Jane Hillston
105
Voted
JANCL
2007
115views more  JANCL 2007»
15 years 10 days ago
A logical characterisation of qualitative coalitional games
Qualitative coalitional games (QCGs) were introduced as abstract formal models of goal-oriented cooperative systems. A QCG is a game in which each agent is assumed to have some goa...
Paul E. Dunne, Wiebe van der Hoek, Michael Wooldri...
124
Voted
IANDC
2007
152views more  IANDC 2007»
15 years 12 days ago
The reactive simulatability (RSIM) framework for asynchronous systems
We define reactive simulatability for general asynchronous systems. Roughly, simulatability means that a real system implements an ideal system (specification) in a way that pre...
Michael Backes, Birgit Pfitzmann, Michael Waidner
100
Voted
ATAL
2007
Springer
15 years 6 months ago
Normative system games
We develop a model of normative systems in which agents are assumed to have multiple goals of increasing priority, and investigate the computational complexity and game theoretic ...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
POPL
2007
ACM
16 years 23 days ago
A very modal model of a modern, major, general type system
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
Andrew W. Appel, Christopher D. Richards, Jé...