In this paper, we first define bisimulation-based non-deterministic admissible interference (BNAI), derive its process-theoretic characterization and present a compositional verification method with respect to the mai...
In this paper, we first define bisimulation-based non-deterministic admissible interference (BNAI), derive its process-theoretic characterization and present a compositional verification method with respect to the main operators over communicating processes, generalizing in this way the similar trace-based results obtained in [19] into the finer notion of observation-based bisimulation [6]. Like its trace-based version, BNAI admits information flow between secrecy levels only through a downgrader (e.g. a cryptosystem), but is phrased into a generalization of observational equivalence [18]. We then describe an admissible interference-based method for the analysis of cryptographic protocols, extending, in a non-trivial way, the non interference-based approach presented in [11]. Confidentiality and authentication for cryptoprotocols are defined in terms of BNAI and their respective bisimulation-based proof methods are derived. Finally, as a significant illustration of the method, we consider simple case studies: the paradigmatic examples of the Wide Mouthed Frog protocol [1] and the Woo and Lam one-way authentication protocol [25]. The original idea of this methodology is to prove that the intruder may interfere with the protocol only through selected channels considered as admissible when leading to harmless interference.
This workshop was dedicated to research towards better support for unanticipated software evolution (USE) in development tools, programming languages, component models and related runtime *** report gives an overview ...
详细信息
Two of the fundamental issues in message passing between mobile agents are tracking the migration of the target agent and delivering messages to it. In order to provide reliable message delivery, protocols are needed ...
详细信息
In this paper, we present a guided interaction approach for architectural design in a table-type VR environment (virtual table). By making it easier to communicate between two or more people in a virtual space, the vi...
详细信息
This paper presents the design and evaluation of a manufacturing route planner for flexible manufacturing systems. The aim of the planner is to find the optimal manufacturing routes for jobs using well-designed cost f...
详细信息
This paper presents the design and evaluation of a manufacturing route planner for flexible manufacturing systems. The aim of the planner is to find the optimal manufacturing routes for jobs using well-designed cost functions. This route planner, which is based on heuristic [A*] strategy, has been designed to work under dynamic arrival pattern environment. The proposed algorithm consists of two level;the cell level, which controls the jobs flow between cells, and the machine level which controls the jobs flow between the machines inside the cells selected at first level. The solutions of the route planner are contained in a dynamic knowledge base that passes information to the sequencing and monitoring stage. The suggested model has also the capability to detect and response with suitable alternation for the damaged elements in the manufacturing system. To improve the performance of the planner, the design is organized into distributed programming media using the concurrent features of the modula-2 programming language. Finally, two case studies are considered to illustrate the functionality of the proposed algorithm.
This paper presents an overview of Pragma, an adaptive runtime infrastructure capable of reactively and proactively managing and optimizing application execution using current system and application state, predictive ...
Propositional satisfiability (SAT) is a fundamental problem of immense practical importance. While SAT is NP-complete when clauses can contain 3 literals or more, the problem can be solved in linear time when the give...
详细信息
ISBN:
(纸本)0909925828
Propositional satisfiability (SAT) is a fundamental problem of immense practical importance. While SAT is NP-complete when clauses can contain 3 literals or more, the problem can be solved in linear time when the given formula contains only binary clauses (2SAT). Many complete search algorithms for SAT solving have taken advantage of 2SAT information that occurs in the statement of the problem in order to simplify the solving process, only one that we are aware of uses 2SAT information that arises in the process of the search, as clauses are simplified. There are a number of possibilities for making use of 2SAT information to improve the SAT solving process: maintaining 2SAT satisfiability during search, detecting unit consequences of the 2SAT clauses, and Krom subsumption using 2SAT clauses. In this paper we investigate the tradeoffs of increasing complex 2SAT handling versus the search space reduction and execution time. We give experimental results illustrating that the SAT solver resulting from the best tradeoff is competitive with state of the art Davis-Putnam methods, on hard problems involving a substantial 2SAT component.
Applications of the Hough Transform (HT) have been limited to small-size images for a long time. For large-size images, peak detection and line verification become much more time-consuming. Many HT-based line detectio...
详细信息
Recognizing graphic objects from binary images is an important task in many real-life applications. Generally, there are two ways to do the graphics recognition: onestep methods and two-step methods. The former recogn...
详细信息
暂无评论