P. Abdulla, M. Kindahl, and D. Peled. An improved search strategy for lossy channel systems. In PSTV/FORTE. Chapman-Hall, 1997. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Verifying Lossy Channel Systems has Nonprimitive Recursive.. - Schnoebelen (2001) (4 citations) (Correct)
....traces, and eventuality properties over states are decidable for lossy channel systems. The decidability results of [Fin94, CFP96, AJ96b] are fundamental since lossy systems are the natural model for fault tolerant protocols where the communication channels are not supposed to be reliable (see [AKP97, ABJ98, AAB99] for applications) For lossy channel systems, the aforementioned decidability results lead to algorithms whose termination rely on Higman s Lemma (see [A CJT00, FS01] for more examples of this phenomenon) No complexity bound is known and, e.g. Abdulla and Jonsson stated in ....
P. A. Abdulla, M. Kindahl, and D. Peled. An improved search strategy for lossy channel systems. In Proc. Joint Int. Conf. Formal Description Techniques and Protocol Specication, Testing, and Verication (FORTE/PSTV'97), Osaka, Japan, Nov.
Bisimulation and Other Undecidable Equivalences for Lossy.. - Schnoebelen (2001) (1 citation) (Correct)
.... are correct with probability 1 when messages are lost with low (less than 1 2 ) probability [ABPJ00] Hence lossy channel systems are an example of a partially analyzable in nite state system model (along with Petri nets, pushdown systems, that has important practical applications [AKP97,ABJ98,AAB99] Equivalence checking. Behavioral equivalences are a special class of veri cation problems where one asks whether a system S is equivalent to another system S 0 (or if two con gurations of a single system are equivalent) that is whether they have the same behavior . For such ....
P. A. Abdulla, M. Kindahl, and D. Peled. An improved search strategy for lossy channel systems. In Proc. Joint Int. Conf. Formal Description Techniques and Protocol Specication, Testing, and Verication (FORTE/PSTV'97), Osaka, Japan, Nov.
Establishing Qualitative Properties for Probabilistic Lossy.. - Baier, Engelen (1999) (6 citations) (Correct)
....can be solved automatically. Finkel [Fin94] considered completely specified protocols modelled by channel systems where the channels might lose their first message and showed that the termination problem is solvable. Abdulla Jonsson [AJ93] present algorithms for a reachability analysis (see also [AKP97]) and the verification against (certain types of) safety and eventually properties for lossy channel systems (LCSs) i.e. channel systems that may lose arbitrary messages. Abdulla Kindahl [AK95] have shown that also the task of establishing a branching time relation (simulation or bisimulation) ....
....require probabilistic input enabledness. This assumption allows us to reduce the question of whether a qualitative property specified by a formula f 0 as above is satisfied to a reachability problem in the underlying (non probabilistic) LCS where the latter is solvable with conventional methods [AJ93,AKP97]. The reason why we do not deal with the next step operator will be explained in Section 4. Roughly speaking, the lack of next step ensures the invariance of the formulas with respect to losing a message. This is essential for characterizing the probability for f to hold for a PLCS PL by the ....
[Article contains additional citation context not shown here]
P. Abdulla, M. Kindahl, and D. Peled. An improved search strategy for lossy channel systems. In PSTV/FORTE. Chapman-Hall, 1997.
Establishing Qualitative Properties for - Probabilistic Lossy Channel (Correct)
No context found.
P. Abdulla, M. Kindahl, and D. Peled. An improved search strategy for lossy channel systems. In PSTV/FORTE. Chapman-Hall, 1997.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC