Undecidable problems in unreliable computations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1776 LNCS, Issue , 2000, Pages 377-386

  Mayr, Richard ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDEDNESS; BROADCAST COMMUNICATION; COUNTER MACHINES; GENERAL TOOLS; PARAMETERIZED PROBLEMS; UNDECIDABILITY; UNRELIABLE CHANNELS; VECTOR ADDITION SYSTEMS; FIFO CHANNELS;

MODEL CHECKING; PETRI NETS; VECTORS; INFORMATION SCIENCE;

INFORMATION SCIENCE; MODEL CHECKING;

EID: 84896693153     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10719839_37     Document Type: Conference Paper

References (24)

1. P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In 10th Intern. Conf. on Computer Aided Verification (CAV'98). LNCS 1427, 1998.
2. P. Abdulla and B. Jonsson. Verifying Programs with Unreliable Channels. In LICS'93. IEEE, 1993.
3. P. Abdulla and B. Jonsson. Undecidable verification problems for programs with unreliable channels. Information and Computation, 130(1):71-90, 1996.
4. A. Bouajjani and R. Mayr. Model checking lossy vector addition systems. In Proc. of STACS'99, Volume 1563 of LNCS. Springer Verlag, 1999.
5. G. Cécé, A. Finkel, and S.P. Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Information and Computation, 124(1):20-31, 1996.
6. S. Christensen, Y. Hirshfeld, and F. Moller. Bisimulation equivalence is decidable for Basic Parallel Processes. In E. Best, editor, Proceedings of CONCUR 93, Volume 715 of LNCS. Springer Verlag, 1993.
7. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. Volume 131 of LNCS, pages 52-71, 1981.
8. C. Dufourd, A. Finkel, and Ph. Schnoebelen. Reset nets between decidability and undecid-ability. In Proc. of ICALP'98, Volume 1443 of LNCS. Springer Verlag, 1998.
9. C. Dufourd, P. Jančar, and Ph. Schnoebelen. Boundedness of Reset P/T Nets. In Proc. of ICALP'99, Volume 1644 of LNCS. Springer Verlag, 1999.
10. E.A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science: Volume B, FORMAL MODELS AND SEMANTICS. Elsevier, 1994.
11. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proc. of LICS'99. IEEE, 1999.
12. J. Esparza and A. Kiehn. On the model checking problem for branching time logics and Basic Parallel Processes. In CAV'95, Volume 939 of LNCS. Springer Verlag, 1995.
13. M. Hennessy and R. Milner. On observing nondeterminism and concurrency. Volume 85 of LNCS, pages 295-309, 1980.
14. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of Association of Computer Machinery, 32:137-162, 1985.
15. Y. Hirshfeld, M. Jerrum, and F. Moller. A polynomial-time algorithm for deciding bisimulation equivalence of normed Basic Parallel Processes. Journal of Mathematical Structures in Computer Science, 6:251-259, 1996.
16. D. Kozen. Results on the propositional μ-calculus. TCS, 27:333-354, 1983.
17. E. Mayr. An algorithm for the general Petri net reachability problem. SIAM Journal of Computing, 13:441-460, 1984.
18. R. Mayr. Weak bisimulation and model checking for Basic Parallel Processes. In Foundations of Software Technology and Theoretical Computer Science (FST&TCS'96), Volume 1180 of LNCS. Springer Verlag, 1996.
19. M.L. Minsky. Computation: Finite and Infinite Machines. Prentice-Hall, 1967.
20. F. Moller. Infinite results. in Ugo Montanari and Vladimiro Sassone, editors, Proceedings of CONCUR'96, Volume 1119 of LNCS. Springer Verlag, 1996.
21. J.L. Peterson. Petri net theory and the modeling of systems. Prentice-Hall, 1981.
22. A. Pnueli. The temporal logic of programs. In FOCS'77. IEEE, 1977.
23. K. Ruohonen. Onsome variants of Post's correspondence problem. Acta Informatica, 19:357-367, 1983.
24. H. Yen. A unified approach for deciding the existence of certain Petri net paths. Information and Computation, 96(1):119-137, 1992.