• Title, Summary, Keyword: 프로세스대수

Search Result 34, Processing Time 0.041 seconds

Abstraction Method for Analysis of Mobility and Interaction in Process Algebra Using Behavioral Ontology (프로세스 대수에서 이동성과 상호작용을 분석하기 위한 행위 온톨로지를 이용한 추상화 방법)

  • Woo, Su-Jeong;On, Jin-Ho;Lee, Moon-Kun
    • The Journal of the Korea Contents Association
    • /
    • v.11 no.9
    • /
    • pp.63-75
    • /
    • 2011
  • A number of process algebras have been proposed to develop distributed mobile real-time systems: pi-Calculus, Mobile Ambients Calculus, Bigraph, etc. However, as the systems get large and complex, the algebras become less suitable for understanding the interactions and mobility of the processes of the systems due to the size and complexity. Therefore it is necessary to handle the size and complexity for systematic understanding of the systems. This paper handles the size and complexity with a method of abstraction on sequences of interactions and movements of processes in the systems, which can be further organized in the form of hierarchically structured lattices, namely, Prism. The theoretical principle of the abstraction is based on a new concept of Behavior Ontology, which is extended from Active ontology. Prism allows the systems to be analyzed in the perspective of the lattices in Prism, which are characterized by the hierarchically organized behavioral properties of the developing systems, for systematic understanding the systems. In this way, the complexity of the interactions and the movements can be handled systematically in the semantically and hierarchically organized structure of the behavior.

Process Algebra for Multiple Shared Resources (다중 공유 자원을 위한 프로세스 대수)

  • Yoo, Hee-Jun;Lee, Ki-Huen;Choi, Jin-Young
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.3
    • /
    • pp.337-344
    • /
    • 2000
  • In this paper, we define a Process Algebra ACSMR(Algebra of Communicating Shared Multiple Resources) for system specification and verification using multiple resources. ACSMR extends a concept of multiple resources in ACSR that is a branch of formal methods based on process algebra. We'll show that two specification and verification examples. One is the specification of system behavior in multiprocessor using EDF(Earliest-Deadline-First) which is a scheduling algorithm of a real-time system. The other is the specification of describing timing analysis and resources restriction in a super scalar processor using multiple ports registers.

  • PDF

A Process Algebra Approach for Object Interactions in UML (UML에서 객체 상호작용에 대한 프로세스 대수 접근)

  • 최성운;이영환
    • Journal of KIISE:Software and Applications
    • /
    • v.30 no.3_4
    • /
    • pp.202-211
    • /
    • 2003
  • Abstract Formal definitions of syntax and semantics for the static and dynamic models in Object Oriented methods are already defined. But the behavior of interacting objects is not formalized. In this paper, we defined the common behavior of interacting objects in terms of process algebra using sequence diagram in UML and regularized properties of interacting objects. Based on the results, we can develop a formal specification by. using of the object interaction instead of the existence dependency suggested by M. Snoeck and G. Dedene[9].

PACSR : A Probabilistic ACSR (PACSR : 확률적 ACSR)

  • Seong, Soon-Yong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.1
    • /
    • pp.720-723
    • /
    • 2005
  • There has been significant progress in the development of timed process algebra for the specification and analysis of real-time systems in recent years. ACSR is a timed process algebra, which supports synchronous timed actions and asynchronous instantaneous events. Timed actions model the usage of shared resources and the passage of time, whereas events allow synchronization between processes. To be able to specify real-time systems more effectively, this paper suggests the notion of probabilities. This paper also illustrates extended PACSR with a typical resource allocation system and its deadlock specification and analysis.

  • PDF

An Analysis of System Fault (시스템 오류 분석)

  • Seong, Soon-Yong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.927-930
    • /
    • 2005
  • ACSR is a timed process algebra for the specification and analysis of real-time systems, which supports synchronous timed actions and asynchronous instantaneous events. PACSR is an extended ACSR with the notion of probabilities in selection operation. Using PACSR, this paper represents a system fault occurrence and recovery from the fault in the general resource alteration system. The result shows that system fault occurrence can be analyzed from the fault occurrence probability and the recovery probability.

  • PDF

Probabilistic Analysis of System Failure (시스템 오류에 대한 확률적 분석)

  • Seong, Soon-Yong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.14 no.3
    • /
    • pp.648-654
    • /
    • 2010
  • Request operations and release operations occur repeatedly in resource allocation systems. The process requesting a resource acquires one by any priority-based mechanism, and returns the resource after some periods. In this system, resource failures lead to delay of resource allocation, or to termination of process holding the failed resource. To analyze this process effectively, this paper designs a probabilistic ACSR, a process algebra that extends ACSR with the probabilistic choice operation. The ability to express/analyze both request-release rates and failure-recovery rates is illustrated using probabilistic ACSR.

