Undecidable problems in unreliable computations

Theoretical Computer Science

Volumn 297, Issue 1-3, 2003, Pages 337-354

  Mayr, Richard ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Counter machines; Decidability; Lossy counter machines

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL METHODS; PETRI NETS; PROBLEM SOLVING;

UNRELIABLE COMPUTATIONS;

COMPUTER SCIENCE;

EID: 0037287840     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00646-1     Document Type: Conference Paper

References (30)

1. Abdulla P., Bouajjani A., Jonsson B. On-the-fly analysis of systems with unbounded, lossy fifo channels. 10th Internat. Conf. on Computer Aided Verification (CAV'98). Lecture Notes in Computer Science. Vol. 1427:1998;Springer, Berlin.
2. P. Abdulla, B. Jonsson, Verifying programs with unreliable channels, in: LICS'93, IEEE, New York, 1993.
3. Abdulla P., Jonsson B. Undecidable verification problems for programs with unreliable channels. Inform. and Comput. 130(1):1996;71-90.
4. A. Bouajjani, P. Habermehl, Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations, in: Proc. ICALP'97, Lecture Notes in Computer Science, Vol. 1256, Springer, Berlin, 1997.
5. A. Bouajjani, R. Mayr, Model checking lossy vector addition systems, in: Proc. STACS'99, Lecture Notes in Computer Science, Vol. 1563, Springer, Berlin, 1999.
6. Cécé G., Finkel A., Iyer S.P. Unreliable channels are easier to verify than perfect channels. Inform. and Comput. 124(1):1996;20-31.
7. S. Christensen, Decidability and decomposition in process algebras, Ph.D. Thesis, Edinburgh University, 1993.
8. Christensen S., Hirshfeld Y., Moller F. Bisimulation equivalence is decidable for basic parallel processes. Best E. Proc. CONCUR 93. Lecture Notes in Computer Science. Vol. 715:1993;Springer, Berlin.
9. Clarke E.M., Emerson E.A. Design and Synthesis of Synchronization Skeletons Using Branching Time Temporal Logic. Lecture Notes in Computer Science. Vol. 131:1981;52-71.
10. Dickson L.E. Finiteness of the odd perfect and primitive abundant numbers with distinct factors. Amer. J. Math. 35:1913;413-422.
11. C. Dufourd, Réseaux de Petri avec Reset/Transfert: Décidabilité et indécidabilité, Ph.D. Thesis, ENS de Cachan, 1998.
12. C. Dufourd, A. Finkel, Ph. Schnoebelen, Reset nets between decidability and undecidability, in: Proc. ICALP'98, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998.
13. C. Dufourd, P. Jančar, Ph. Schnoebelen, Boundedness of reset P/T nets, in: Proc. ICALP'99, Lecture Notes in Computer Science, Vol. 1644, Springer, Berlin, 1999.
14. E.A. Emerson, Temporal and modal logic, in: J. van Leeuwen (Ed.), Handbook of Theoretical Computer Science : Vol. B, Formal Models and Semantics, Elsevier, Amsterdam, 1994.
15. Esparza J. Decidability of model checking for infinite-state concurrent systems. Acta Inform. 34:1997;85-107.
16. J. Esparza, A. Finkel, R. Mayr, On the verification of broadcast protocols, in: Proc. LICS'99, IEEE, New York, 1999.
17. J. Esparza, A. Kiehn, On the model checking problem for branching time logics and basic parallel processes, in: CAV'95, Lecture Notes in Computer Science, Vol. 939, Springer, Berlin, 1995, pp. 353-366.
18. M. Hennessy, R. Milner, On Observing Nondeterminism and Concurrency, Lecture Notes in Computer Science, Vol. 85, 1980, pp. 295-309.
19. Hennessy M., Milner R. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach. 32:1985;137-162.
20. Hirshfeld Y., Jerrum M., Moller F. A polynomial-time algorithm for deciding bisimulation equivalence of normed basic parallel processes. J. Math. Struct. Comput. Sci. 6:1996;251-259.
21. Kozen D. Results on the propositional. μ -calculus Theoret. Comput. Sci. 27:1983;333-354.
22. Mayr E. An algorithm for the general Petri net reachability problem. SIAM J. Comput. 13:1984;441-460.
23. R. Mayr, Weak bisimulation and model checking for basic parallel processes, in: Foundations of Software Technology and Theoretical Computer Science (FST& TCS'96) Lecture Notes in Computer Science, Vol. 1180, Springer, Berlin, 1996.
24. R. Mayr, On the complexity of bisimulation problems for basic parallel processes, in: Proc. ICALP 2000, Lecture Notes in Computer Science, Vol. 1853, Springer, Berlin, 2000.
25. Minsky M.L. Computation: Finite and Infinite Machines. 1967;Prentice-Hall, Englewood Cliffs, NJ.
26. F. Moller, Infinite results, in: U. Montanari, V. Sassone (Eds.), Proc. CONCUR'96, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996.
27. Peterson J.L. Petri Net Theory and the Modeling of Systems. 1981;Prentice-Hall, Englewood Cliffs, NJ.
28. A. Pnueli, The temporal logic of programs, in: FOCS'77, IEEE, New York, 1977.
29. Ruohonen K. On some variants of Post's correspondence problem. Acta Inform. 19:1983;357-367.
30. Yen H. A unified approach for deciding the existence of certain Petri net paths. Inform. and Comput. 96(1):1992;119-137.