Reversibility and Models for Concurrency

Electronic Notes in Theoretical Computer Science

Volumn 192, Issue 1 SPEC. ISS., 2007, Pages 93-108

  Phillips, Iain ^a   Ulidowski, Irek ^b  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

^b UNIVERSITY OF LEICESTER   (United Kingdom)

Author keywords

hereditary history preserving bisimulation; labelled transition systems; prime event structures; Reversible computation

Indexed keywords

ALGEBRA; COMMUNICATION SYSTEMS; COMPUTATIONAL METHODS; COMPUTER SIMULATION; CONCURRENCY CONTROL; MATHEMATICAL MODELS;

HEREDITARY HISTORY-PRESERVING BISIMULATION; LABELLED TRANSITION SYSTEMS; PRIME EVENT STRUCTURES; REVERSIBLE COMPUTATION;

COMPUTATION THEORY;

EID: 35348977633     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2007.08.018     Document Type: Article

References (10)

1. Bednarczyk, M., Hereditary history preserving bisimulations or what is the power of the future perfect in program logics, Technical Report ICS PAS, Polish Academy of Sciences (1991)
2. Danos V., and Krivine J. Reversible communicating systems. In: Gardner P., and Yoshida N. (Eds). Proceedings of the 15th International Conference on Concurrency Theory CONCUR 2004. LNCS 3170 (2004) 292-307
3. Fiore M.P., Cattani G.L., and Winskel G. Weak bisimulation and open maps. Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science. IEEE (1999) 67-76
4. van Glabbeek R.J. History preserving process graphs (1996). http://boole.stanford.edu/~rvg/pub/history.draft.dvi
5. van Glabbeek R.J., and Goltz U. Refinement of actions and equivalence notions for concurrent systems. Acta Informatica 37 (2001) 229-327
6. van Glabbeek R.J., and Vaandrager F. The difference between splitting in n and n + 1. Information and Computation 136 (1997) 109-142
7. Joyal A., Nielsen M., and Winskel G. Bisimulation from open maps. Information and Computation 127 (1996) 164-185
8. Phillips I.C.C., and Ulidowski I. Reversing algebraic process calculi. Proceedings of 9th International Conference on Foundations of Software Science and Computation Structures. FOSSACS 2006. LNCS 3921 (2006) 246-260 Extended version accepted by Journal of Logic and Algebraic Programming
9. Sassone V., Nielsen M., and Winskel G. Models of concurrency: Towards a classification. Theoretical Computer Science 170 (1996) 297-348
10. Winskel G. Event structures. Advances in Petri Nets 86. LNCS 255 (1987) 325-392