 | 2009 |
|---|
| 78 |       | Mogens Nielsen,
Antonín Kucera,
Peter Bro Miltersen,
Catuscia Palamidessi,
Petr Tuma,
Frank D. Valencia:
SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings
Springer 2009 |
| 2008 |
|---|
| 77 | | Doina Bucur,
Mogens Nielsen:
Secure Data Flow in a Calculus for Context Awareness.
Concurrency, Graphs and Models 2008: 439-456 |
| 76 | | Gérard Boudol,
Ilaria Castellani,
Matthew Hennessy,
Mogens Nielsen,
Glynn Winskel:
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.
Concurrency, Graphs and Models 2008: 757-777 |
| 75 | | Karl Krukow,
Mogens Nielsen,
Vladimiro Sassone:
A logical framework for history-based access control and reputation systems.
Journal of Computer Security 16(1): 63-101 (2008) |
| 2007 |
|---|
| 74 | | Jesús Aranda,
Cinzia Di Giusto,
Mogens Nielsen,
Frank D. Valencia:
CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence.
APLAS 2007: 383-398 |
| 73 | | Mogens Nielsen,
Karl Krukow,
Vladimiro Sassone:
A Bayesian Model for Event-based Trust.
Electr. Notes Theor. Comput. Sci. 172: 499-521 (2007) |
| 72 | | Karl Krukow,
Mogens Nielsen:
Trust structures.
Int. J. Inf. Sec. 6(2-3): 153-181 (2007) |
| 2006 |
|---|
| 71 | | Vladimiro Sassone,
Karl Krukow,
Mogens Nielsen:
Towards a Formal Framework for Computational Trust.
FMCO 2006: 175-184 |
| 70 | | Karl Krukow,
Mogens Nielsen:
From Simulations to Theorems: A Position Paper on Research in the Field of Computational Trust.
Formal Aspects in Security and Trust 2006: 96-111 |
| 2005 |
|---|
| 69 | | Karl Krukow,
Mogens Nielsen,
Vladimiro Sassone:
A framework for concrete reputation-systems with applications to history-based access control.
ACM Conference on Computer and Communications Security 2005: 260-269 |
| 68 | | Mogens Nielsen,
Branislav Rovan:
Introduction - Combined TCSA/TCSB issue - mathematical foundations of computer science 2000.
Theor. Comput. Sci. 340(3): 457-458 (2005) |
| 2004 |
|---|
| 67 | | Marco Carbone,
Mogens Nielsen,
Vladimiro Sassone:
A Calculus for Trust Management.
FSTTCS 2004: 161-173 |
| 66 | | Mogens Nielsen,
Karl Krukow:
On the Formal Modelling of Trust in Reputation-Based Systems.
Theory Is Forever 2004: 192-204 |
| 2003 |
|---|
| 65 | | Mogens Nielsen,
Frank D. Valencia:
Notes on Timed Concurrent Constraint Programming.
Lectures on Concurrency and Petri Nets 2003: 702-741 |
| 64 | | Mogens Nielsen,
Karl Krukow:
Towards a formal notion of trust.
PPDP 2003: 4-7 |
| 63 | | Marco Carbone,
Mogens Nielsen,
Vladimiro Sassone:
A Formal Model for Trust in Dynamic Networks.
SEFM 2003: 54- |
| 62 | | Marcin Jurdzinski,
Mogens Nielsen,
Jirí Srba:
Undecidability of domino games and hhp-bisimilarity.
Inf. Comput. 184(2): 343-368 (2003) |
| 2002 |
|---|
| 61 |  | Mogens Nielsen,
Uffe Engberg:
Foundations of Software Science and Computation Structures, 5th International Conference, FOSSACS 2002. Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 Grenoble, France, April 8-12, 2002, Proceedings
Springer 2002 |
| 60 | | Mogens Nielsen,
Frank D. Valencia:
Temporal Concurrent Constraint Programming: Applications and Behavior.
Formal and Natural Computing 2002: 298-324 |
| 59 | | Mogens Nielsen,
P. S. Thiagarajan:
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case.
ICATPN 2002: 335-351 |
| 58 | | Mogens Nielsen,
Catuscia Palamidessi,
Frank D. Valencia:
On the expressive power of temporal concurrent constraint programming languages.
PPDP 2002: 156-167 |
| 57 | | Mogens Nielsen,
Catuscia Palamidessi,
Frank D. Valencia:
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications.
Nord. J. Comput. 9(1): 145-188 (2002) |
| 2001 |
|---|
| 56 | | Kim Guldstrand Larsen,
Mogens Nielsen:
CONCUR 2001 - Concurrency Theory, 12th International Conference, Aalborg, Denmark, August 20-25, 2001, Proceedings
Springer 2001 |
| 55 | | Mogens Nielsen,
Vladimiro Sassone,
Jirí Srba:
Properties of Distributed Timed-Arc Petri Nets.
FSTTCS 2001: 280-291 |
| 54 | | Mogens Nielsen:
Modelling with Partial Orders - Why and Why Not?
ICALP 2001: 61-63 |
| 53 | | Mogens Nielsen,
Vladimiro Sassone,
Jirí Srba:
Towards a Notion of Distributed Time for Petri Nets.
ICATPN 2001: 23-31 |
| 2000 |
|---|
| 52 | | Mogens Nielsen,
Dan Simpson:
Application and Theory of Petri Nets 2000, 21st International Conference, ICATPN 2000, Aarhus, Denmark, June 26-30, 2000, Proceeding
Springer 2000 |
| 51 | | Mogens Nielsen,
Branislav Rovan:
Mathematical Foundations of Computer Science 2000, 25th International Symposium, MFCS 2000, Bratislava, Slovakia, August 28 - September 1, 2000, Proceedings
Springer 2000 |
| 50 | | Uffe Engberg,
Mogens Nielsen:
A calculus of communicating systems with label passing - ten years after.
Proof, Language, and Interaction 2000: 599-622 |
| 49 | | Marcin Jurdzinski,
Mogens Nielsen:
Hereditary History Preserving Bisimilarity Is Undecidable.
STACS 2000: 358-369 |
| 1999 |
|---|
| 48 | | Jirí Wiedermann,
Peter van Emde Boas,
Mogens Nielsen:
Automata, Languages and Programming, 26th International Colloquium, ICALP'99, Prague, Czech Republic, July 11-15, 1999, Proceedings
Springer 1999 |
| 47 | | Mogens Nielsen,
Thomas Hune:
Bisimulation and Open Maps for Timed Transition Systems.
Fundam. Inform. 38(1-2): 61-77 (1999) |
| 1998 |
|---|
| 46 | | Mogens Nielsen,
Wolfgang Thomas:
Computer Science Logic, 11th International Workshop, CSL '97, Annual Conference of the EACSL, Aarhus, Denmark, August 23-29, 1997, Selected Papers
Springer 1998 |
| 45 | | Mogens Nielsen:
Reasoning About the Past.
MFCS 1998: 117-128 |
| 44 | | Thomas Hune,
Mogens Nielsen:
Timed Bisimulation and Open Maps.
MFCS 1998: 378-387 |
| 43 | | Allan Cheng,
Mogens Nielsen:
Open Maps, Behavioural Equivalences, and Congruences.
Theor. Comput. Sci. 190(1): 87-112 (1998) |
| 1996 |
|---|
| 42 | | Kim Sunesen,
Mogens Nielsen:
Behavioural Equivalence for Infinite Systems - Partially Decidable!
Application and Theory of Petri Nets 1996: 460-479 |
| 41 | | Allan Cheng,
Mogens Nielsen:
Open Maps, Behavioural Equivalences, and Congruences.
CAAP 1996: 257-271 |
| 40 | | Nils Klarlund,
Mogens Nielsen,
Kim Sunesen:
Automated Logical Verification Based on Trace Abstractions.
PODC 1996: 101-110 |
| 39 | | Mogens Nielsen,
Vladimiro Sassone:
Petri Nets and Other Models of Concurrency.
Petri Nets 1996: 587-642 |
| 38 | | André Joyal,
Mogens Nielsen,
Glynn Winskel:
Bisimulation from Open Maps.
Inf. Comput. 127(2): 164-185 (1996) |
| 37 | | Mogens Nielsen,
Glynn Winskel:
Petri Nets and Bisimulation.
Theor. Comput. Sci. 153(1&2): 211-244 (1996) |
| 36 | | Peter D. Mosses,
Mogens Nielsen,
Michael I. Schwartzbach:
Foreword: Special Volume of TAPSOFT 1995 Papers.
Theor. Comput. Sci. 167(1&2): 1 (1996) |
| 35 | | Vladimiro Sassone,
Mogens Nielsen,
Glynn Winskel:
Models for Concurrency: Towards a Classification.
Theor. Comput. Sci. 170(1-2): 297-348 (1996) |
| 1995 |
|---|
| 34 | | Peter D. Mosses,
Mogens Nielsen,
Michael I. Schwartzbach:
TAPSOFT'95: Theory and Practice of Software Development, 6th International Joint Conference CAAP/FASE, Aarhus, Denmark, May 22-26, 1995, Proceedings
Springer 1995 |
| 33 | | Mogens Nielsen,
Lutz Priese,
Vladimiro Sassone:
Characterizing Behavioural Congruences for Petri Nets.
CONCUR 1995: 175-189 |
| 32 | | Mogens Nielsen,
Allan Cheng:
Obseving Behaviour Categorically.
FSTTCS 1995: 263-278 |
| 31 | | Mogens Nielsen,
Grzegorz Rozenberg,
P. S. Thiagarajan:
Transition Systems, Event Structures and Unfoldings
Inf. Comput. 118(2): 191-207 (1995) |
| 30 | | Mogens Nielsen,
Christian Clausen:
Games and Logics for a Noninterleaving Bisimulation.
Nord. J. Comput. 2(2): 221-249 (1995) |
| 1994 |
|---|
| 29 | | Mogens Nielsen,
Christian Clausen:
Bisimulation for Models in Concurrency.
CONCUR 1994: 385-400 |
| 28 | | Nils Klarlund,
Mogens Nielsen,
Kim Sunesen:
A Case Study in Verification Based on Trace Abstractions.
Formal Systems Specification 1994: 341-373 |
| 27 | | Mogens Nielsen,
Christian Clausen:
Bisimulation, Games, and Logic.
Results and Trends in Theoretical Computer Science 1994: 289-306 |
| 26 | | Javier Esparza,
Mogens Nielsen:
Decidability Issues for Petri Nets - a survey.
Bulletin of the EATCS 52: 244-262 (1994) |
| 25 | | Javier Esparza,
Mogens Nielsen:
Decidability Issues for Petri Nets - a survey.
Elektronische Informationsverarbeitung und Kybernetik 30(3): 143-160 (1994) |
| 1993 |
|---|
| 24 | | Vladimiro Sassone,
Mogens Nielsen,
Glynn Winskel:
A Classification of Models for Concurrency.
CONCUR 1993: 82-96 |
| 23 | | André Joyal,
Mogens Nielsen,
Glynn Winskel:
Bisimulation and open maps
LICS 1993: 418-427 |
| 22 | | Vladimiro Sassone,
Mogens Nielsen,
Glynn Winskel:
Deterministic Behavioural Models for Concurrency.
MFCS 1993: 682-692 |
| 21 | | Mogens Nielsen,
Vladimiro Sassone,
Glynn Winskel:
Relationships Between Models of Concurrency.
REX School/Symposium 1993: 425-476 |
| 20 | | Mogens Nielsen:
Without Title.
Bulletin of the EATCS 50: 182-186 (1993) |
| 1992 |
|---|
| 19 | | Madhavan Mukund,
Mogens Nielsen:
CCS, Location and Asynchronous Transition Systems.
FSTTCS 1992: 328-341 |
| 18 | | Mogens Nielsen,
Grzegorz Rozenberg,
P. S. Thiagarajan:
Elementary Transition Systems and Refinement.
Acta Inf. 29(6/7): 555-578 (1992) |
| 17 | | Mogens Nielsen,
Grzegorz Rozenberg,
P. S. Thiagarajan:
Elementary Transition Systems.
Theor. Comput. Sci. 96(1): 3-33 (1992) |
| 1991 |
|---|
| 16 | | Mogens Nielsen:
Models for Concurrency.
MFCS 1991: 43-46 |
| 1990 |
|---|
| 15 | | Mogens Nielsen,
Grzegorz Rozenberg,
P. S. Thiagarajan:
Behavioural Notions for Elementary Net Systems.
Distributed Computing 4: 45-57 (1990) |
| 1989 |
|---|
| 14 | | Mogens Nielsen,
Klaus Havelund,
Kim Ritter Wagner,
Chris George:
The RAISE Language, Method and Tools.
Formal Asp. Comput. 1(1): 85-114 (1989) |
| 1988 |
|---|
| 13 | | Mogens Nielsen,
Uffe Engberg,
Kim S. Larsen:
Fully abstract models for a process language with refinement.
REX Workshop 1988: 523-548 |
| 12 | | Mogens Nielsen,
Klaus Havelund,
Kim Ritter Wagner,
Chris George:
The RAISE Language, Method and Tools.
VDM Europe 1988: 376-405 |
| 1986 |
|---|
| 11 | | Mogens Nielsen:
CCS - and its Relationship to Net Theory.
Advances in Petri Nets 1986: 393-415 |
| 1984 |
|---|
| 10 | | César Fernández,
Mogens Nielsen,
P. S. Thiagarajan:
A note on observable occurrence nets.
European Workshop on Applications and Theory in Petri Nets 1984: 122-138 |
| 9 | | Mogens Nielsen,
P. S. Thiagarajan:
Degrees of Non-Determinism and Concurrency: A Petri Net View.
FSTTCS 1984: 89-117 |
| 1982 |
|---|
| 8 | | Mogens Nielsen,
Erik Meineche Schmidt:
Automata, Languages and Programming, 9th Colloquium, Aarhus, Denmark, July 12-16, 1982, Proceedings
Springer 1982 |
| 1981 |
|---|
| 7 | | Mogens Nielsen,
Gordon D. Plotkin,
Glynn Winskel:
Petri Nets, Event Structures and Domains, Part I.
Theor. Comput. Sci. 13: 85-108 (1981) |
| 1979 |
|---|
| 6 | | Mogens Nielsen,
Gordon D. Plotkin,
Glynn Winskel:
Petri Nets, Event Structures and Domains.
Semantics of Concurrent Computation 1979: 266-284 |
| 1974 |
|---|
| 5 | | Mogens Nielsen:
Equivalence of L-Systems.
L Systems 1974: 142-145 |
| 4 | | Mogens Nielsen,
Grzegorz Rozenberg,
Arto Salomaa,
Sven Skyum:
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems
Acta Inf. 3: 357-364 (1974) |
| 3 | | Mogens Nielsen:
EOL Systems with Control Devices
Acta Inf. 4: 373-386 (1974) |
| 2 | | Mogens Nielsen,
Grzegorz Rozenberg,
Arto Salomaa,
Sven Skyum:
Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems
Acta Inf. 4: 87-106 (1974) |
| 1 | | Mogens Nielsen:
On the Decidability of Some Equivalence Problems for D0L-Systems
Information and Control 25(2): 166-193 (1974) |
