SCOPUS 정보 검색 플랫폼

Information Processing Letters

Volumn 83, Issue 5, 2002, Pages 251-261

Verifying lossy channel systems has nonprimitive recursive complexity

(1) Schnoebelen, Ph a

a CNRS (France)

Author keywords

Communication protocols; Formal methods; Program correctness; Verification of infinite state systems

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; DATA PROCESSING; NETWORK PROTOCOLS; PROBLEM SOLVING; RECURSIVE FUNCTIONS; THEOREM PROVING;

LOSSY CHANNEL SYSTEMS;

FINITE AUTOMATA;

EID: 0037105927 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/S0020-0190(01)00337-4 Document Type: Article

Times cited : (116)

References (21)

1
- 84948950320
- Symbolic verification of lossy channel systems: Application to the bounded retransmission protocol
- Proc. 5th Internat. Conf. Tools and Algorithms for the Construction and Analysis of Systems (TACAS'99), Amsterdam, The Netherlands, March 1999, Springer, Berlin
- (1999) Lecture Notes in Comput. Sci. , vol.1579 , pp. 208-222
- Abdulla, P.A.¹ Annichini, A.² Bouajjani, A.³

2
- 84863933189
- On-the-fly analysis of systems with unbounded, lossy FIFO channels
- Proc. 10th Internat. Conf. Computer Aided Verification (CAV'98), Vancouver, BC, Canada, June-July 1998, Springer, Berlin
- (1998) Lecture Notes in Comput. Sci. , vol.1427 , pp. 305-318
- Abdulla, P.A.¹ Bouajjani, A.² Jonsson, B.³

3
- 84885197071
- Reasoning about probabilistic lossy channel systems
- Proc. 11th Internat. Conf. Concurrency Theory (CONCUR'2000), University Park, PA, August 2000, Springer, Berlin
- (2000) Lecture Notes in Comput. Sci. , vol.1877 , pp. 320-333
- Abdulla, P.A.¹ Baier, C.² Purushothaman Iyer, S.³ Jonsson, B.⁴

4
- 0034632154
- Algorithmic analysis of programs with well quasi-ordered domains
- (2000) Inform. and Comput. , vol.160 , Issue.1-2 , pp. 109-127
- Abdulla, P.A.¹ Čerans, K.² Jonsson, B.³ Tsay, Y.-K.⁴

5
- 0002811217
- Undecidable verification problems for programs with unreliable channels
- (1996) Inform. and Comput. , vol.130 , Issue.1 , pp. 71-90
- Abdulla, P.A.¹ Jonsson, B.²

6
- 0002811218
- Verifying programs with unreliable channels
- (1996) Inform. and Comput. , vol.127 , Issue.2 , pp. 91-101
- Abdulla, P.A.¹ Jonsson, B.²

7
- 84947706713
- Decidability of simulation and bisimulation between lossy channel systems and finite state systems
- Proc. 6th Internat. Conf. Theory of Concurrency (CONCUR'95), Philadelphia, PA, August 1995, Springer, Berlin
- (1995) Lecture Notes in Comput. Sci. , vol.962 , pp. 333-347
- Abdulla, P.A.¹ Kindahl, M.²

8
- 0009653695
- An improved search strategy for lossy channel systems
- Osaka, Japan, November 1997, Chapman & Hall, London
- (1997) Proc. Joint Internat. Conf. Formal Description Techniques and Protocol Specification, Testing, and Verification (FORTE/PSTV'97) , pp. 251-264
- Abdulla, P.A.¹ Kindahl, M.² Peled, D.³

9
- 49349119822
- Finite state description of communication protocols
- (1978) Comput. Networks ISDN Systems , vol.2 , pp. 361-372
- Von Bochmann, G.¹

10
- 0020735797
- On communicating finite-state machines
- (1983) J. ACM , vol.30 , Issue.2 , pp. 323-342
- Brand, D.¹ Zafiropulo, P.²

11
- 13544268666
- Unreliable channels are easier to verify than perfect channels
- (1996) Inform. and Comput. , vol.124 , Issue.1 , pp. 20-31
- Cécé, G.¹ Finkel, A.² Purushothaman Iyer, S.³

12
- 84878552622
- Reset nets between decidability and undecidability
- Proc. 25th Internat. Coll. Automata, Languages, and Programming (ICALP'98), Aalborg, Denmark, July 1998, Springer, Berlin
- (1998) Lecture Notes in Comput. Sci. , vol.1443 , pp. 103-115
- Dufourd, C.¹ Finkel, A.² Schnoebelen, Ph.³

13
- 84887436670
- Boundedness of Reset P/T nets
- Proc. 26th Internat. Coll. Automata, Languages, and Programming (ICALP'99), Prague, Czech Republic, July 1999, Springer, Berlin
- (1999) Lecture Notes in Comput. Sci. , vol.1644 , pp. 301-310
- Dufourd, C.¹ Jančar, P.² Schnoebelen, Ph.³

14
- 0000689483
- Decidability of the termination problem for completely specificied protocols
- (1994) Distributed Comput. , vol.7 , Issue.3 , pp. 129-135
- Finkel, A.¹

15
- 0034911369
- Well structured transition systems everywhere!
- (2001) Theoret. Comput. Sci. , vol.256 , Issue.1-2 , pp. 63-92
- Finkel, A.¹ Schnoebelen, Ph.²

16
- 0002490903
- The equality problem for vector addition systems is undecidable
- (1976) Theoret. Comput. Sci. , vol.2 , Issue.1 , pp. 77-95
- Hack, M.¹

17
- 84963086911
- Ordering by divisibility in abstract algebras
- (1952) Proc. London Math. Soc. (3) , vol.2 , Issue.7 , pp. 326-336
- Higman, G.¹

18
- 0034911490
- Nonprimitive recursive complexity and undecidability for Petri net equivalences
- (2001) Theoret. Comput. Sci. , vol.256 , Issue.1-2 , pp. 23-30
- Jančar, P.¹

19
- 84896693153
- Undecidable problems in unreliable computations
- Proc. 4th Latin American Symposium on Theoretical Informatics (LATIN'2000), Punta del Este, Uruguay, April 2000, Springer, Berlin
- (2000) Lecture Notes in Comput. Sci. , vol.1776 , pp. 377-386
- Mayr, R.¹

20
- 84976842457
- The complexity of the finite containment problem for Petri nets
- (1981) J. ACM , vol.28 , Issue.3 , pp. 561-576
- Mayr, E.W.¹ Meyer, A.R.²

21
- 84979084467
- Bisimulation and other undecidable equivalences for lossy channel systems
- Proc. 4th Internat. Symp. Theoretical Aspects of Computer Software (TACS'2001), Sendai, Japan, October 2001, Springer, Berlin
- (2001) Lecture Notes in Comput. Sci. , vol.2215 , pp. 385-399
- Schnoebelen, Ph.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.