Fribourg, Laurent; Olsén, Hans Proving safety properties of infinite state systems by compilation into Presburger arithmetic. (English) Zbl 1512.68167 Mazurkiewicz, Antoni (ed.) et al., CONCUR ’97: concurrency theory. 8th international conference. Warsaw, Poland. July 1–4, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1243, 213-227 (1997). MSC: 68Q85 03B70 68Q60 PDFBibTeX XMLCite \textit{L. Fribourg} and \textit{H. Olsén}, Lect. Notes Comput. Sci. 1243, 213--227 (1997; Zbl 1512.68167) Full Text: DOI
Fribourg, Laurent; Olsén, Hans Reachability sets of parameterized rings as regular languages. (English) Zbl 0907.68119 Moller, Faron (ed.), Verification of infinite state systems, Infinity ’97. Selected papers from the 2nd international workshop, Bologna, Italy, July 11–12, 1997. Amsterdam: Elsevier, Electronic Notes in Theoretical Computer Science. 9, 12 p. (1997). MSC: 68Q45 PDFBibTeX XMLCite \textit{L. Fribourg} and \textit{H. Olsén}, in: Verification of infinite state systems, Infinity '97. Selected papers from the 2nd international workshop, Bologna, Italy, July 11--12, 1997. Amsterdam: Elsevier. 12 p. (1997; Zbl 0907.68119)
Fribourg, Laurent; Olsén, Hans A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters. (English) Zbl 0889.68025 Constraints 2, No. 3-4, 305-335 (1997). MSC: 68N17 68Q85 PDFBibTeX XMLCite \textit{L. Fribourg} and \textit{H. Olsén}, Constraints 2, No. 3--4, 305--335 (1997; Zbl 0889.68025) Full Text: DOI