Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
Algebraic theory of processes
Automated analysis of mutual exclusion algorithms using CCS
Formal Aspects of Computing
Proof systems for satisfiability in Hennessy-Milner logic with recursion
Theoretical Computer Science - Special issue on the Thirteenth Colleque sur les Arbres en Alge`bre et en Programmation Nancy, March 1988
On the development of reactive systems
Logics and models of concurrent systems
Process algebra
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
The concurrency workbench: a semantics-based tool for the verification of concurrent systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
Theoretical Computer Science
Characteristic formulae for processes with divergence
Information and Computation
Construction and analysis of transition systems with MEC
Construction and analysis of transition systems with MEC
Concurrency: state models & Java programs
Concurrency: state models & Java programs
Model checking
Formal verification of parallel programs
Communications of the ACM
A note on reliable full-duplex transmission over half-duplex links
Communications of the ACM
Modal and temporal properties of processes
Modal and temporal properties of processes
Communication and Concurrency
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Concurrent and Real Time Systems: The CSP Approach
Concurrent and Real Time Systems: The CSP Approach
Introduction to Process Algebra
Introduction to Process Algebra
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
CCS + Time = An Interleaving Model for Real Time Systems
ICALP '91 Proceedings of the 18th International Colloquium on Automata, Languages and Programming
On the Ehrenfeucht-Fraïssé Game in Theoretical Computer Science
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
TAPSOFT '95 Proceedings of the 6th International Joint Conference CAAP/FASE on Theory and Practice of Software Development
Real-Time Behaviour of Asynchronous Agents
CONCUR '90 Proceedings of the Theories of Concurrency: Unification and Extension
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
The NCSU Concurrency Workbench
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
CONCUR '95 Proceedings of the 6th International Conference on Concurrency Theory
Mythematics: storytelling in the teaching of computer science and mathematics
Proceedings of the 8th annual conference on Innovation and technology in computer science education
20th century vs. 21st century C&C: the SPUR manifesto
Communications of the ACM - The disappearing computer
Distributed Computing
Reactive Systems: Modelling, Specification and Verification
Reactive Systems: Modelling, Specification and Verification
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Using model checkers in an introductory course on operating systems
ACM SIGOPS Operating Systems Review
| Hi-index | 0.00 |
Teaching courses that rely on sound mathematical principles is nowadays a challenging task at many universities. On the one hand there is an increased demand for educating students in these areas, on the other hand there are more and more students being accepted with less adequate skills in mathematics. We report here on our experiences in teaching concurrency theory over the last twenty years or so to students ranging from mathsphobic bachelor students to sophisticated doctoral students. The contents of the courses, the material on which they are based and the pedagogical philosophy underlying them are described, as well as some of the lessons that we have learned over the years.