Efficient verification of determinate processes

Qin, Huajun

doi:10.1007/3-540-54430-5_107

Cited by 9 publications

(6 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many efficient algorithms for computing various bisimulation equivalences (strong, weak, branching) were proposed [7,17,[20][21][22][23][24][25][26]. According to the definition of an equivalence relation, which is either a set of state classes or a binary relation on the state space, the methods consists of refining a current partition until each class is stable or checking if a pair of states belonging to the current relation are bisimilar.…”

Section: Behavioral Equivalences and Preordersmentioning

confidence: 99%

On-the-fly verification of finite transition systems

Fernandez

Mounier

Jard

et al. 1992

Form Method Syst Des

View full text Add to dashboard Cite

The analysis of programs by the exhaustive inspection of reachable states in a finite-state graph is a well-understood procedure. It is straightforwardly applicable to many description languages and is actually implemented in several industrial tools. But one of the main limitations of today's verification tools is the size of the memory needed to exhaustively build the state graphs of the programs. For numerous properties, it is not necessary to explicitly build this graph; an exhaustive depth-first traversal is often sufficient. This leads to an on-line algorithms for computing Biichi acceptance (in the deterministic ease) and behavioral equivalences: they are presented in detail. In order to avoid retraversing states, it is, however, important to store some of the already visited states in memory. To keep the memory size bounded (and avoid a performance falling down), visited states are randomly replaced. In most cases, this depth-first traversal with replacement can push back significantly the limits of verification tools. We give the name on-the-fly verification to the use of algorithms based on a depth-first search (with replacement) of the finite-state graph associated with the program to be verified.

show abstract

Section: Behavioral Equivalences and Preordersmentioning

confidence: 99%

On-the-fly verification of finite transition systems

Fernandez

Mounier

Jard

et al. 1992

Form Method Syst Des

View full text Add to dashboard Cite

show abstract

“…Many other authors have confirmed the importance of confluence. For example, in [17,13,8] the notion is used for on the fly reduction of finite state spaces and in [16,19] it has been used for the verification of protocols.…”

Section: Introductionmentioning

confidence: 99%

Confluence for process verification

Groote

Sellink

1996

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…E.g. in [HP94,Qin91] the notion is used for on-the-fly reduction of finite state spaces and in [Mil80] it has been used for the verification of protocols.…”

Section: Introductionmentioning

confidence: 99%

Confluence for process verification

Groote

Sellink

1995

CONCUR '95: Concurrency Theory

View full text Add to dashboard Cite

This chapter addresses the question how to verify distributed and communicating systems in an effective way from an explicit process algebraic standpoint. This means that all calculations are based on the axioms and principles of the process algebras. The first step towards such verifications is to extend process algebra (ACP) with equational data types which adds required expressive power to describe distributed systems. Subsequently, linear process operators, invariants, the cones and foci method, the composition of many similar parallel processes, and the use of confluence are explained, as means to verify increasingly complex systems. As illustration, verifications of the serial line interface protocol (SLIP) and the IEEE 1394 tree identify protocol are included.

show abstract

Efficient verification of determinate processes

Cited by 9 publications

References 7 publications

On-the-fly verification of finite transition systems

On-the-fly verification of finite transition systems

Confluence for process verification

Confluence for process verification

Contact Info

Product

Resources

About