Implementation of Process States Analyzer for Schedulability Analysis of Real-Time Process (실시간 프로세스의 스케줄가능성 분석을 위한 프로세스 상태 분석기 구현)

  • 서상진;서동진;최동한;김춘배;박흥복
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • /
    • pp.208-212
    • /
    • 1999
  • 실시간 스케줄가능성 분석에 대한 기존의 방법들은 프로세스의 모든 상태공간을 추적하거나 고정 우선 순위 스케줄 방법을 사용하기 때문에 시간 및 공간에 대한 복잡성이 증가된다. 본 논문에서는 프로세스 대수의 전이규칙을 이용하여 프로세스의 최소 수행시간, 주기, 마감시간, 동기화 시간을 고려하여 실시간 프로세스가 마감시간을 지키는가를 판단하고, GUI 환경을 기반으로 스케줄이 불가능한 프로세스에 대해 스케줄 가능하게 하는 회복 알고리즘을 제안하고, 이들의 상태 공간을 화면상에 표시해 주는 실시간 프로세스의 상태 분석기를 구현한다.

  • PDF

Numerical Study on Operating Factors Affecting Performance of Surfactant-Enhanced Aquifer Remediation Process (계면활성제 증진 대수층 복원 프로세스에 영향을 미치는 운영 인자들에 대한 수치 연구)

  • Lee, Kun-Sang
    • Journal of Korean Society of Environmental Engineers
    • /
    • v.32 no.7
    • /
    • pp.690-698
    • /
    • 2010
  • Contamination of groundwater resources by organic chemicals has become an issue of increasing environmental concern. Surfactant-enhanced aquifer remediation (SEAR) is widely recognized as one of the most promising techniques to remediate organic contaminations in-situ. Solutions of surfactant or surfactant with polymer are used to dramatically expedite the process, which in turn, may reduce the treatment time of a site compared to use of water alone. In the design of surfactant-based technologies for remediation of organic contaminated aquifers, it is very important to have a considerable analysis using extensive numerical simulations prior to full-scale implementation. This study investigated the formation and flow of microemulsions during SEAR of organic-contaminated aquifer using the finite difference model UTCHEM, a three-dimensional, multicomponent, multiphase, compositional model. The remediation process variables considered in this study were the sequence of injection fluids, the injection and extraction rate, the concentrations of polymer in surfactant slug and chase water, and the duration of surfactant injection. For each variable, temporal changes in injection and production wells and spatial distributions of relative saturations in the organic phase were compared. Cleanup time and cumulative organic recovery were also quantified. The study would provide useful information to design strategies for the remediation of nonaqueous phase liquid-contaminated aquifers.

Process Algebra for Specification of Mobile Real-time Systems (이동 실시간 시스템의 명세를 위한 프로세스 대수)

  • Choe, Yeong-Bok;Choi, Woo-Rim;Lee, Moon-Kun
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • /
    • pp.597-600
    • /
    • 2014
  • 컴퓨터 시스템의 병렬, 분산, 이동, 실시간 적인 시스템들을 명세하기 위한 여러가지 정형기법들이 존재한다. 본 논문에서는 이동 실시간 시스템의 명세를 위한 정형기법으로서 ${\delta}-Calculus$ 를 정의하였다. ${\delta}-Calculus$ 의 가장 큰 특징은 프로세스의 이동성으로써 시간의 흐름에 따라 프로세스 간의 상호작용을 통해 프로세스가 이동하는 것을 표현할 수 있다. ${\delta}-Calculus$ 를 사용하여 프로세스의 이동성을 표현함으로써 시스템의 공간정보와 시간정보를 명세하고, 프로세스의 상태에 따른 보안적 특성을 나타낼 수 있다. 본 논문에서는 ${\delta}-Calculus$ 의 문법과 의미를 설명하고 이동성에 의한 특성을 분석하였다.

  • PDF

Validation of the Detailed Design of the Label Distribution Protocol for the Multiprotocol Label Switching System (Multiprotocol Label Switching System의 Label Distribution Protocol 상세설계 검증)

  • 박재현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.5A
    • /
    • pp.889-901
    • /
    • 2001
  • 본 논문에서 Multiprotocol Label Switching 시스템을 위한 Label Distribution Protocol의 개발과 분석에 관해서 기술한다. 먼저 Gigabit Switched Router를 만들기 위해서, 상용화시 Carrier Class 제품에 적용하기 위한 LDP의 구현시 고려해야 될 사항에 대해 살피고, 상세 설계를 제안한다. IETF 표준에 의거한 LDP의 구현을 위한 상세 설계는 프로토콜 상태기계의 유도 트리와 프로세스 대수를 사용한 형식적 명세를 사용하여 제시한다. 본 논문에서는 제시된 유도트리와 프로세스 대수를 사용한 프로토콜 동작의 분석을 통해, 구현된 LDP의 상호 연동성과 완전성, 생존성, 도달성, 안전성을 검증한다. 또한 이를 사용하여 구현된 LDP가 기존 상용 제품들과의 연동성과 그 동작의 신뢰성을 확보할 것을 기대한다. 결과적으로 구현된 LDP의 프로토콜 동작들의 검증을 제공한다.

  • PDF