-
1
-
-
14744282484
-
Simulating perfect channels with probabilistic lossy channels
-
Abdulla, P.A., Baier, C., Purushothaman Iyer, S., Jonsson, B.: Simulating perfect channels with probabilistic lossy channels. Information and Computation 197(1-2), 22-40 (2005)
-
(2005)
Information and Computation
, vol.197
, Issue.1-2
, pp. 22-40
-
-
Abdulla, P.A.1
Baier, C.2
Purushothaman Iyer, S.3
Jonsson, B.4
-
2
-
-
26444582943
-
Verification of probabilistic systems with faulty communication
-
Abdulla, P.A., Bertrand, N., Rabinovich, A., Schnoebelen, Ph.: Verification of probabilistic systems with faulty communication. Information and Computation 202(2), 141-165 (2005)
-
(2005)
Information and Computation
, vol.202
, Issue.2
, pp. 141-165
-
-
Abdulla, P.A.1
Bertrand, N.2
Rabinovich, A.3
Schnoebelen, P.4
-
3
-
-
3142688972
-
Using forward reachability analysis for verification of lossy channel systems
-
Abdulla, P.A., Collomb-Annichini, A., Bouajjani, A., Jonsson, B.: Using forward reachability analysis for verification of lossy channel systems. Formal Methods in System Design 25(1), 39-65 (2004)
-
(2004)
Formal Methods in System Design
, vol.25
, Issue.1
, pp. 39-65
-
-
Abdulla, P.A.1
Collomb-Annichini, A.2
Bouajjani, A.3
Jonsson, B.4
-
4
-
-
0002811218
-
Verifying programs with unreliable channels
-
Abdulla, P.A., Jonsson, B.: Verifying programs with unreliable channels. Information and Computation 127(2), 91-101 (1996)
-
(1996)
Information and Computation
, vol.127
, Issue.2
, pp. 91-101
-
-
Abdulla, P.A.1
Jonsson, B.2
-
5
-
-
33845203433
-
-
Baier, C., Bertrand, N., Schnoebelen, Ph.: On computing fixpoints in wellstructured regular model checking, with applications to lossy channel systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), 4246, pp. 347-361. Springer, Heidelberg (2006)
-
Baier, C., Bertrand, N., Schnoebelen, Ph.: On computing fixpoints in wellstructured regular model checking, with applications to lossy channel systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 347-361. Springer, Heidelberg (2006)
-
-
-
-
6
-
-
37049008643
-
Verifying nondeterministic probabilistic channel systems against ω-regular linear-time propertie
-
Baier, C., Bertrand, N., Schnoebelen, Ph.: Verifying nondeterministic probabilistic channel systems against ω-regular linear-time propertie. ACM Trans. Computational Logic 9(1) (2007)
-
(2007)
ACM Trans. Computational Logic
, vol.9
, Issue.1
-
-
Baier, C.1
Bertrand, N.2
Schnoebelen, P.3
-
7
-
-
45749087322
-
On termination for faulty channel machines
-
Bouyer, P., Markey, N., Ouaknine, J., Schnoebelen, Ph., Worrell, J.: On termination for faulty channel machines. In: Proc. STACS 2008, pp. 121-132 (2008)
-
(2008)
Proc. STACS
, pp. 121-132
-
-
Bouyer, P.1
Markey, N.2
Ouaknine, J.3
Schnoebelen, P.4
Worrell, J.5
-
8
-
-
0020735797
-
On communicating finite-state machines
-
Brand, D., Zafiropulo, P.: On communicating finite-state machines. Journal of the ACM 30(2), 323-342 (1983)
-
(1983)
Journal of the ACM
, vol.30
, Issue.2
, pp. 323-342
-
-
Brand, D.1
Zafiropulo, P.2
-
9
-
-
13544268666
-
Unreliable channels are easier to verify than perfect channels
-
Cécé, G., Finkel, A., Purushothaman Iyer, S.: Unreliable channels are easier to verify than perfect channels. Information and Computation 124(1), 20-31 (1996)
-
(1996)
Information and Computation
, vol.124
, Issue.1
, pp. 20-31
-
-
Cécé, G.1
Finkel, A.2
Purushothaman Iyer, S.3
-
10
-
-
38349078294
-
Post embedding problem is not primitive recursive, with applications to channel systems
-
Arvind, V, Prasad, S, eds, FSTTCS 2007, Springer, Heidelberg
-
Chambart, P., Schnoebelen, Ph.: Post embedding problem is not primitive recursive, with applications to channel systems. In: Arvind, V., Prasad, S. (eds.) FSTTCS 2007. LNCS, vol. 4855, pp. 265-276. Springer, Heidelberg (2007)
-
(2007)
LNCS
, vol.4855
, pp. 265-276
-
-
Chambart, P.1
Schnoebelen, P.2
-
11
-
-
47249148909
-
The ω-regular Post embedding problem
-
Amadio, R, ed, FOSSACS 2008, Springer, Heidelberg
-
Chambart, P., Schnoebelen, Ph.: The ω-regular Post embedding problem. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol. 4962, pp. 97-111. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.4962
, pp. 97-111
-
-
Chambart, P.1
Schnoebelen, P.2
-
12
-
-
51549107969
-
The ordinal recursive complexity of lossy channel systems
-
IEEE Comp. Soc. Press, Los Alamitos
-
Chambart, P., Schnoebelen, Ph.: The ordinal recursive complexity of lossy channel systems. In: Proc. LICS 2008, IEEE Comp. Soc. Press, Los Alamitos (2008)
-
(2008)
Proc. LICS
-
-
Chambart, P.1
Schnoebelen, P.2
-
13
-
-
0000689483
-
Decidability of the termination problem for completely specificied protocols
-
Finkel, A.: Decidability of the termination problem for completely specificied protocols. Distributed Computing 7(3), 129-135 (1994)
-
(1994)
Distributed Computing
, vol.7
, Issue.3
, pp. 129-135
-
-
Finkel, A.1
-
14
-
-
24944567728
-
A theory of regular MSC languages
-
Henriksen, J.G., Mukund, M., Kumar, K.N., Sohoni, M.A., Thiagarajan, P.S.: A theory of regular MSC languages. Information and Computation 202(1), 1-38 (2005)
-
(2005)
Information and Computation
, vol.202
, Issue.1
, pp. 1-38
-
-
Henriksen, J.G.1
Mukund, M.2
Kumar, K.N.3
Sohoni, M.A.4
Thiagarajan, P.S.5
-
15
-
-
82755175867
-
-
Jurdziński, M., Lazić, R.: Alternation-free modal mu-calculus for data trees. In: Proc. LICS 2007, pp. 131-140. IEEE Comp. Soc. Press, Los Alamitos (2007)
-
Jurdziński, M., Lazić, R.: Alternation-free modal mu-calculus for data trees. In: Proc. LICS 2007, pp. 131-140. IEEE Comp. Soc. Press, Los Alamitos (2007)
-
-
-
-
16
-
-
38149039027
-
Combining modal logics
-
Blackburn, P, van Benthem, J, Wolter, F, eds, ch. 15, Elsevier Science, Amsterdam
-
Kurucz, A.: Combining modal logics. In: Blackburn, P., van Benthem, J., Wolter, F. (eds.) Handbook of Modal Logics, ch. 15, vol. 3, pp. 869-926. Elsevier Science, Amsterdam (2006)
-
(2006)
Handbook of Modal Logics
, vol.3
, pp. 869-926
-
-
Kurucz, A.1
-
19
-
-
84987860312
-
On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Comp
-
Ouaknine, J., Worrell, J.: On the decidability and complexity of Metric Temporal Logic over finite words. Logical Methods in Comp. Science 3(1), 1-27 (2007)
-
(2007)
Science
, vol.3
, Issue.1
, pp. 1-27
-
-
Ouaknine, J.1
Worrell, J.2
-
20
-
-
54249107932
-
-
Pachl, J.K.: Protocol description and analysis based on a state transition model with channel expressions. In: Proc. PSTV 1987, pp. 207-219. North-Holland, Amsterdam (1987)
-
Pachl, J.K.: Protocol description and analysis based on a state transition model with channel expressions. In: Proc. PSTV 1987, pp. 207-219. North-Holland, Amsterdam (1987)
-
-
-
-
21
-
-
23944465568
-
The verification of probabilistic lossy channel systems
-
Baier, C, et al, eds, Validation of Stochastic Systems, A Guide to Current Research, Springer, Heidelberg
-
Schnoebelen, Ph.: The verification of probabilistic lossy channel systems. In: Baier, C., et al. (eds.) Validation of Stochastic Systems - A Guide to Current Research. LNCS, vol. 2925, pp. 445-465. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.2925
, pp. 445-465
-
-
Schnoebelen, P.1
|