NDLI: An Abstraction Method of Behaviors for Process Algebra

Content Provider	IEEE Xplore Digital Library
Author	Jinho On Yeongbok Choe Moonkun Lee
Copyright Year	2013
Description	Author affiliation: Dept. of Comput. Eng., Chonbuk Nat. Univ., Jeonju, South Korea (Jinho On; Yeongbok Choe; Moonkun Lee)
Abstract	In CCS, Milner defined the notion of Strong and Weak Bisimulations for behavioral equivalence between two processes or systems. However the notion has not been studied further in the perspective of abstraction for such behaviors in process algebra. In some sense, weak bisimulation could be interpreted as a kind of behavior equivalence between two processes at the certain degree of abstraction, based on observability. Here we noticed the possibility of representing such observable behaviors with a certain structure of abstraction and verify a number of behavioral equivalences in the structure. In the paper, such possibility has been realized with a new concept of Behavior Ontology. In the ontology, actions can be defined as an interaction between two processes or systems, and, further, behaviors can be defined as a sequence of such actions. Since some actions between the behaviors can be overlapped in some structural way, the behaviors can be organized in a lattice structure, namely, Behavior Lattice. Consequently, the lattice reveals certain levels of observability of the behaviors, based on degree of abstraction. From the lattice, a strong bisimulation and its weak bisimulations can be detected visually. The comparative study shows that the ontology is very effective and efficient for representing such abstract behaviors and verifying strong and weak bisimulations in a lattice structure. The ontology can be considered as one of the unique and innovative structure to represent such behaviors in a hierarchical structure of abstraction.
Starting Page	133
Ending Page	138
File Size	2162444
Page Count	6
File Format	PDF
ISBN	9781479921591
DOI	10.1109/COMPSACW.2013.15
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2013-07-22
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Behavior Ontology Conferences Equivalence Bisimulation Process Algebra Software Abstraction Lattice
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

An Abstraction Method for Mobility and Interaction in Process Algebra Using Behavior Ontology

A Lattice Model to Verify Behavioral Equivalences

Branching time and abstraction in bisimulation semantics

Strong splitting bisimulation equivalence (2005)

Bisimulation equivalence is decidable for normed Process Algebra (Extended Abstract) (1999)

Strong splitting bisimulation equivalence (2005)

Compositional reasoning for probabilistic finite-state behaviors (2005)

Compositional reasoning for probabilistic finite-state behaviors (2005)

An axiomatization for the terminal cycle (1996)

An Abstraction Method of Behaviors for Process Algebra

Similar Documents

An Abstraction Method for Mobility and Interaction in Process Algebra Using Behavior Ontology

A Lattice Model to Verify Behavioral Equivalences

Branching time and abstraction in bisimulation semantics

Strong splitting bisimulation equivalence (2005)

Bisimulation equivalence is decidable for normed Process Algebra (Extended Abstract) (1999)

Strong splitting bisimulation equivalence (2005)

Compositional reasoning for probabilistic finite-state behaviors (2005)

Compositional reasoning for probabilistic finite-state behaviors (2005)

An axiomatization for the terminal cycle (1996)

An Abstraction Method of Behaviors for Process Algebra