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.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
J.A. Bergstra and J.W. Klop (1985). Algebra of Communicating Processes with Abstraction. Theoretical Computer Science 37:77–121.
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.
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.
O. Burkart, D. Caucal and B. Steffen (1996). Bisimulation collapse and the process taxonomy. This volume.
D. Caucal (1990). Graphes canoniques des graphes algébriques. Informatique Théorique et Applications (RAIRO) 24(4):339–352.
D. Caucal (1992). On the regular structure of prefix rewriting. Journal of Theoretical Computer Science 106:61–86.
D. Caucal (1993). A fast algorithm to decide on the equivalence of stateless DPDA. Informatique Théorique et Applications (RAIRO) 27(1):23–48.
S. Christensen (1993). Decidability and Decomposition in Process Algebras. Ph.D. Thesis ECS-LFCS-93-278, Department of Computer Science, University of Edinburgh.
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.
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.
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.
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.
R.J. van Glabbeek (1990). The linear time-branching time spectrum. Proceedings of CONCUR'90, Lecture Notes in Computer Science 458:278–297.
J.F. Groote (1991). A short proof of the decidability of bisimulation for normed BPA processes. Information Processing Letters 42:167–171.
J.F. Groote and H. Hüttel (1994). Undecidable equivalences for basic process algebra. Information and Computation 115(2):353–371.
M. Hack (1976). Decidability questions for Petri nets. Ph.D. Thesis, Technical Report 161, Laboratory for Computer Science, Massachusetts Institute of Technology.
L.E. Dickson (1913). Finiteness of the odd perfect and primitive abundant numbers with distinct factors. American Journal of Mathematics 35:413–422.
Y. Hirshfeld (1993). Petri Nets and the Equivalence Problem. Proceedings of CSL'93, Lecture Notes in Computer Science 832:165–174.
Y. Hirshfeld (1994). Congruences in commutative semigroups. Research report ECS-LFCS-94-291, Department of Computer Science, University of Edinburgh.
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.
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.
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.
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.
J.E. Hopcroft and J.D. Ullman (1979). Introduction to Automata Theory, Languages, and Computation. Addison Wesley.
H. Hüttel (1993). Undecidable equivalences for basic parallel processes. Proceedings of FSTTCS'93, Lecture Notes in Computer Science.
H. Hüttel and C. Stirling (1991). Actions speak louder than words: proving bisimilarity for context-free processes. Proceedings of LICS'91:376–386.
D.T. Huynh and L. Tian (1994). Deciding bisimilarity of normed context-free processes is in σ P2 . Theoretical Computer Science 123:183–197.
D.T. Huynh and L. Tian (1995). On deciding readiness and failure equivalences for processes. Information and Computation 117(2):193–205.
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.
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.
A. Korenjak and J. Hopcroft (1966). Simple deterministic languages. Proceedings of 7th IEEE Switching and Automata Theory conference:36–46.
E. Mahr (1984). An algorithm for the general Petri net reachability problem. SIAM Journal of Computing 13:441–460.
R. Milner (1984). A complete inference system for a class of regular behaviours. Journal of Computer and System Science 28:439–466.
R. Milner (1980). A Calculus of Communicating Systems. Lecture Notes in Computer Science 92.
R. Milner (1989). Communication and Concurrency. Prentice-Hall.
R. Milner and F. Moller (1990). Unique decomposition of processes. Bulletin of the European Association for Theoretical Computer Science 41:226–232.
R. Milner and F. Moller (1993). Unique decomposition of processes. Theoretical Computer Science 107:357–363.
M. Minsky (1967). Computation: Finite and Infinite Machines. Prentice-Hall.
E.F. Moore (1956). Gedanken experiments on sequential machines. In Automata Studies:129–153.
D.M.R. Park (1981). Concurrency and automata on infinite sequences. Lecture Notes in Computer Science 104:168–183.
J.L. Peterson (1981). Petri Net Theory and the Modelling of Systems. Prentice-Hall.
L. Redei (1965). The theory of finitely generated commutative semigroups. Oxford University Press.
A. Salomaa (1966). Two complete axiom systems for the algebra of regular events. Journal of the ACM 13(1):158–169.
C. Stirling (1995). Local model checking games. Proceedings of CONCUR'95, Lecture Notes in Computer Science 962:1–11.
C. Stirling (1996). Decidability of bisimulation equivalence for normed pushdown processes. This volume.
D. Taubner (1989). Finite Representations of CCS and TCSP Programs by Automata and Petri Nets. Lecture Notes in Computer Science 369.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moller, F. (1996). Infinite results. In: Montanari, U., Sassone, V. (eds) CONCUR '96: Concurrency Theory. CONCUR 1996. Lecture Notes in Computer Science, vol 1119. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61604-7_56
Download citation
DOI: https://doi.org/10.1007/3-540-61604-7_56
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61604-7
Online ISBN: 978-3-540-70625-0
eBook Packages: Springer Book Archive