| ||
1. | An extension of data automata that captures XPath
LOGICAL METHODS IN COMPUTER SCIENCE Vol. 8 Nr 1 yr. 2012, pp. (Article) Mikołaj Bojańczyk, Sławomir Lasota | |
2. | Tav4SB: integrating tools for analysis of kinetic models of biological systems
BMC SYSTEMS BIOLOGY Vol. 6 Nr 1 yr. 2012, pp. (Article) Anna Gambin, Mikołaj Rybiński, Michał Lula, Sławomir Lasota, Paweł Banasik | |
3. | Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes
LECTURE NOTES IN COMPUTER SCIENCE Vol. 6901 yr. 2011, pp. 528-542 (Conference article) Wojciech Czerwiński, Piotr Hofman, Sławomir Lasota | |
4. | Partially-commutative context-free processes: expressibility and tractability
INFORMATION AND COMPUTATION Vol. 209 Nr 5 yr. 2011, pp. 782-798 (Article) Wojciech Czerwiński, Sibylle Froeschle, Sławomir Lasota | |
5. | Non-interleaving bisimulation equivalences on Basic Parallel Processes
INFORMATION AND COMPUTATION Vol. 208 Nr 1 yr. 2010, pp. 42-62 (Article) Sibylle B. Fröschle, Petr Jancar, Sławomir Lasota, Zdenek Sawa | |
6. | EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system
INFORMATION PROCESSING LETTERS Vol. 109 Nr 15 yr. 2009, pp. 850-855 (Article) Sławomir Lasota | |
7. | Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences
Electronic Notes in Theoretical Computer Science Vol. 239 yr. 2009, pp. 17-42 (Article) Sibylle B. Fröschle, Sławomir Lasota | |
8. | On Subset Seeds for Protein Alignment
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS Vol. 6 Nr 3 yr. 2009, pp. 483-494 (Article) Mikhail A. Roytberg, Anna Gambin, Laurent Noé, Sławomir Lasota, Eugenia Furletova, Ewa Szczurek, Gregory Kucherov | |
9. | Partially-Commutative Context-Free Processes
LECTURE NOTES IN COMPUTER SCIENCE Vol. 5710 yr. 2009, pp. 259-273 (Article) Wojciech Czerwiński, Sibylle B. Fröschle, Sławomir Lasota | |
10. | Alternating timed automata
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC Vol. 9 Nr 2 yr. 2008, pp. (Article) Sławomir Lasota, Igor Walukiewicz | |
11. | Logical Relations for Monadic Types
MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE Vol. 18 Nr 6 yr. 2008, pp. 1169-1217 (Article) Jean Goubault-Larrecq, Sławomir Lasota, David Nowak | |
12. | Causality Versus True-Concurrency
THEORETICAL COMPUTER SCIENCE Vol. 386 yr. 2007, pp. 169-187 (Article) Sibylle Froeschle, Sławomir Lasota | |
13. | Diversity and structure of PIF/Harbinger-like elements in the genome of Medicago truncatula
BMC GENOMICS Vol. 8 yr. 2007, pp. 409-409 (Article) D. Grzebelus, Sławomir Lasota, T. Gambin, G. Kucherov, Anna Gambin | |
14. | Analyzing stationary states of gene regulatory network using Petri nets
IN SILICO BIOLOGY Vol. 6 yr. 2006, pp. 10-10 (Article) Anna Gambin, Sławomir Lasota, Michal Rutkowski | |
15. | Causality Versus True-Concurrency
Electronic Notes in Theoretical Computer Science Vol. 154 Nr 3 yr. 2006, pp. 3-18 (Conference article) Sibylle Froeschle, Sławomir Lasota | |
16. | Decidability of Performance Equivalence for Basic Parallel Processes
THEORETICAL COMPUTER SCIENCE Vol. 360 yr. 2006, pp. 172-192 (Article) Sławomir Lasota | |
17. | Faster algorithm for bisimulation equivalence of normed context-free processes
LECTURE NOTES IN COMPUTER SCIENCE Vol. 4162 yr. 2006, pp. 646-657 (Conference article) Sławomir Lasota, Wojciech Rytter | |
18. | Alternating Timed Automata
LECTURE NOTES IN COMPUTER SCIENCE Vol. 3441 yr. 2005, pp. 250-265 (Conference article) Sławomir Lasota, Igor Walukiewicz | |
19. | Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP
LECTURE NOTES IN COMPUTER SCIENCE Vol. 3653 yr. 2005, pp. 263-277 (Conference article) Sławomir Lasota, Sibylle Froeschle | |
20. | Petri Net + Nested Relational Calculus = Dataflow
LECTURE NOTES IN COMPUTER SCIENCE Vol. 3760 yr. 2005, pp. 220-237 (Conference article) Jan Hidders, Natalia Kwasnikowska, Sławomir Lasota, Jacek Sroka, Jerzy Tyszkiewicz, Jan Van den Bussche | |
21. | Position Emission Tomography by Markov Chain Monte Carlo with Auxiliary Variables
PATTERN RECOGNITION Vol. 38 Nr 2 yr. 2005, pp. 241-250 (Article) Jacek Koronacki, Sławomir Lasota, Wojciech Niemiro | |
22. | Complete lax logical relations for cryptographic lambda-calculi
LECTURE NOTES IN COMPUTER SCIENCE Vol. 3210 yr. 2004, pp. 400-414 (Conference article) Jean Goubault-Larrecq, Sławomir Lasota, David Nowak, Yu Zhang | |
23. | A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes
LECTURE NOTES IN COMPUTER SCIENCE Vol. 2747 yr. 2003, pp. 521-530 (Conference article) Sławomir Lasota | |
24. | A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise
PATTERN RECOGNITION Vol. 36 yr. 2003, pp. 931-941 (Article) Sławomir Lasota, Wojciech Niemiro | |
25. | Coalgebra morphisms subsume open maps
THEORETICAL COMPUTER SCIENCE Vol. 280 yr. 2002, pp. 123-135 (Article) Sławomir Lasota |