Mogens Nielsen

According to our database1, Mogens Nielsen authored at least 78 papers between 1974 and 2014.

Collaborative distances :
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2014
Trust in event structures.
Theor. Comput. Sci., 2014

2012
Transfer of trust in event-based reputation systems.
Theor. Comput. Sci., 2012

To Dexter - A Tribute from Aarhus.
Proceedings of the Logic and Program Semantics, 2012

2009
HMM-Based Trust Model.
Proceedings of the Formal Aspects in Security and Trust, 6th International Workshop, 2009

2008
A logical framework for history-based access control and reputation systems.
Journal of Computer Security, 2008

Secure Data Flow in a Calculus for Context Awareness.
Proceedings of the Concurrency, 2008

Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra.
Proceedings of the Concurrency, 2008

2007
Implantation mechanics of tungsten microneedles into peripheral nerve trunks.
Med. Biol. Engineering and Computing, 2007

Trust structures.
Int. J. Inf. Sec., 2007

A Bayesian Model for Event-based Trust.
Electr. Notes Theor. Comput. Sci., 2007

CCS with Replication in the Chomsky Hierarchy: The Expressive Power of Divergence.
Proceedings of the Programming Languages and Systems, 5th Asian Symposium, 2007

2006
Optimal wavelets for biomedical signal compression.
Med. Biol. Engineering and Computing, 2006

From Simulations to Theorems: A Position Paper on Research in the Field of Computational Trust.
Proceedings of the Formal Aspects in Security and Trust, Fourth International Workshop, 2006

Biomedical Signal Compression With Optimized Wavelets.
Proceedings of the 2006 IEEE International Conference on Acoustics Speech and Signal Processing, 2006

Towards a Formal Framework for Computational Trust.
Proceedings of the Formal Methods for Components and Objects, 5th International Symposium, 2006

2005
Introduction - Combined TCSA/TCSB issue - mathematical foundations of computer science 2000.
Theor. Comput. Sci., 2005

A framework for concrete reputation-systems with applications to history-based access control.
Proceedings of the 12th ACM Conference on Computer and Communications Security, 2005

2004
A Calculus for Trust Management.
Proceedings of the FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science, 2004

On the Formal Modelling of Trust in Reputation-Based Systems.
Proceedings of the Theory Is Forever, 2004

2003
Using Trust for Secure Collaboration in Uncertain Environments.
IEEE Pervasive Computing, 2003

Undecidability of domino games and hhp-bisimilarity.
Inf. Comput., 2003

A Formal Model for Trust in Dynamic Networks.
Proceedings of the 1st International Conference on Software Engineering and Formal Methods (SEFM 2003), 2003

Towards a formal notion of trust.
Proceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2003

Notes on Timed Concurrent Constraint Programming.
Proceedings of the Lectures on Concurrency and Petri Nets, 2003

2002
Temporal Concurrent Constraint Programming: Denotation, Logic and Applications.
Nord. J. Comput., 2002

On the expressive power of temporal concurrent constraint programming languages.
Proceedings of the 4th international ACM SIGPLAN conference on Principles and practice of declarative programming, 2002

Temporal Concurrent Constraint Programming: Applications and Behavior.
Proceedings of the Formal and Natural Computing, 2002

Regular Event Structures and Finite Petri Nets: The Conflict-Free Case.
Proceedings of the Applications and Theory of Petri Nets 2002, 2002

2001
Modelling with Partial Orders - Why and Why Not?
Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

Properties of Distributed Timed-Arc Petri Nets.
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001

Towards a Notion of Distributed Time for Petri Nets.
Proceedings of the Application and Theory of Petri Nets 2001, 2001

2000
Hereditary History Preserving Bisimilarity Is Undecidable.
Proceedings of the STACS 2000, 2000

A calculus of communicating systems with label passing - ten years after.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
Bisimulation and Open Maps for Timed Transition Systems.
Fundam. Inform., 1999

1998
Open Maps, Behavioural Equivalences, and Congruences.
Theor. Comput. Sci., 1998

