Abstract
We consider the process theory PA that includes an operation for parallel composition, based on the interleaving paradigm. We prove that the standard set of axioms of PA is not ω-complete by providing a set of axioms that are valid in PA, but not derivable from the standard ones. We prove that extending PA with this set yields an ω-complete specification, which is finite in a setting with finitely many actions.
Cite
CITATION STYLE
Fokkink, W. J., & Luttik, S. P. (2000). An ω-Complete equational specification of interleaving. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1853, pp. 729–743). Springer Verlag. https://doi.org/10.1007/3-540-45022-x_61
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
