EEMCS EPrints Service
|
||||||||||||||||
|
Number of items: 1. 1999
Langerak, R.
(1999)
Deriving a Graph Rewriting System from a Complete Finite Prefix of an Unfolding.
In: Proceedings of the 6th International Workshop on Expressiveness in Concurrency, 23 August 1999, Eindhoven, The Netherlands.
pp. 24-41.
Electronic Notes in Theoretical Computer Science 27.
Elsevier.
ISSN 1571-0661
This list was generated on Thu May 24 08:34:47 CEST 2012. |
||||||||||||||||