Advertisement

Infinite results

  • Faron Moller
Invited Talk
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1119)

Abstract

Recently there has been a spurt of activity in concurrency theory centred on the analysis of infinite-state systems. Much of this work stems from a task dedicated to the study in the recently-concluded ESPRIT BRA Concur2, and much of it has subsequently appeared in the proceedings of the annual CONCUR conference. In this paper, we present an overview of various results obtained regarding expressivity, decidability, and complexity, focussing on the various techniques exploited in each case.

Keywords

Transition System Winning Strategy Reachable State Label Transition System Concurrent System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J.C.M. Baeten, J.A. Bergstra and J.W. Klop (1987). Decidability of bisimulation equivalence for processes generating context-free languages. Proceedings of PARLE'87, Lecture Notes in Computer Science 259:94–113.Google Scholar
  2. [2]
    J.C.M. Baeten, J.A. Bergstra and J.W. Klop (1993). Decidability of bisimulation equivalence for processes generating context-free languages. Journal of the ACM 40:653–682.Google Scholar
  3. [3]
    Y. Bar-Hillel, M. Perles and E. Shamir (1961). On formal properties of simple phrase structure grammars. Zeitschrift für Phonetik, Sprachwissenschaft, und Kommunikationsforschung 14:143–177.Google Scholar
  4. [4]
    J.A. Bergstra and J.W. Klop (1985). Algebra of Communicating Processes with Abstraction. Theoretical Computer Science 37:77–121.Google Scholar
  5. [5]
    J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill and L.J. Hwang (1990). Symbolic model checking 1020 states and beyond. Proceedings of LICS'90:428–439.Google Scholar
  6. [6]
    O. Burkart, D. Caucal and B. Steffen (1995). An elementary decision procedure for arbitrary context-free processes. Proceedings of MFCS'95. Lecture Notes in Computer Science 969:423–433.Google Scholar
  7. [7]
    O. Burkart, D. Caucal and B. Steffen (1996). Bisimulation collapse and the process taxonomy. This volume.Google Scholar
  8. [8]
    D. Caucal (1990). Graphes canoniques des graphes algébriques. Informatique Théorique et Applications (RAIRO) 24(4):339–352.Google Scholar
  9. [9]
    D. Caucal (1992). On the regular structure of prefix rewriting. Journal of Theoretical Computer Science 106:61–86.Google Scholar
  10. [10]
    D. Caucal (1993). A fast algorithm to decide on the equivalence of stateless DPDA. Informatique Théorique et Applications (RAIRO) 27(1):23–48.Google Scholar
  11. [11]
    S. Christensen (1993). Decidability and Decomposition in Process Algebras. Ph.D. Thesis ECS-LFCS-93-278, Department of Computer Science, University of Edinburgh.Google Scholar
  12. [12]
    S. Christensen, Y. Hirshfeld and F. Moller (1993). Decomposability, decidability and axiomatisability for bisimulation equivalence on basic parallel processes. Proceedings of LICS'93:386–396.Google Scholar
  13. [13]
    S. Christensen, Y. Hirshfeld and F. Moller (1993). Bisimulation equivalence is decidable for basic parallel processes. Proceedings of CONCUR'93, Lecture Notes in Computer Science 715:143–157.Google Scholar
  14. [14]
    S. Christensen, H. Hüttel and C. Stirling (1992). Bisimulation equivalence is decidable for all context-free processes. Proceedings of CONCUR'92, Lecture Notes in Computer Science 630:138–147.Google Scholar
  15. [15]
    S. Christensen, H. Hüttel and C. Stirling (1995). Bisimulation equivalence is decidable for all context-free processes. Information and Computation 121(2):143–148.Google Scholar
  16. [16]
    R.J. van Glabbeek (1990). The linear time-branching time spectrum. Proceedings of CONCUR'90, Lecture Notes in Computer Science 458:278–297.Google Scholar
  17. [17]
    J.F. Groote (1991). A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters 42:167–171.Google Scholar
  18. [18]
    J.F. Groote and H. Hüttel (1994). Undecidable equivalences for basic process algebra. Information and Computation 115(2):353–371.Google Scholar
  19. [19]
    M. Hack (1976). Decidability questions for Petri nets. Ph.D. Thesis, Technical Report 161, Laboratory for Computer Science, Massachusetts Institute of Technology.Google Scholar
  20. [20]
    L.E. Dickson (1913). Finiteness of the odd perfect and primitive abundant numbers with distinct factors. American Journal of Mathematics 35:413–422.Google Scholar
  21. [21]
    Y. Hirshfeld (1993). Petri Nets and the Equivalence Problem. Proceedings of CSL'93, Lecture Notes in Computer Science 832:165–174.Google Scholar
  22. [22]
    Y. Hirshfeld (1994). Congruences in commutative semigroups. Research report ECS-LFCS-94-291, Department of Computer Science, University of Edinburgh.Google Scholar
  23. [23]
    Y. Hirshfeld, M. Jerrum and F. Moller (1994). A polynomial-time algorithm for deciding equivalence of normed context-free processes. Proceedings of FOCS'94:623–631.Google Scholar
  24. [24]
    Y. Hirshfeld, M. Jerrum and F. Moller (1996). A polynomial algorithm for deciding bisimilarity of normed context-free processes. Theoretical Computer Science 158:143–159.Google Scholar
  25. [25]
    Y. Hirshfeld, M. Jerrum and F. Moller (1996). A polynomial algorithm for deciding bisimulation equivalence of normed basic parallel processes. To appear in Mathematical Structures in Computer Science.Google Scholar
  26. [26]
    Y. Hirshfeld and F. Moller (1994). A fast algorithm for deciding bisimilarity of normed context-free processes. Proceedings of CONCUR'94, Lecture Notes in Computer Science 836:48–63.Google Scholar
  27. [27]
    J.E. Hopcroft and J.D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison Wesley.Google Scholar
  28. [28]
    H. Hüttel (1993). Undecidable equivalences for basic parallel processes. Proceedings of FSTTCS'93, Lecture Notes in Computer Science.Google Scholar
  29. [29]
    H. Hüttel and C. Stirling (1991). Actions speak louder than words: proving bisimilarity for context-free processes. Proceedings of LICS'91:376–386.Google Scholar
  30. [30]
    D.T. Huynh and L. Tian (1994). Deciding bisimilarity of normed context-free processes is in σ2P. Theoretical Computer Science 123:183–197.Google Scholar
  31. [31]
    D.T. Huynh and L. Tian (1995). On deciding readiness and failure equivalences for processes. Information and Computation 117(2):193–205.Google Scholar
  32. [32]
    P. Jančar (1993). Decidability questions for bisimilarity of Petri nets and some related problems. Proceedings of STACS'94, Lecture Notes in Computer Science 775:581–592.Google Scholar
  33. [33]
    P. Jančar and F. Moller (1995). Checking regular properties of Petri nets. Proceedings of CONCUR'95, Lecture Notes in Computer Science 962:348–362.Google Scholar
  34. [34]
    A. Korenjak and J. Hopcroft (1966). Simple deterministic languages. Proceedings of 7th IEEE Switching and Automata Theory conference:36–46.Google Scholar
  35. [35]
    E. Mahr (1984). An algorithm for the general Petri net reachability problem. SIAM Journal of Computing 13:441–460.Google Scholar
  36. [36]
    R. Milner (1984). A complete inference system for a class of regular behaviours. Journal of Computer and System Science 28:439–466.Google Scholar
  37. [37]
    R. Milner (1980). A Calculus of Communicating Systems. Lecture Notes in Computer Science 92.Google Scholar
  38. [38]
    R. Milner (1989). Communication and Concurrency. Prentice-Hall.Google Scholar
  39. [39]
    R. Milner and F. Moller (1990). Unique decomposition of processes. Bulletin of the European Association for Theoretical Computer Science 41:226–232.Google Scholar
  40. [40]
    R. Milner and F. Moller (1993). Unique decomposition of processes. Theoretical Computer Science 107:357–363.Google Scholar
  41. [41]
    M. Minsky (1967). Computation: Finite and Infinite Machines. Prentice-Hall.Google Scholar
  42. [42]
    E.F. Moore (1956). Gedanken experiments on sequential machines. In Automata Studies:129–153.Google Scholar
  43. [43]
    D.M.R. Park (1981). Concurrency and automata on infinite sequences. Lecture Notes in Computer Science 104:168–183.Google Scholar
  44. [44]
    J.L. Peterson (1981). Petri Net Theory and the Modelling of Systems. Prentice-Hall.Google Scholar
  45. [45]
    L. Redei (1965). The theory of finitely generated commutative semigroups. Oxford University Press.Google Scholar
  46. [46]
    A. Salomaa (1966). Two complete axiom systems for the algebra of regular events. Journal of the ACM 13(1):158–169.Google Scholar
  47. [47]
    C. Stirling (1995). Local model checking games. Proceedings of CONCUR'95, Lecture Notes in Computer Science 962:1–11.Google Scholar
  48. [48]
    C. Stirling (1996). Decidability of bisimulation equivalence for normed pushdown processes. This volume.Google Scholar
  49. [49]
    D. Taubner (1989). Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. Lecture Notes in Computer Science 369.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Faron Moller
    • 1
  1. 1.Computing Science DepartmentUppsala UniversityUppsalaSweden

Personalised recommendations