topic.axiomatisability.bib

@comment{{This file has been generated by bib2bib 1.96}}
@comment{{Command line: /usr/bin/bib2bib -c topic:"axiomatisability" -ob topic.axiomatisability.bib sewellbib2.bib}}
@inproceedings{Sew94,
  author = {Peter M. Sewell},
  title = {Bisimulation is Not Finitely (First-Order) Equationally Axiomatisable},
  conf = {LICS 1994},
  booktitle = {Proceedings of the 9th IEEE Symposium on Logic in Computer Science (Paris)},
  year = {1994},
  opteditor = {},
  pages = {62--70},
  organization = {IEEE},
  optpublisher = {},
  optaddress = {},
  month = jul,
  note = {Subsumed by the APAL 1997 paper},
  url = {https://doi.org/10.1007/3-540-63141-0},
  doi = {10.1007/3-540-63141-0},
  pdf = {http://www.cl.cam.ac.uk/users/pes20/lics-nonax.pdf},
  ps = {http://www.cl.cam.ac.uk/users/pes20/lics-nonax.ps},
  abstract = {This paper considers the existence of finite equational axiomatisations of bisimulation over a calculus of finite state processes. To express even simple properties such as mu X E=mu X E[E/X] equationally it is necessary to use some notation for substitutions. Accordingly the calculus is embedded in a simply typed lambda calculus, allowing axioms such as the above to be written as equations of higher type rather than as equation schemes. Notions of higher order transition system and bisimulation are then defined and using them the nonexistence of finite axiomatisations containing at most first order variables is shown.

The same technique is then applied to calculi of star expressions containing a zero process --- in contrast to the positive result given in [FZ93] for BPA*, which differs only in that it does not contain a zero.},
  topic = {axiomatisability}
}
@phdthesis{Sew95,
  author = {Peter Michael Sewell},
  title = {The Algebra of Finite State Processes},
  school = {University of Edinburgh},
  year = {1995},
  optcrossref = {},
  optkey = {},
  optaddress = {},
  month = oct,
  opttype = {},
  note = {Dept. of Computer Science technical report CST-118-95, also published as LFCS-95-328},
  optannote = {},
  pdf = {http://www.cl.cam.ac.uk/users/pes20/thesischarter.pdf},
  ps = {http://www.cl.cam.ac.uk/users/pes20/thesischarter.ps},
  pscmr = {http://www.cl.cam.ac.uk/~pes20/thesiscmr.ps},
  abstract = {This thesis is concerned with the algebraic theory of finite state processes. The processes we focus on are those given by a signature with prefix, summation and recursion, considered modulo strong bisimulation. We investigate their equational and implicational theories.

We first consider the existence of finite equational axiomatisations. In order to express an interesting class of equational axioms we embed the processes into a simply typed lambda calculus, allowing equation schemes with metasubstitutions to be expressed by pure equations. Two equivalences over the lambda terms are defined, an extensional equality and a higher order bisimulation. Under a restriction to first order variables these are shown to coincide and an examination of the coincidence shows that no finite equational axiomatisation of strong bisimulation can exist. We then encode the processes of Basic Process Algebra with iteration and zero (BPA_\delta^*) into this lambda calculus and show that it too is not finitely equationally axiomatisable, in sharp contrast to the extant positive result for the fragment without zero.

For the implicational theory, we show the existence of finite computable complete sets of unifiers for finite sets of equations between processes (with zero order variables). It follows that the soundness of sequents over these is decidable.

Some applications to the theories of higher order process calculi and non-well-founded sets are made explicit.},
  topic = {axiomatisability}
}
@article{Sew97b,
  author = {Peter Sewell},
  title = {Nonaxiomatisability of Equivalences over Finite State 
                  Processes},
  journal = {Annals of Pure and Applied Logic},
  year = {1997},
  optkey = {},
  volume = {90},
  optnumber = {},
  month = dec,
  pages = {163--191},
  note = {Invited submission from LICS '94},
  optannote = {},
  url = {https://doi.org/10.1016/S0168-0072(97)00036-5},
  doi = {10.1016/S0168-0072(97)00036-5},
  pdf = {http://www.cl.cam.ac.uk/users/pes20/nonax.pdf},
  ps = {http://www.cl.cam.ac.uk/users/pes20/nonax.ps},
  url = {http://www.sciencedirect.com/science/article/pii/S0168007297000365},
  abstract = {
This paper considers the existence of finite equational axiomatisations of behavioural equivalences over a calculus of finite state processes. To express even simple properties such as mu x E = mu x E[E/x] some notation for substitutions is required. Accordingly the calculus is embedded in a simply typed lambda calculus, allowing such schemas to be expressed as equations between terms containing first order variables. A notion of first order trace congruence over such terms is introduced and used to show that no finite set of such equations is sound and complete for any reasonable equivalence finer than trace equivalence. The intermediate results are then applied to give two nonaxiomatisability results over calculi of regular expressions.},
  topic = {axiomatisability}
}