TY - JOUR
T1 - Algebraic theories for contextual pre-nets
AU - Bruni, Roberto
AU - Meseguer, José
AU - Montanari, Ugo
AU - Sassone, Vladimiro
PY - 2003
Y1 - 2003
N2 - The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious behaviors that must be somewhat filtered out. In this paper, we exploit partial membership equational logic to define a suitable theory of models, where the meaningful concurrent computations can be selected by means of membership predicates.
AB - The algebraic models of computation for contextual nets that have been proposed in the literature either rely on a non-free monoid of objects, or introduce too many fictitious behaviors that must be somewhat filtered out. In this paper, we exploit partial membership equational logic to define a suitable theory of models, where the meaningful concurrent computations can be selected by means of membership predicates.
UR - http://www.scopus.com/inward/record.url?scp=0142187687&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0142187687&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-45208-9_21
DO - 10.1007/978-3-540-45208-9_21
M3 - Article
AN - SCOPUS:0142187687
VL - 2841
SP - 256
EP - 270
JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SN - 0302-9743
ER -