Concurrency in Interaction Nets and Graph Rewriting
👁 1 lượt xem↓ 0 lượt tải qua VietLexVietLex bảo vệ quyền riêng tư của bạn — không tracking, không chia sẻ thông tin tải về cho bên thứ ba.
📑 Trích dẫn đầy đủ (citation)
APA-like:
Tác giả chưa xác định. Concurrency in Interaction Nets and Graph Rewriting. Thesis, HAL - Pháp.
Việt Nam (chuẩn TCVN 5453:1991):
. Concurrency in Interaction Nets and Graph Rewriting. Thesis. HAL - Pháp. Truy cập từ .
Tóm tắt
In this work, we study concurrency in non-deterministic extensions of Lafont's interaction nets (a graphical language for functional calculus). These extensions are essentially of three types: multiruled, with multiports and multiwired. They can be combined creating thus seven types of concurrent interaction nets. A first task is to determine a good structural operational semantics to be able to compare the behaviors of these extensions. Based on a known technique in graph rewriting - double pus - HAL URI: https://theses.hal.science/tel-00937224v1