NDLI: On conditions to verify progress and finiteness for cyclic communicating machines

Content Provider	IEEE Xplore Digital Library
Author	Mountassir, H.
Copyright Year	1995
Description	Author affiliation: Lab. d'Inf., Besancon, France (Mountassir, H.)
Abstract	Systems of communicating finite state machines model abstract processes which communicate exclusively by exchanging messages through FIFO channels. They can be used to study protocols and distributed computing. This paper discusses a methodology to validate cyclic communicating systems. The communication is assumed asynchronous between processes which exchange exclusively messages over two FIFO channels. A well known reachability analysis is based on the perturbation algorithm. It is designed to explore all reachable global states from the initial states of each process to the final directed graph. This graph is used to verify some suitable properties of the communication. It has been shown earlier that the problem of finiteness of the graph is undecidable in general. We first describe conditions in which the communication progresses between the processes without blocking states. After this, we clarify some sufficient conditions used to decide whether the reachability graph for a given system is finite or infinite. The proposed technique works on particular global states defined as milestones and some potential executed sequences in each process. It guided by cracking the content of channels at each step.
Starting Page	283
Ending Page	288
File Size	469264
Page Count	6
File Format	PDF
ISBN	0780325796
DOI	10.1109/SICON.1995.526063
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	1995-07-03
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Reachability analysis Automata Sufficient conditions Protocols Distributed computing Explosions Testing Perturbation methods
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

On reachability and reverse reachability analysis of communicating finite state machines

Deadlock detection in communicating finite state machines by even reachability analysis

Reachability problems for cyclic protocols

Reachability Graph Based Hierarchical Test Generation for Network Protocols Modeled as Parallel Finite State Machines

On basic rewriting rules to verify communicating machines

Generalized fair reachability analysis for cyclic protocols

On conditions for defining a closed cover to verify progress for communicating finite state machines

Deadlock detection by fair reachability analysis: from cyclic to multi-cyclic protocols (and beyond?)

Partial-order validation for multi-process protocols modeled as communicating finite state machines

On conditions to verify progress and finiteness for cyclic communicating machines

Similar Documents

On reachability and reverse reachability analysis of communicating finite state machines

Deadlock detection in communicating finite state machines by even reachability analysis

Reachability problems for cyclic protocols

Reachability Graph Based Hierarchical Test Generation for Network Protocols Modeled as Parallel Finite State Machines

On basic rewriting rules to verify communicating machines

Generalized fair reachability analysis for cyclic protocols

On conditions for defining a closed cover to verify progress for communicating finite state machines

Deadlock detection by fair reachability analysis: from cyclic to multi-cyclic protocols (and beyond?)

Partial-order validation for multi-process protocols modeled as communicating finite state machines

On conditions to verify progress and finiteness for cyclic communicating machines