Abstract
Series-parallel orders are defined as the least class of partial orders containing the one-element order and closed by ordinal sum and disjoint union. From this inductive definition, it is almost immediate that any series-parallel order may be represented by an algebraic expression, which is unique up to the associativity of ordinal sum and to the associativivity and commutativity of disjoint union. In this paper, we introduce a rewrite system acting on these algebraic expressions that axiomatises completely the sub-ordering relation for the class of series-parallel orders.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Philippe de Groote. Partially commutative linear logic: sequent calculus and phase semantics. In V. M. Abrusci and C. Casadio, editors, Proofs and Linguistic Categories, Proceedings 1996 Roma Workshop, Cooperativa Libraria Universitaria Editrice Bologna, 1996, pp. 199–208.
Martin Charles Golumbic. Algorithmic graph theory and perfect graphs. Academic Press, 1980.
R. Möhring. Computationally tractable classes of ordered sets, in [7], 1989. pp. 105–194.
Christian Retoré. Réseaux et Séquents Ordonnés. Thèse de Doctorat, spécialité Mathématiques, Université Paris 7, février 1993.
Christian Retoré. Perfect matchings and series-parallel graphs: multiplicative proof nets as R&B-graphs. Electronic Notes in Theoretical Computer Science, 3, 1996. www.elsevier.nl/locate/entcs/volume3.html.
Christian Retoré. Pomset logic: a non-commutative extension of classical linear logic. In R. Hindley and P. de Groote, editors, Proceedings of the Third International Conference on Typed Lambda Calculi and Applications, TLCA'97. Lecture Notes in Computer Science, 1210, Springer Verlag, 1997.
I. Rival, editor. Algorithms and Order, volume 255 of NATO ASI series C. Kluwer, 1989.
J. Valdes, R.E. Tarjan, and E.L. Lawler. The recognition of Series-Parallel digraphs. SIAM Journal of Computing, 11(2):298–313, May 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bechet, D., de Groote, P., Retoré, C. (1997). A complete axiomatisation for the inclusion of series-parallel partial orders. In: Comon, H. (eds) Rewriting Techniques and Applications. RTA 1997. Lecture Notes in Computer Science, vol 1232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62950-5_74
Download citation
DOI: https://doi.org/10.1007/3-540-62950-5_74
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62950-4
Online ISBN: 978-3-540-69051-1
eBook Packages: Springer Book Archive