The π-calculus: A Theory of Mobile Processes. Davide Sangiorgi and David Walker. The π-calculus: a theory of mobile processes . Cambridge University Press, Cambridge, New York, etc., 2001, xii + 580 pp
Semantics of Objects as Processes SOAP’98 July 18 Aalborg, Denmark
Copyright c 1998, BRICS, Department of Computer Science University of Aarhus. All rights reserved... more Copyright c 1998, BRICS, Department of Computer Science University of Aarhus. All rights reserved. Reproduction of all or part of this work is permitted for educational or research use on condition that this copyright notice is included in any copy. See back inner page for a ...
... litteratur. Russell kom fra en adelig baggrund (i 1931 arve-de han titlen Earl of Russell) me... more ... litteratur. Russell kom fra en adelig baggrund (i 1931 arve-de han titlen Earl of Russell) men var politisk progressiv og blev blandt andet en ledende skikkelse i kampen mod atomvåben. Og så lagde han navn til et paradoks. ...
World Scientific Book-10.25in x 7.5in book Chapter 33 Mathematical Preliminaries In this appendix... more World Scientific Book-10.25in x 7.5in book Chapter 33 Mathematical Preliminaries In this appendix, we provide essential definitions and key results which are used at various points in the book. We also provide a list of sources where more details and proofs may be looked up. The topics covered include: probability, linear algebra, linear programming, mathematical analysis, and computational complexity. We have only presented key definitions and results here and for rigorous technical details, the reader is urged to look up the references provided at the end.
Journal of Problem Based Learning in Higher Education, Nov 30, 2017
Danish PBL-based higher education institutions espouse the qualities of problem-based projects bu... more Danish PBL-based higher education institutions espouse the qualities of problem-based projects but actual practice shows a somewhat different picture. The predominant use of project catalogues and the formal requirements imposed by accreditation inhibit central intentions behind problem-based project work and there is now a danger of employing the PBL format, i.e. the elements of project elements in a routine-wise fashion rather than as essential enhancers of knowledge construction. In this paper we identify and analyze problems of routinisation of project work based on students' and supervisor's perceptions of project work; this is done in the context of undergraduate degree programmes in the
The Challenge of Building Communities About PBL Supervision
Collaborative Convergence and Virtual Teamwork for Organizational Transformation, 2021
Problem-based learning (PBL) is central to the degree programmes at Aalborg University (AAU), but... more Problem-based learning (PBL) is central to the degree programmes at Aalborg University (AAU), but if one is a member of the teaching faculty with a degree from another institution, it is unlikely that one is familiar with PBL. In this chapter, the authors describe the development of an ongoing experiences with PBL Exchange, a web-based platform whose goal is to facilitate the transfer and development of knowledge and skills within PBL project supervision by means of a web-based crowdsourcing approach that makes it easy to exchange and discuss one's specific problems and experience with project supervision. The goal was to build a new community of practice from a network of practice, but this has turned out to be difficult. The authors discuss and analyze their experiences and suggest technical and social developments that may be able to facilitate the creation of community of practice.
The previous best upper bound on the complexity of deciding bisimilarity between normed context-f... more The previous best upper bound on the complexity of deciding bisimilarity between normed context-free processes is due to Huynh and Tian (1994), who put the problem in Z; = NPNP: their algorithm guesses a proof of equivalence and validates this proof in polynomial time using oracles freely answering questions which are in NP. In this paper we improve on this result by describing a polynomial-time algorithm which solves this problem. As a corollary, we have a polynomial algorithm for the equivalence problem for simple grammars. * Dedicated to Robin Milner on the occasion of his 60th birthday.
Uploads
Papers by Hans Hyttel