Citations: ILLC Dissertation Series - Veltink, PSF (ResearchIndex)

11 citations found. Retrieving documents...

M. Pauly. Logic for Social Software. PhD thesis, University of Amsterdam, 2001. ILLC Dissertation Series 2001-10.

@ NUS Home/Search Document Details and Download Summary Related Articles Check

This paper is cited in the following contexts:

Towards a Logic of Rational Agency - van der Hoek, Wooldridge (2003) (5 citations) (Correct)

.... on what we loosely characterise as game logics ; the unifying theme of these approaches is that they exploit the close relationship between games (in the sense of game theory) and Kripke like relational models for modal logics to provide a principled foundation for reasoning about rational agents [6, 4, 19, 55, 2]. 2.1 Cohen and Levesque 8 Intention Logic One of the best known, and most sophisticated attempts to show how the various components of an agent s cognitive makeup could be combined to form a logic of rational agency is due to Cohen and Levesque [14] Cohen and Levesque s formalism was originally ....

.... over games) 4] Ditmarsch s work on the use of cpistcmic dynamic logic to analyse board games [19] and work on modal charactcrisation of gamnc logic concepts such as Nash equilibrium [30, 2] As an example of the kind of work being done in this area, wc will focus on the coalition logic of Pauly [55, 57, 56]. Put crudely, coalition logic is a modal logic of cooperative ability. Coalition logic thus extends propositional logic with a collection of unary modal connectives of the form [C] where C is an expression denoting a set of agents. A formula [C] is intended to mean that the coalition C can ....

[Article contains additional citation context not shown here]

M. Pauly. Logic for Social Software. PhD thesis, University of Amsterdam, 2001. ILLC Disser- tation Series 2001-10.

Specification and Validation of Telecommunication Services in ACP - Zhaorui (Correct)

....discovery of ACP and 6 The message form is message name(ind, parameter1, parameter2) ind is the constant. 7 The message form is message name(req, parameter1, parameter2) req is the constant. 8 The exact message depends on the exact phase of call processing. 10 PSF, we refer to [6, 9, 10]. 3.1 ACP ACP (Algebra of Communicating Processes with abstraction) is a process algebra approach for the study of concurrent processes, developed by J.Bergstra and J.W.Klop in the early 1980s. ACP is suitable for both specification and verification of communicating processes. Processes ....

....between actions in H with an environment are expected or intended [5] 3. 4 PSF The process specification formalism(PSF) and its supporting toolkit PSF Toolkit aim at the construction of an integrated environment of computer tools for studying concurrent systems in the setting of ACP [9]. 3.4.1 From ACP to PSF Specifications PSF is a formal description technique for the specification of concurrent systems. It is based on process algebra and algebraic specifications. PSF supports modularization. ACP specifications and their relative parts in PSF are very similar. Operators ....

G.J.Veltink. Tools for PSF. ILLC Dissertation Series 1995-9.

Logic for Mechanism Design - A Manifesto - Pauly, Wooldridge (2003) Self-citation (Pauly) (Correct)

....specifying, implementing, and verifying mechanisms from the perspective of computer science. The purpose of this paper is to advance two key claims. The first claim is that logics specifically, modal logic [9] and more specifically, modal strategy logics such as coalition logic [26, 27, 28] and Alternating time temporal logic [3] have an important role to play in the specification, implementation, and verification of mechanisms. Modal strategy logics in this sense play a role analogous to that of (for example) temporal logics in the development of reactive systems (see, e.g. ....

....between extensive game forms and computational models. This similarity is perhaps most apparent when comparing a state transition diagram of a nondeterministic program on the one hand, and an extensive game form of perfect information on the other [7] As has been discussed more formally elsewhere [26], conventional (e.g. deterministic Turing machine) programs can thus be viewed formally as 1 player game forms. At this level of abstraction, therefore, the notion of a game form subsumes the notion of a program. Thus, the notion of a mechanism we arrive at is sufficiently general to encompass ....

[Article contains additional citation context not shown here]

M. Pauly. Logic for Social Software. PhD thesis, University of Amsterdam, 2001. ILLC Dissertation Series 2001-10.

Logics of Propositional Control - Jelle Gerbrandy Dipartimento (Correct)