1. J.C.M. Baeten, J.A. Bergstra & J.W. Klop (1986): Syntax and defining equations for an interrupt mechanism in process algebra. Fundamenta Informaticae 9, pp. 127–167.
  2. F. Bause (1996): On the analysis of Petri nets with static priorities. Acta Informatica 33(7), pp. 669–685, doi:10.1007/s002360050065.
  3. F. Bause (1997): Analysis of Petri nets with a dynamic priority method. In: Proceedings of Application and Theory of Petri Nets, LNCS 1248. Springer, pp. 215–234, doi:10.1007/3-540-63139-9_38.
  4. G. Boudol & I. Castellani (1991): Flow models of distributed computations: event structures and nets. Technical Report. INRIA.
  5. J.W. Bryans, J.S. Fitzgerald, C.B. Jones & I. Mozolevsky (2006): Dimensions of Dynamic Coalitions. Technical Report. Newcastle upon Tyne.
  6. J. Camilleri & G. Winskel (1995): CCS with Priority Choice. Information and Computation 116(1), pp. 26–37, doi:10.1006/inco.1995.1003.
  7. R. Cleaveland, G. Lüttgen & V. Natarajan (1999): Priority in Process Algebra. ICASE report. NASA.
  8. J.P. Katoen (1996): Quantitative and Qualitative Extensions of Event Structures. Twente.
  9. R. Langerak (1992): Transformations and Semantics for LOTOS. Twente.
  10. R. Langerak, E. Brinksma & J.P. Katoen (1997): Causal ambiguity and partial orders in event structures. In: Proceedings of CONCUR, LNCS. Springer, pp. 317–331, doi:10.1007/3-540-63141-0_22.
  11. R. Langerak, R. Brinksma & J.P. Katoen (1997): Causal ambiguity and partial orders in event structures. Technical Report. Twente.
  12. G. Lüttgen (1998): Pre-emptive Modeling of Concurrent and Distributed Systems. Passau.
  13. A. Rensink (1992): Posets for Configurations!. In: Proceedings of CONCUR, LNCS 630. Springer, pp. 269–285, doi:10.1007/BFb0084797.
  14. R. van Glabbeek & U. Goltz (2001): Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37, pp. 229–327, doi:10.1007/s002360000041.
  15. G. Winskel (1980): Events in Computation. Edinburgh.

Comments and questions to:
For website issues: