Abstract
We use nominal sets (sets with names and binding) to define a framework for trace semantics with dynamic allocation of resources. Using novel constructions in nominal sets, including the technical devices of positive nominal sets and maximal planes, we define notions of capture-avoiding composition and name-restriction on sets of traces with names. We conclude with an extended version of Kleene algebras which summarises in axiomatic form the relevant properties of the constructions. © 2011 Springer-Verlag.
Cite
CITATION STYLE
Gabbay, M. J., & Ciancia, V. (2011). Foundations of Software Science and Computational Structures. (M. Hofmann, Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6604, pp. 365–380). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-19805-2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
