• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06b
• /
• pp.193-196
• /
• 2011

공간적으로 다양하게 재구성되며 이동하는 분산/이동/실시간 시스템을 명세 및 분석하기 위한 기존의 프로세스 대수들은 명세/분석 과정에서 텍스트 기반의 명세 언어를 사용한다. 이로 인하여 프로세스 사이의 이동성과 프로세스들의 공간적 분포를 대한 명세 및 분석 방법은 매우 큰 복잡도가 존재한다. 이를 극복하기 위하여 일반 프로세스 대수를 시각적인 형태로 표현하는 다양한 기법들이 제안되었다. 이러한 시각화 언어들은 시스템의 특정 상태를 명세하거나, 시스템의 속성을 공간적 분포와 링크정보로 분리하는 방법들이 사용되었지만, 명세하고자 하는 시스템의 전체 행위에 대한 효율적인 명세 방법이 존재하지 않고, 시각화 언어임에도 불구하고 텍스트기반의 프로세스 대수와 병행되어 사용되어야만 하는 제약들이 존재한다. 이러한 제약들을 극복하기 위한 하나의 방법으로 본 논문에서는 프로세스 대수를 위한 새로운 시각화 언어인 Onion Visual Language를 제안한다. Onion Visual Language는 프로세스 사이에서 발생하는 이동과 상호작용 등의 전체 행위를 원형의 양파껍질과 같은 형태로 표현하며, 각 프로세스들 사이에서 발생하는 행위들의 관계를 액션으로 표현한다. 또한, 계층화된 프로세스 구조, 프로세스의 상태정보, 프로세스의 미래 행위 정보, 비결정적 행위정보를 포함하여 매우 복잡한 시스템의 특징을 효율적으로 명세/분석 가능하도록 하였다.

• Journal of KIISE
• /
• v.43 no.3
• /
• pp.314-326
• /
• 2016

Some process algebras were applied to enterprise business modelling for formal specification and verification. ${\pi}$-calculus and mobile ambient can be considered for the distributed and mobile, especially to represent the movements of distributed real-time business processes. However there are some limitations to model the movements: 1) ${\pi}$-calculus passes the name of port for indirect movements, and 2) mobile ambient uses ambient to synchronize asynchronous movements forcefully. As a solution to the limitations, this paper presents a new process algebra, called ${\delta}$-calculus, to specify direct and synchronous movements of business processes over geo-temporal space. Any violation of safety or security of the systems caused by the movements can be indicated by the properties of the movements: synchrony, priority and deadline. A tool, called SAVE, was developed on ADOxx metamodelling platform to demonstrate the concept.

• 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.

• 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].

• 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.

• Journal of KIISE
• /
• v.43 no.5
• /
• pp.541-552
• /
• 2016

This paper introduces the new notions of conjunctive and complement choices in process algebra, which reduce both process and system complexities significantly for distributed mobile real-time system during specification and analysis phases. The complement choice implies that two processes make cohesive choices for their synchronous partners at their own choice operations. The conjunctive choice implies choice dependency among consecutive choice operations in a process. The conjunctive choice reduces process complexity exponentially by the degree of the consecutive choice operations. The complement choice also reduces system complexity exponentially by the degree of the synchronous choice operations. Consequently, the reduction method makes the specification and analysis of the systems much easier since the complexity is reduced significantly. This notion is implemented in a process algebra, called ${\delta}$-Calculus. The efficiency and effectiveness are demonstrated with an example in a tool for the algebra, called SAVE, which is developed on ADOxx platform.

• 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.

• 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.

• 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.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.05a
• /
• pp.208-212
• /
• 1999

실시간 스케줄가능성 분석에 대한 기존의 방법들은 프로세스의 모든 상태공간을 추적하거나 고정 우선 순위 스케줄 방법을 사용하기 때문에 시간 및 공간에 대한 복잡성이 증가된다. 본 논문에서는 프로세스 대수의 전이규칙을 이용하여 프로세스의 최소 수행시간, 주기, 마감시간, 동기화 시간을 고려하여 실시간 프로세스가 마감시간을 지키는가를 판단하고, GUI 환경을 기반으로 스케줄이 불가능한 프로세스에 대해 스케줄 가능하게 하는 회복 알고리즘을 제안하고, 이들의 상태 공간을 화면상에 표시해 주는 실시간 프로세스의 상태 분석기를 구현한다.