K. Su

Followers

Following

Co-author

Public Views

Interests

Uploads

Papers by K. Su

Symbolic model checking the knowledge of the dining cryptographers

Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004.

This paper describes how symbolic techniques (in particular, OBDD's) may be used to to implement ... more This paper describes how symbolic techniques (in particular, OBDD's) may be used to to implement an algorithm for model checking specifications in the logic of knowledge for a single agent operating with synchronous perfect recall in an environment of which it has incomplete knowledge. As an illustration of the utility of this algorithm, the paper shows how it may be used to verify a security protocol: Chaum's Dining Cryptographers protocol, which provides a mechanism for anonymous broadcast. It is argued that previous approaches to model checking security protocols are unable to verify this protocol, because of its information theoretic nature.

Download

A complete coalition logic of temporal knowledge for multi-agent systems

Frontiers of Computer Science, 2014

Coalition logic (CL) is one of the most influential logical formalisms for strategic abilities of... more Coalition logic (CL) is one of the most influential logical formalisms for strategic abilities of multi-agent systems. CL can specify what a group of agents can achieve through choices of their actions, denoted by [C]φ to state that a group of agents C can have a strategy to bring about φ by collective actions, no matter what the other agents do. However, CL lacks the temporal dimension and thus can not capture the dynamic aspects of a system. Therefore, CL can not formalize the evolvement of rational mental attitudes of the agents such as knowledge, which has been shown to be very useful in specifications and verifications of distributed systems, and has received substantial amount of studies. In this paper, we introduce coalition logic of temporal knowledge (CLTK), by incorporating a temporal logic of knowledge (Halpern and Vardi's logic of CKL n) into CL to equip CL with the power to formalize how agents' knowledge (individual or group knowledge) evolves over the time by coalitional forces and the temporal properties of strategic abilities as well. Furthermore, we provide an axiomatic system for CLTK and prove that it is sound and complete, along with the complexity of the satisfiability problem which is shown to be EXPTIME-complete.

Download

CacBDD: A BDD Package with Dynamic Cache Management

Lecture Notes in Computer Science, 2013

In this paper, we present CacBDD, a new efficient BDD (Binary Decision Diagrams) package. It impl... more In this paper, we present CacBDD, a new efficient BDD (Binary Decision Diagrams) package. It implements a dynamic cache management algorithm, which takes account of the hit-rate of computed table and available memory. Experiments on the BDD benchmarks of both combinational circuits and model checking show that CacBDD is more efficient compared with the state-of-the-art BDD package CUDD.

Download

Solving sum and product riddle via bdd-based model checking

We model the Sum and Product Riddle in public announcement logic, which is interpreted on an epis... more We model the Sum and Product Riddle in public announcement logic, which is interpreted on an epistemic Kripke model. The model is symbolically represented as a finite state program with n agents. A model checking method to the riddle is developed by using the BDD-based symbolic model checking algorithm for logic of knowledge we developed in [7]. The method is implemented by extending the model checker MCTK [7] and then the solution of the riddle is verified successfully.

Download

Generation of two-dimensional chaotic vector fields from a surface-emitting semiconductor laser: Analysis of vector singularities

Physical Review E, 2007

We demonstrate experimental generation of two-dimensional ͑2D͒ chaotic vector fields from a surfa... more We demonstrate experimental generation of two-dimensional ͑2D͒ chaotic vector fields from a surfaceemitting microcavity laser with precisely control of the operating temperature and the operating current. The 2D optical vector field is found to be formed by frequency locking of two linearly polarized laser modes with different chaotic spatial structures. The eigenfunction expansion method is used to reconstruct the experimental wave function for analyzing the properties of the vector singularities. It is shown that the distribution of vector singularities obeys the sign rule of nearest-neighbor singularities in the phase space of the vector field.

Download

Catalytic performance of metal oxide modified SiMCM-41 catalysts in diphenyl carbonate synthesis

Kinetics and Catalysis, 2010

Decomposition of CCl4 into diphenyl carbonate (DPC) was examined over metal oxides modified SiMCM... more Decomposition of CCl4 into diphenyl carbonate (DPC) was examined over metal oxides modified SiMCM-41. ZnO/SiMCM-41 and Fe2O3/SiMCM-41 showed high activity in DPC synthesis. Although many other metal oxides, such as La2O3, CuO, Al2O3 and alkali or alkaline earth oxide, were success in destruction of CCl4, they displayed nearly no activity on DPC synthesis. ZnO/SiMCM-41 and Fe2O3/SiMCM-41 were characterized by X-ray

Observation-based model for BDI-agents

by Guido Governatori and K. Su

We present a new computational model of BDI-agents, called the observation-based BDI-model. The k... more We present a new computational model of BDI-agents, called the observation-based BDI-model. The key point of this BDImodel is to express agents' beliefs, desires and intentions as a set of runs (computing paths), which is exactly a system in the interpreted system model, a well-known agent model due to Halpern and his colleagues. Our BDI-model is computationally grounded in that we are able to associate the BDIagent model with a computer program, and formulas, involving agents' beliefs, desires (goals) and intentions, can be understood as properties of program computations. We present a sound and complete proof system with respect to our BDImodel and explore how symbolic model checking techniques can be applied to model checking BDI-agents. In order to make our BDI-model more flexible and practically realistic, we generalize it so that agents can have multiple sources of beliefs, multiple goals and intentions.

Download

Computationally grounded model of BDI-agents

by K. Su and Guido Governatori

Download

K. Su

Uploads

Papers by K. Su

Log In