Deprecated: The each() function is deprecated. This message will be suppressed on further calls in /home/zhenxiangba/zhenxiangba.com/public_html/phproxy-improved-master/index.php on line 456
Publications of Mogens Nielsen
[go: Go Back, main page]
Publications of Mogens Nielsen
The publications are available as pdf and BibTeX.

    Journal Publications

  1. Marcin Jurdzinski, Mogens Nielsen, and Jirí Srba. Undecidability of domino games and Hhp-bisimilarity. Information and Computation, 2003. To appear.
  2. Mogens Nielsen and Frank D. Valencia. Temporal constraint programming: A framework for discrete-timed systems. Association for Logic Programming Newsletter, 15(4), 2003.
  3. Mogens Nielsen, Catuscia Palamidessi, and Frank D. Valencia. Temporal concurrent constraint programming: Denotation, logic and applications. Nordic Journal of Computing, 9(2):145-188, 2002. Shorter version appears in Brauer, Ehrig, Karhumäki and Salomaa, editors, Formal and Natural Computing, LNCS 2300, 2001, pages 298-321.
  4. Mogens Nielsen and Thomas S. Hune. Bisimulation and open maps for timed transition systems. Fundamenta Informaticae, 38(1-2):61-77, 1999.
  5. Allan Cheng and Mogens Nielsen. Open maps, behavioural equivalences, and congruences. Theoretical Computer Science, 190(1):87-112, January 1998. Also availabe as BRICS Report RS-96-2.
  6. André Joyal, Mogens Nielsen, and Glynn Winskel. Bisimulation from open maps. Information and Computation, 127(2):164-185, June 1996. LICS '93 special issue. Also availabe as BRICS Report RS-94-7.
  7. Mogens Nielsen and Glynn Winskel. Petri nets and bisimulation. Theoretical Computer Science, 153(1-2):211-244, January 1996.
  8. Vladimiro Sassone, Mogens Nielsen, and Glynn Winskel. Models for concurrency: Towards a classification. Theoretical Computer Science, 170(1-2):297-348, January 1996. Earlier version appears in Bakker, de Roever and Rozenberg, editors, A Decade of Concurrency: Reflections and Perspectives, REX School/Symposium, REX '94 Proceedings, LNCS 803, 1994, pages 425-476, under the title Relationships between Models for Concurrency.
  9. Mogens Nielsen and Christian Clausen. Games and logics for a noninterleaving bisimulation. Nordic Journal of Computing, 2:222-250, 1995.
  10. Mogens Nielsen, Grzegorz Rozenberg, and P. S. Thiagarajan. Transition systems, event structures, and unfoldings. Information and Computation, 118(2):191-207, 1995.
  11. Javier Esparza and Mogens Nielsen. Decidability in Petri nets - A survey. Bulletin of the EATCS, 52:244-262, 1994.
  12. Javier Esparza and Mogens Nielsen. Decidability issues for Petri nets. Journal of Information Processing and Cybernet. EIK, 2:222-250, 1994.
  13. Vladimiro Sassone, Mogens Nielsen, and Glynn Winskel. A classification of models for concurrency. Lecture Notes in Computer Science, 715:82-96, 1993.
  14. Mogens Nielsen, Grzegorz Rozenberg, and P. S. Thiagarajan. Elementary transition systems. Theoretical Computer Science, 96(1):3-33, 1992.
  15. Mogens Nielsen, Grzegorz Rozenberg, and P. S. Thiagarajan. Elementary transition systems and refinement. Acta Informatica, 29(6-7):555-578, November 1992.
  16. Mogens Nielsen, Grzegorz Rozenberg, and P. S. Thiagarajan. Behavioural notions for elementary net systems. Distributed Computing, 4:45-57, 1990.
  17. Mogens Nielsen, Gordon Plotkin, and Glynn Winskel. Petri nets, event structures and domains, part I. Theoretical Computer Science, 13(1):85-108, January 1981.
  18. Mogens Nielsen. EOL systems with control devices. Acta Informatica, 4(4):373-386, 1975.
  19. Mogens Nielsen. On the decidability of some equivalence problems for D0L-systems. Information and Control, 25(2):166-193, June 1974.
  20. Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, and Sven Skyum. Nonterminals, homomorphisms and codings in different variations of OL-systems. I. Deterministic systems. Acta Informatica, 4(1):87-106, November 1974.
  21. Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, and Sven Skyum. Nonterminals, homomorphisms and codings in different variations of OL-systems. II. Nondeterministic systems. Acta Informatica, 3(4):357-364, October 1974.

    Books and Parts of Books

  22. Mogens Nielsen and Uffe H. Engberg, editors. Foundations of Software Science and Computation Structures; Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS '02, FoSSaCS '02 Proceedings (Grenoble, France, April 10-12, 2002), volume 2303. Berlin: Springer-Verlag, 2002.
  23. Mogens Nielsen and Frank D. Valencia. Temporal concurrent constraint programming: Applications and behavior. In Wilfried Brauer, Hartmut Ehrig, Juhani Karhumäki, and Arto Salomaa, editors, Formal and Natural Computing, volume 2300 of Lecture Notes in Computer Science, chapter IV, Concurrent Computing, pages 298-324. Berlin: Springer-Verlag, 2002. Also availabe as BRICS Report RS-01-48.
  24. Kim G. Larsen and Mogens Nielsen, editors. Concurrency Theory: 12th International Conference, CONCUR '01 Proceedings (Aalborg, Denmark, August 21-24, 2001), volume 2154 of Lecture Notes in Computer Science. Springer Verlag, August 2001.
  25. Mogens Nielsen, editor. Current Trends in Theoretical Computer Science Entering the 21st Century, chapter Concurrency, pages 437-542. World Scientific, 2001.
  26. Uffe H. Engberg and Mogens Nielsen. A calculus of communicating systems with label passing--ten years after. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language, and Interaction; Essays in Honour of Robin Milner, Foundations of Computing, chapter V, Mobility, pages 599-622. MIT Press, April 2000. 722 pp.
  27. Mogens Nielsen and Branislav Rovan, editors. Mathematical Foundations of Computer Science: 25th International Symposium, MFCS '00 Proceedings (Bratislava, Slovak Republic, August 28 - September 1, 2000), volume 1893 of Springer Lecture Notes in Computer Science. Springer Verlag, August 2000.
  28. Mogens Nielsen and Dan Simpson, editors. 21st International Conference on Application and Theory of Petri Nets, ICATPN '00 Proceedings (Aarhus, Denmark, June 26-30, 2000), volume 1825 of Springer Lecture Notes in Computer Science. Springer Verlag, June 2000.
  29. Peter van Emde Boas, Jiri Wiedermann, and Mogens Nielsen, editors. 26th International Colloquium on Automata, Languages, and Programming, ICALP '99 Proceedings (Prague, Czech Republic July 11-15, 1999), volume 1644 of Lecture Notes in Computer Science. Springer-Verlag, 1999.
  30. Mogens Nielsen and Vladimiro Sassone. Petri nets and other models for concurrency. In Wolfgang Reisig and Grzegorz Rozenberg, editors, Lectures on Petri Nets I: Basic Models (Daghstuhl, Germany, October 7-18, 1996), volume 1491 of Lecture Notes in Computer Science, pages 587-642. Berlin: Springer-Verlag, December 1998.
  31. Mogens Nielsen and Wolfgang Thomas, editors. European Association for Computer Science Logic: 11th International Workshop, CSL '97 Selected Papers (Aarhus, Denmark, August 23-29, 1997), volume 1414 of Lecture Notes in Computer Science. EACSL, Berlin: Springer-Verlag, May 1998.
  32. Mogens Nielsen and Wolfgang Thomas, editors. Preliminary Proceedings of the Annual Conference of the European Association for Computer Science Logic, CSL '97 (Aarhus, Denmark, August 23-29, 1997), number NS-97-1 in Notes Series, Department of Computer Science, University of Aarhus, August 1997. BRICS. vi+432 pp.
  33. Glynn Winskel and Mogens Nielsen. Categories in concurrency. In Andrew M. Pitts and Peter Dybjer, editors, Semantics and Logics of Computation, Publications of the Newton Institute, pages 299-354. Cambridge University Press, 1997.
  34. Allan Cheng, Kim G. Larsen, and Mogens Nielsen, editors. Programme and Abstracts of the BRICS Autumn School on Verification (Aarhus, Denmark, October 28 - November 1, 1996), number NS-96-2 in Notes Series, Aarhus, August 1996. BRICS, Basic Research in Computer Science. ii+18pp.
  35. Peter D. Mosses, Mogens Nielsen, and Michael I. Schwartzbach, editors. TAPSOFT '95: Theory and Practice of Software Development, number 915 in Lecture Notes in Computer Science. Springer-Verlag, 1995.
  36. Mogens Nielsen and Glynn Winskel. The Book of Traces, chapter Trace Structures and other Models for Concurrency. World Scientific, Spring 1995. 45 pp of 600 pp (approx.).
  37. Glynn Winskel and Mogens Nielsen. Handbook of Logic in Computer Science, chapter Models for Concurrency, pages 1-148. Oxford University Press, 1995.
  38. Uffe H. Engberg, Mogens Nielsen, and Glynn Winskel, editors. Models, Languages and logics for Concurrent Distributed Systems, CEDISYS Workshop, Aarhus, Denmark, May 21-24, 1991, number DAIMI PB-392 in PB Series, April 1992.
  39. Mogens Nielsen and Erik Meineche Schmidt, editors. 9th Colloquium on Automata, Languages, and Programming, ICALP '82 Proceedings (Aarhus, Denmark, July 12-16, 1982), volume 140 of Lecture Notes in Computer Science. Springer-Verlag, 1982.

    Conference and Workshop Publications

  40. Mogens Nielsen, Catuscia Palamidessi, and Frank D. Valencia. A calculus for temporal concurrent constraint programming. In Luca Aceto and Prakash Panangaden, editors, Expressiveness in Concurrency: 8th International Workshop, EXPRESS '02 Proceedings (Aalborg, Denmark, August 20, 2001), volume 52(1) of Electronic Notes in Theoretical Computer Science. Elsevier Science Publishers, 2002. Short abstract (not in proceedings).
  41. Mogens Nielsen, Catuscia Palamidessi, and Frank D. Valencia. On the expressive power of temporal concurrent constraint programming languages. In Frank Pfenning, editor, 4th International Conference on Principles and Practice of Declarative Programming; The conference is affiliated the colloquium on Principles, Logics, and Implementations of high-level programming language (PLI '02), PPDP '02 Proceedings (Pittsburgh, Pennsylvania, USA, October 6-8, 2002), pages 156-157. Association for Computing Machinery (ACM), ACM Press, 2002. Also availabe as BRICS Report RS-02-22.
  42. Mogens Nielsen and P. S. Thiagarajan. Regular event structures and finite Petri nets: The conflict-free case. In Javier Esparza and Charles Lakos, editors, Proceedings of the International Conference on Application and Theory of Petri Nets, 2002, volume 2360 of Lecture Notes in Computer Science, pages 335-393. Berlin: Springer-Verlag, July 2002.
  43. Mogens Nielsen. Modelling with partial orders -- Why and why not? In Fernando Orejas, Paul Spirakis, and Jan van Leeuwen, editors, 28th International Colloquium on Automata, Languages, and Programming, ICALP '01 Proceedings (Crete, Greece, July 18-12, 2001), volume 2076 of Lecture Notes in Computer Science, pages 61-63. Springer-Verlag, August 2001.
  44. Mogens Nielsen, Vladimiro Sassone, and Jirí Srba. Properties of distributed timed-arc Petri nets. In Ramesh Hariharan, Madhavan Mukund, and V. Vinay, editors, Foundations of Software Technology and Theoretical Computer Science: 21st Conference, FST&TCS '01 Proceedings (Bangalore, India, December 13-15, 2001), volume 2245 of Lecture Notes in Computer Science, pages 280-291. Springer-Verlag, 2001.
  45. Mogens Nielsen, Vladimiro Sassone, and Jirí Srba. Towards a notion of distributed time for Petri nets. In José-Manuel Colom and Maciej Koutny, editors, 22nd International Conference on Application and Theory of Petri Nets, ICATPN '01 Proceedings (Newcastle upon Tyne, UK, June 25-29, 2001A), volume 2075 of Lecture Notes in Computer Science, pages 23-31. Berlin: Springer-Verlag, 2001.
  46. Marcin Jurdzinski and Mogens Nielsen. Hereditary history preserving bisimilarity is undecidable. In Horst Reichel and Sophie Tison, editors, 17th Annual Symposium on Theoretical Aspects of Computer Science Proceedings, STACS '00 Proceedings (Lille, France, February 17-19, 2000), volume 1770 of Lecture Notes in Computer Science, pages 358-369. Berlin: Springer-Verlag, February 2000. Also availabe as BRICS Report RS-99-19.
  47. Thomas S. Hune and Mogens Nielsen. Timed bisimulation and open maps. In Luboš Brim, Jozef Gruska, and Ji rí Zlatuška, editors, Mathematical Foundations of Computer Science: 23rd International Symposium, MFCS '98 Proceedings (Brno, Czech Republic, August 24-28, 1998), volume 1450 of Lecture Notes in Computer Science, pages 378-387. Berlin: Springer-Verlag, August 1998. Also availabe as BRICS Report RS-98-4.
  48. Mogens Nielsen. Reasoning about the past. In Luboš Brim, Jozef Gruska, and Ji rí Zlatuška, editors, Mathematical Foundations of Computer Science: 23rd International Symposium, MFCS '98 Proceedings (Brno, Czech Republic, August 24-28, 1998), volume 1450 of Lecture Notes in Computer Science, pages 117-128. Berlin: Springer-Verlag, August 1998. Invited Lecture.
  49. Glynn Winskel and Mogens Nielsen. Presheaves as transition systems. In Doron A. Peled, Vaughan R. Pratt, and Gerard J. Holzmann, editors, Partial Order Methods in Verification, DIMACS Workshop (Princeton, NJ, USA, July 24-26, 1996), volume 29 of Discrete Mathematics and Theoretical Computer Science, pages 129-140. American Mathematical Society, 1997.
  50. Allan Cheng and Mogens Nielsen. Open maps, behavioural equivalences and congruences. In Hélène Kirchner, editor, Trees in Algebra and Programming: 21st International Colloquium, CAAP '96 Proceedings (Linköping, Sweden, April 22-24, 1996), volume 1059 of Lecture Notes in Computer Science, pages 257-272. Springer-Verlag, 1996.
  51. Nils Klarlund, Mogens Nielsen, and Kim Sunesen. Automated logical verification based on trace abstractions. In The Fifteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '96 Proceedings (Philadelphia, Pennsylvania, USA, May 23-26, 1996), pages 101-110. Association for Computing Machinery (ACM), ACM Press, 1996. Also availabe as BRICS Report RS-95-53.
  52. Nils Klarlund, Kim Sunesen, and Mogens Nielsen. Using second-order logic over finite domains for specification and verification. In Manfred Broy, Stephan Merz, and Katharina Spies, editors, Formal Systems Specification: The RPC-Memory Specification Case Study, FSS '96 Selected Solutions (Dagstuhl, Germany, September 26-30, 1994), volume 1169 of Lecture Notes in Computer Science, pages 341-374. Springer-Verlag, 1996. Also availabe as BRICS Report RS-95-54, under the title A Case Study in Automated Verification Based on Trace Abstractions.
  53. Kim Sunesen and Mogens Nielsen. Behavioural equivalence for infinite systems -- partially decidable! In Jonathan Billington and Wolfgang Reisig, editors, 17th International Conference on Application and Theory of Petri Nets, ICATPN '96 Proceedings (Osaka, Japan, June 24-29, 1996), volume 1091 of Lecture Notes in Computer Science, pages 460-479. Berlin: Springer-Verlag, 1996. Also availabe as BRICS Report RS-95-55.
  54. Glynn Winskel and Mogens Nielsen. Presheaves as transition systems. In Doron A Peled, Vaughan R. Pratt, and Gerard J. Holzmann, editors, DIMACS Workshop on Partial Order Methods in Verification, POMIV '96 Proceedings (Princeton University, Princeton, New Jersey, USA, July 24-26, 1996), volume 29 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 129-140. American Mathematical Society Press (AMS), American Mathematical Society Press (AMS), 1996.
  55. Mogens Nielsen and Allan Cheng. Observing behaviour categorically. In P.S. Thiagarajan, editor, Foundations of Software Technology and Theoretical Computer Science: 15th Conference, FST&TCS '95 Proceedings (Bangalore India, December 18-20, 1995), volume 1026 of Lecture Notes in Computer Science, pages 263-278. Springer-Verlag, 1995. Also availabe as BRICS Report RS-95-23 with the title Open Maps (at) Work.
  56. Mogens Nielsen, Lutz Priese, and Vladimiro Sassone. Characterizing behavioural congruences for Petri nets. In Insup Lee and Scott A. Smolka, editors, Concurrency Theory: 6th International Conference, CONCUR '95 Proceedings (Philadelphia, PA, USA, August 21-24, 1995), volume 962 of Lecture Notes in Computer Science, pages 175-189. Berlin: Springer-Verlag, 1995.
  57. Mogens Nielsen and Christian Clausen. Bisimulation for models in concurrency. In Bengt Jonsson and Joachim Parrow, editors, Concurrency Theory: 5th International Conference, CONCUR '94 Proceedings (Uppsala, Sweden, August 22-25, 1994), volume 836 of Lecture Notes in Computer Science, pages 385-400. Berlin: Springer-Verlag, 1994.
  58. Mogens Nielsen and Christian Clausen. Bisimulations, games, and logic. In J. Karhumäki, H. Maurer, and Grzegorz Rozenberg, editors, Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa, RTTCS '94 Selected Papers, volume 812 of Lecture Notes in Computer Science, pages 289-305. Berlin: Springer-Verlag, 1994. Also availabe as BRICS Report RS-94-6.
  59. Mogens Nielsen, Vladimiro Sassone, and Glynn Winskel. Relationships between models for concurrency. In J.W. de Bakker, Willem-Paul de Roever, and Grzegorz Rozenberg, editors, A Decade of Concurrency: Reflections and Perspectives, REX School/Symposium, REX '94 Proceedings (Noordwijkerhout, The Netherlands, June 1-4, 1993), volume 803 of Lecture Notes in Computer Science, pages 425-476. Berlin: Springer-Verlag, 1994. Extended version with the title Models for Concurrency: Towards a Classificationappears in Theoretical Computer Science 170(1-2):297-348 (1996).
  60. André Joyal, Mogens Nielsen, and Glynn Winskel. Bisimulation and open maps. In Eighth Annual IEEE Symposium on Logic in Computer Science, LICS '93 Proceedings (Montreal, Canada, June 19-23, 1993), pages 418-427. IEEE Computer Society, IEEE Press, 1993.
  61. Vladimiro Sassone, Mogens Nielsen, and Glynn Winskel. A classification of models for concurrency (extended abstract). In Eike Best, editor, CONCUR '93: 4th International Conference on Concurrency Theory, volume 715 of Lecture Notes in Computer Science, pages 82-96, Hildesheim, Germany, 23-26August 1993. Springer-Verlag.
  62. Vladimiro Sassone, Mogens Nielsen, and Glynn Winskel. Deterministic behavioural models for concurrency. In A. Borzyszkowski et al., editors, Proceedings of the 18th Mathematical Foundations of Computer Science (MFCS'93), Gdansk (Polen) 1993, number 711 in Lecture Notes in Computer Science, pages 682-692, Berlin-Heidelberg-New York, 1993. Springer.
  63. Madhavan Mukund and Mogens Nielsen. CCS, location and asynchronous transition systems. In R. K. Shyamasundar, editor, Foundations of Software Technology and Theoretical Computer Science, 12th Conference, FSTTCS '92 Proceedings (New Delhi, India, December 18-20, 1992), volume 652 of Lecture Notes in Computer Science, pages 328-341. Springer-Verlag, 1992.
  64. Mogens Nielsen. Models for concurrency. In Andrzej Tarlecki, editor, Mathematical Foundations of Computer Science 1991, 16th International Symposium, MFCS '91 Proceedings (Kazimierz Dolny, Poland, September 9-13, 1991), volume 520 of Lecture Notes in Computer Science, pages 43-46. Springer-Verlag, 1991.
  65. Mogens Nielsen, Uffe H. Engberg, and Kim Skak Larsen. Fully abstract models for a process language with refinement. In J. W. de Bakker, W. P. de Roever, and G. Rozenberg, editors, REX School and Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, The Netherlands, May/June 1988, volume 354 of Lecture Notes in Computer Science, pages 523-548. Springer-Verlag, 1989.
  66. Mogens Nielsen. CCS - and its relationship to net theory. In Wilfried Brauer, Wolfgang Reisig, and Grzegorz Rozenberg, editors, Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986, Part II, Proceedings of an Advanced Course, Bad Honnef, September 8-19, 1986, volume 255 of Lecture Notes in Computer Science, pages 393-415. Springer-Verlag, 1986.
  67. César Fernández, Mogens Nielsen, and P. S. Thiagarajan. A note on observable occurrence nets. In Grzegorz Rozenberg, Hartmann J. Genrich, and Gérard Roucairol, editors, Advances in Petri Nets 1984, European Workshop on Applications and Theory in Petri Nets, covers the last two years which include the workshop 1983 in Toulouse and the workshop 1984 in Aarhus, selected papers, volume 188 of Lecture Notes in Computer Science, pages 122-138. Springer-Verlag, 1985.
  68. Mogens Nielsen and P. S. Thiagarajan. Degrees of non-determinism and concurrency: A Petri net view. In Mathai Joseph and R. K. Shyamasundar, editors, Foundations of Software Technology and Theoretical Computer Science, Fourth Conference, FSTTCS '84 Proceedings (Bangalore, India, December 13-15, 1984), volume 181 of Lecture Notes in Computer Science, pages 89-117. Springer-Verlag, 1984.
  69. Mogens Nielsen. L systems. In Grzegorz Rozenberg and Arto Salomaa, editors, L Systems; Most of the papers were presented at a conference in Aarhus, Denmark, January 14-25, 1974, volume 15 of Lecture Notes in Computer Science, pages 142-145. Springer-Verlag, 1974.

    Research Reports

  70. Mogens Nielsen, Catuscia Palamidessi, and Frank D. Valencia. On the expressive power of concurrent constraint programming languages. Research Series RS-02-22, BRICS, Basic Research in Computer Science, Aarhus, May 2002. 34 pp. Appears in Pfenning, editor, 4th International Conference on Principles and Practice of Declarative Programming, PPDP '02 Proceedings, 2002, pages 156-157.
  71. Mogens Nielsen and Frank D. Valencia. Temporal concurrent constraint programming: Applications and behavior. Research Series RS-01-48, BRICS, Basic Research in Computer Science, Aarhus, December 2001. 36 pp. Appears in Brauer, Ehrig, Karhumäki and Salomaa, editors, Formal and Natural Computing, LNCS 2300, 2001, pages 298-321.
  72. Marcin Jurdzinski and Mogens Nielsen. Hereditary history preserving bisimilarity is undecidable. Research Series RS-99-19, BRICS, Basic Research in Computer Science, Aarhus, June 1999. 18 pp. An extended abstract appears in Reichel and Tison, editors, 17th Annual Symposium on Theoretical Aspects of Computer Science Proceedings, STACS '00 Proceedings, LNCS 1770, 2000, pages 358-369.
  73. Marcin Jurdzinski and Mogens Nielsen. Hereditary history preserving simulation is undecidable. Research Series RS-99-1, BRICS, Basic Research in Computer Science, Aarhus, January 1999. 15 pp.
  74. Mogens Nielsen and Thomas S. Hune. Timed bisimulation and open maps. Research Series RS-98-4, BRICS, Basic Research in Computer Science, Aarhus, February 1998. 27 pp. Appears in Brim, Gruska and Zlatuška, editors, Mathematical Foundations of Computer Science: 23rd International Symposium, MFCS '98 Proceedings, LNCS 1450, 1998, pages 378-387.
  75. Allan Cheng and Mogens Nielsen. Open maps, behavioural equivalences, and congruences. Research Series RS-96-2, BRICS, Basic Research in Computer Science, Aarhus, January 1996. 25 pp. A short version of this paper appeared in Kirchner, editor, Trees in Algebra and Programming: 21st International Colloquium, CAAP '96 Proceedings, LNCS 1059, 1996, pages 257-272, and a full version appears in Theoretical Computer Science, 190(1):87-112, January 1998.
  76. Allan Cheng and Mogens Nielsen. Open maps (at) work. Research Series RS-95-23, BRICS, Basic Research in Computer Science, Aarhus, April 1995. 33 pp. Appears with the title Observing Behaviour Categorically in Thiagarajan, editor, Foundations of Software Technology and Theoretical Computer Science: 15th Conference, FST&TCS '95 Proceedings, LNCS 1026, 1995, pages 263-278.
  77. Nils Klarlund, Mogens Nielsen, and Kim Sunesen. Automated logical verification based on trace abstractions. Research Series RS-95-53, BRICS, Basic Research in Computer Science, Aarhus, November 1995. 19 pp. Appears in The Fifteenth Annual ACM Symposium on Principles of Distributed Computing, PODC '96 Proceedings, 1996, pages 101-110.
  78. Mogens Nielsen and Kim Sunesen. Behavioural equivalence for infinite systems -- partially decidable! Research Series RS-95-55, BRICS, Basic Research in Computer Science, Aarhus, November 1995. 38 pp. Full version of paper appearing in Billington and Reisig, editors, 17th International Conference on Application and Theory of Petri Nets, ICATPN '96 Proceedings, LNCS 1091, 1996, pages 460-479.
  79. Nils Klarlund, Mogens Nielsen, and Kim Sunesen. A case study in automated verification based on trace abstractions. Research Series RS-95-54, BRICS, Basic Research in Computer Science, Aarhus, November 1995. 35 pp. Full version appears in Broy, Merz and Spies, editors, Formal Systems Specification: The RPC-Memory Specification Case Study, FSS '96 Selected Solutions, LNCS 1169, 1996, pages 341-374, under the title Using Monadic Second-Order Logic over Finite Domains for Specification and Verification.
  80. Mogens Nielsen and Glynn Winskel. Petri nets and bisimulations. Research Series RS-95-4, BRICS, Basic Research in Computer Science, Aarhus, January 1995. 36 pp. Appears in Theoretical Computer Science 153(1-2):211-244, January 1996.
  81. Mogens Nielsen and Glynn Winskel. Petri nets and bisimulations. Research Series RS-94-15, BRICS, Basic Research in Computer Science, Aarhus, May 1994. 36 pp. Please refer to the revised and corrected version BRICS-RS-95-4.
  82. Glynn Winskel and Mogens Nielsen. Models for concurrency. Research Series RS-94-12, BRICS, Basic Research in Computer Science, Aarhus, May 1994. 144 pp. Appears as a chapter in the Handbook of Logic and the Foundations of Computer Science, vol. 4, pages 1-148, Oxford University Press, 1995.
  83. Javier Esparza and Mogens Nielsen. Decidability issues for Petri nets. Research Series RS-94-8, BRICS, Basic Research in Computer Science, Aarhus, May 1994. 23 pp. Appears in Journal of Information Processing and Cybernet. EIK, 30:143-160, 1994.
  84. André Joyal, Mogens Nielsen, and Glynn Winskel. Bisimulation from open maps. Research Series RS-94-7, BRICS, Basic Research in Computer Science, Aarhus, May 1994. 42 pp. Appears in LICS '93 special issue of Information and Computation, 127(2):164-185, June 1986.
  85. Mogens Nielsen and Christian Clausen. Bisimulations, games, and logic. Research Series RS-94-6, BRICS, Basic Research in Computer Science, Aarhus, April 1994. 37 pp. Full version of paper appearing in Karhumäki, Maurer and Rozenberg, editors, Results and Trends in Theoretical Computer Science: Colloquium in Honor of Arto Salomaa, RTTCS '94 Selected Papers, LNCS 812, 1994, pages 289-305.
  86. Mogens Nielsen and Christian Clausen. Bisimulations, games and logic. Technical Report DAIMI PB-467, Department of Computer Science, University of Aarhus, May 1994.
  87. Glynn Winskel and Mogens Nielsen. Models for concurrency. Technical Report DAIMI PB-463, Department of Computer Science, University of Aarhus, November 1993.
  88. Mogens Nielsen, Vladimiro Sassone, and Glynn Winskel. Relationships between models of concurrency. Technical Report DAIMI PB-456, Department of Computer Science, University of Aarhus, December 1993.
  89. Glynn Winskel and Mogens Nielsen. Models for concurrency. Technical Report DAIMI PB-429, Department of Computer Science, University of Aarhus, November 1992.
  90. Mogens Nielsen, Grzegorz Rozenberg, and P. S. Thiagarajan. Transition systems, event structures and unfoldings. Technical Report DAIMI PB-353, Department of Computer Science, University of Aarhus, September 1991.
  91. Mogens Nielsen, Grzegorz Rozenberg, and P. S. Thiagarajan. Elementary transition systems and refinement. Technical Report DAIMI PB-346, Department of Computer Science, University of Aarhus, March 1991.
  92. Mogens Nielsen, Grzegorz Rozenberg, and P. S. Thiagarajan. Elementary transition systems and refinement. Technical Report DAIMI PB-310, Department of Computer Science, University of Aarhus, April 1991.
  93. Uffe H. Engberg and Mogens Nielsen. A calculus of communicating systems with label passing. Technical Report DAIMI PB-208, Department of Computer Science, University of Aarhus, May 1986.
  94. César Fernández, Mogens Nielsen, and P. S. Thiagarajan. Notions of realizable non-sequential processes. Technical Report DAIMI PB-205, Department of Computer Science, University of Aarhus, April 1986.
  95. Mogens Nielsen and P. S. Thiagarajan. Degrees of non-determinism and concurrency: A Petri net view. Technical Report DAIMI PB-180, Department of Computer Science, University of Aarhus, October 1984.
  96. Jean Berstel and Mogens Nielsen. The growth range equivalence problem for Dol: Systems is decidable. Technical Report DAIMI PB-50, Department of Computer Science, University of Aarhus, October 1975.
  97. Jean Berstel and Mogens Nielsen. EOL and ETOL systems with control devices. Technical Report DAIMI PB-37, Department of Computer Science, University of Aarhus, September 1974.
  98. Mogens Nielsen, Grzegorz Rozenberg, Arto Salomaa, and Sven Skyum. Nonterminals, homomorphisms and codings in different variations of OL-systems. Technical Report DAIMI PB-21, Department of Computer Science, University of Aarhus, January 1974.
  99. Mogens Nielsen. On the decidability of some equivalence problems for Dol-systems. Technical Report DAIMI PB-20, Department of Computer Science, University of Aarhus, December 1973.
  100. Mogens Nielsen. On decomposition of stochastic finite-state systems. Technical Report DAIMI PB-8, Department of Computer Science, University of Aarhus, February 1973.

    Miscellaneous Publications

  101. Glynn Winskel, Mogens Nielsen, and Erik Meineche Schmidt. BRICS profile. Published by BRICS, Centre of the Danish National Research Foundation, June 1998. First edition. 8 pp.
 
Last modified: 2003-03-20 by webmaster.