Papers

(see also my DBLP entry or my PubMed entry or my Arxiv reports or my other technical reports below or my ORCID or my Scopus entry)
To the top


Technical reports

  • L. Clemente, W. Czerwiński, S. Lasota, C. Paperman, Regular Separability of Parikh Automata.
    Research Report arXiv:1612.06233, 2016.

  • L. Clemente, W. Czerwiński, S. Lasota, C. Paperman, Separability of Reachability Sets of Vector Addition Systems.
    Research Report arXiv:1609.00214, 2016.

  • 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.

  • P. Hofman, S. Lasota, R. Mayr, P. Totzke, Simulation Problems Over One-Counter Nets.
    Research Report arXiv:1602.00476, 2016.

  • L. Clemente, S.Lasota, Reachability analysis of first-order definable pushdown systems.
    Research Report arXiv:1504.02651, 2015.

  • L. Clemente, S.Lasota, Timed pushdown automata revisited.
    Research Report arXiv:1503.02422, 2015.

  • S. Lasota, Equivariant algorithms for constraint satisfaction problems over coset templates.
    Research Report arXiv:1412.4020, 2014.

  • M. Bojańczyk, S. Lasota, Minimization of semilinear automata.
    Research Report arXiv:1210.4980, 2012.

  • S. Lasota, M. Poturalski, Undecidability of performance equivalence of Petri nets.
    Research Report arXiv:0910.5819, 2009.
    [ PDF ]

  • S. Lasota, D. Nowak, and Y. Zhang. On completeness of logical relations for monadic types.
    Research Report arXiv:cs/0612106, 2006.

  • 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 ]