The Linear Time-Branching Time Spectrum II - The semantics of sequential systems with silent moves

The Linear Time-Branching Time Spectrum II - The semantics of sequential systems with silent moves (1993)

by R.J. van Glabbeek

Citations:

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	The Linear Time-Branching Time Spectrum II - The semantics of sequential systems with silent moves	user correction - Legacy Corrections
AUTHOR NAME	R.J. van Glabbeek	user correction - Legacy Corrections
ABSTRACT	ion Rule (KFAR) (Baeten, Bergstra & Klop [3]), expresses a global fairness assumption. It says that when possible a system will escape from any cycle of internal actions. Some form of KFAR is crucial for many protocal verifications with unreliable channels, and for that reason preorders and equivalences that satisfy KFAR are of special interest. Must preorders and divergence sensitive ones cannot satisfy KFAR. In Bergstra, Klop & Olderog [7] it is shown that the combination of KFAR with failure semantics is inconsistent, but they formulate a weaker version of KFAR that is satisfied in failure may-semantics. Still the combination of KFAR \Gamma and the liveness requirement appears to require global testing, and is only satisfied in the semantics between contrasimulation (C) and stability respecting branching bisimulation (BB s ). These requirements would reduce the number of suitable preorders to 18. It is in general a good strategy to do your verifications using the finest preorde...	user correction - Legacy Corrections
YEAR	1993	user correction - Legacy Corrections
CITATIONS	42 found	ParsCit 1.0