Reasoning About the Past.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

Timed Bisimulation and Open Maps.
Proceedings of the Mathematical Foundations of Computer Science 1998, 1998

1996
Models for Concurrency: Towards a Classification.
Theor. Comput. Sci., 1996

Petri Nets and Bisimulation.
Theor. Comput. Sci., 1996

Foreword: Special Volume of TAPSOFT 1995 Papers.
Theor. Comput. Sci., 1996

Bisimulation from Open Maps.
Inf. Comput., 1996

Automated Logical Verification Based on Trace Abstractions.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Presheaves as transition systems.
Proceedings of the Partial Order Methods in Verification, Proceedings of a DIMACS Workshop, 1996

Open Maps, Behavioural Equivalences, and Congruences.
Proceedings of the Trees in Algebra and Programming, 1996

Behavioural Equivalence for Infinite Systems - Partially Decidable!
Proceedings of the Application and Theory of Petri Nets 1996, 1996

Petri Nets and Other Models of Concurrency.
Proceedings of the Lectures on Petri Nets I: Basic Models, 1996

1995
Transition Systems, Event Structures and Unfoldings
Inf. Comput., May, 1995

Games and Logics for a Noninterleaving Bisimulation.
Nord. J. Comput., 1995

Obseving Behaviour Categorically.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1995

Characterizing Behavioural Congruences for Petri Nets.
Proceedings of the CONCUR '95: Concurrency Theory, 1995

1994
Decidability Issues for Petri Nets - a survey.
Elektronische Informationsverarbeitung und Kybernetik, 1994

Decidability Issues for Petri Nets - a survey.
Bulletin of the EATCS, 1994

A Case Study in Verification Based on Trace Abstractions.
Proceedings of the Formal Systems Specification, 1994

Bisimulation for Models in Concurrency.
Proceedings of the CONCUR '94, 1994

Bisimulation, Games, and Logic.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
Without Title.
Bulletin of the EATCS, 1993

Relationships Between Models of Concurrency.
Proceedings of the A Decade of Concurrency, Reflections and Perspectives, 1993

Deterministic Behavioural Models for Concurrency.
Proceedings of the Mathematical Foundations of Computer Science 1993, 1993

Bisimulation and open maps
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

A Classification of Models for Concurrency.
Proceedings of the CONCUR '93, 1993

1992
Elementary Transition Systems.
Theor. Comput. Sci., 1992

Elementary Transition Systems and Refinement.
Acta Inf., 1992

CCS, Location and Asynchronous Transition Systems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1992

1991
Models for Concurrency.
Proceedings of the Mathematical Foundations of Computer Science 1991, 1991

1990
Behavioural Notions for Elementary Net Systems.
Distributed Computing, 1990

1989
The RAISE Language, Method and Tools.
Formal Asp. Comput., 1989

1988
Fully abstract models for a process language with refinement.
Proceedings of the Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30, 1988

The RAISE Language, Method and Tools.
Proceedings of the VDM '88, 1988

1986
CCS - and its Relationship to Net Theory.
Proceedings of the Petri Nets: Central Models and Their Properties, 1986

1984
Degrees of Non-Determinism and Concurrency: A Petri Net View.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

A note on observable occurrence nets.
Proceedings of the Advances in Petri Nets 1984, 1984

1981
Petri Nets, Event Structures and Domains, Part I.
Theor. Comput. Sci., 1981

1979
Petri Nets, Event Structures and Domains.
Proceedings of the Semantics of Concurrent Computation, 1979

1974
On the Decidability of Some Equivalence Problems for D0L-Systems
Information and Control, June, 1974

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. I. Deterministic Systems.
Acta Inf., 1974

Nonterminals, Homomorphisms and Codings in Different Variations of OL-Systems. II. Nondeterministic Systems.
Acta Inf., 1974

EOL Systems with Control Devices.
Acta Inf., 1974

Equivalence of L-Systems.
Proceedings of the L Systems, 1974


  Loading...