283
edits
Pipe-calculus: Difference between revisions
→Equational theory
KalmanKeri (talk | contribs) |
KalmanKeri (talk | contribs) |
||
| Line 136: | Line 136: | ||
=== Equational theory === | === Equational theory === | ||
Pipe-calculus can be | Pipe-calculus can be studied as a process algebra | ||
<ref name="Baeten"> | |||
J.C.M. Baeten: [https://pure.tue.nl/ws/files/2154050/200402.pdf A brief history of process algebra.], Theoretical Computer Science 335 (2005) 131 – 146 | |||
</ref> | |||
<ref name="Fokkink"> | |||
Wan Fokkink: [https://www.cs.vu.nl/~wanf/BOOKS/procalg.pdf Introduction to Process Algebra], Springer-Verlag | Wan Fokkink: [https://www.cs.vu.nl/~wanf/BOOKS/procalg.pdf Introduction to Process Algebra], Springer-Verlag | ||
</ref>. | </ref> | ||
The following | . | ||
The following identities are satisfied by all <math>s, t, u</math> pipe-calculus terms. | |||
<math> | <math> | ||
| Line 152: | Line 157: | ||
\def\eq{ = ~} | \def\eq{ = ~} | ||
\def\rule{ ::= ~} | \def\rule{ ::= ~} | ||
</math> | </math>Sequential composition is associative with left neutral element <math>\succeed</math> and left absorbing element <math>\fail</math>. | ||
Sequential composition is associative with left neutral element <math>\succeed</math> and left absorbing element <math>\fail</math>. | |||
<math> | <math> | ||