To the top


Technical reports

  • P. Hofman, S. Lasota, R. Lazić, J. Leroux, S. Schmitz, P. Totzke, Coverability Trees for Petri Nets with Unordered Data.
    HAL report hal-01252674, 2016.

  • Froeschle, S., Lasota, S. Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP. The full version.
    Technical Report 280, Institute of Informatics, Warsaw University, 2005.
    [ postscript ]

  • Jean Goubault-Larrecq, S. Lasota, David Nowak Logical Relations for Monadic Types. The full version.
    Research Report LSV-04-13, Lab. Specification and Verification, ENS Cachan, France, June 2004.
    [ postscript ]

  • Jean Goubault-Larrecq, S. Lasota, David Nowak, Yu Zhang Complete lax logical relations for cryptographic lambda-calculi.
    Research Report LSV-04-4, Lab. Specification and Verification, ENS Cachan, France, February 2004.
    [ postscript ]

  • S. Lasota. A polynomial-time algorithm for deciding true concurrency equivalences of Basic Parallel Processes.
    Research Report LSV-02-13, Lab. Specification and Verification, ENS Cachan, France, September 2002.
    [ gzipped postscript ]

  • Koronacki, J., Lasota, S., Niemiro, W. Position Emission Tomography by Markov Chain Monte Carlo with Auxiliary Variables: A Basic Algorithm.
    Technical Report 884 IPI PAN, 1999.

  • Dietzfelbinger, M., Gambin, A., Lasota, S. On Different Models for Packet Flow in Multistage Interconnection Networks.
    Technical report 97-11(248), Institute of Informatics, Warsaw University, 1997.
    [ gzipped postscript ]

  • Lasota, S. Open Maps as a Bridge between Algebraic Observational Equivalence and Bisimilarity. The full version.
    Technical report 97-12(249), Institute of Informatics, Warsaw University, 1997.
    [ gzipped postscript ]