×

zbMATH — the first resource for mathematics

Lasota, Sławomir

Compute Distance To:
Author ID: lasota.slawomir Recent zbMATH articles by "Lasota, Sławomir"
Published as: Lasota, Slawomir; Lasota, Sławomir
Documents Indexed: 56 Publications since 1998, including 1 Book

Publications by Year

Citations contained in zbMATH

39 Publications have been cited 129 times in 90 Documents Cited by Year
Automata theory in nominal sets. Zbl 1338.68140
Bojańczyk, Mikołaj; Klin, Bartek; Lasota, Sławomir
12
2014
Towards nominal computation. Zbl 1321.68139
Bojanczyk, Mikolaj; Braud, Laurent; Klin, Bartek; Lasota, Slawomir
11
2012
Alternating timed automata. Zbl 1367.68172
Lasota, Slawomir; Walukiewicz, Igor
8
2008
Normed processes, unique decomposition, and complexity of bisimulation equivalences. Zbl 1347.68264
Fröschle, Sibylle; Lasota, Sławomir
7
2009
Turing machines with atoms. Zbl 1367.68098
Bojánczyk, Mikolaj; Klin, Bartek; Lasota, Sławomir; Toruńczyk, Szymon
6
2013
A polynomial-time algorithm for deciding true concurrency equivalences of basic parallel processes. Zbl 1124.68392
Lasota, Sławomir
6
2003
Coverability trees for Petri nets with unordered data. Zbl 06591835
Hofman, Piotr; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Schmitz, Sylvain; Totzke, Patrick
5
2016
Logical relations for monadic types. Zbl 1156.03014
Goubault-Larrecq, Jean; Lasota, Sławomir; Nowak, David
5
2008
Faster algorithm for bisimulation equivalence of normed context-free processes. Zbl 1132.68498
Lasota, Sławomir; Rytter, Wojciech
5
2006
Relating timed and register automata. Zbl 1362.68138
Figueira, Diego; Hofman, Piotr; Lasota, Sławomir
4
2016
Simulation problems over one-counter nets. Zbl 1448.68342
Hofman, Piotr; Lasota, Slawomir; Mayr, Richard; Totzke, Patrick
4
2016
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. Zbl 1401.68079
Klin, Bartek; Lasota, Sławomir; Ochremiak, Joanna; Toruńczyk, Szymon
4
2014
Fast equivalence-checking for normed context-free processes. Zbl 1245.68134
Czerwiński, Wojciech; Lasota, Sławomir
4
2010
Decidability of performance equivalence for basic parallel processes. Zbl 1099.68070
Lasota, Sławomir
4
2006
Alternating timed automata. Zbl 1119.68109
Lasota, Sławomir; Walukiewicz, Igor
4
2005
An extension of data automata that captures XPath. Zbl 1241.68077
Bojańczyk, Mikołaj; Lasota, Sławomir
3
2012
Logical relations for monadic types. Zbl 1021.03003
Goubault-Larrecq, Jean; Lasota, Slawomir; Nowak, David
3
2002
Decidability of strong bisimilarity for timed BPP. Zbl 1012.68126
Lasota, Sławomir
3
2002
The reachability problem for Petri nets is not elementary. Zbl 1433.68245
Czerwiński, Wojciech; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Mazowiecki, Filip
2
2019
Timed pushdown automata revisited. Zbl 1401.68157
Clemente, Lorenzo; Lasota, Sławomir
2
2015
Reachability analysis of first-order definable pushdown systems. Zbl 1373.68280
Clemente, Lorenzo; Lasota, Slawomir
2
2015
Simulation over one-counter nets is PSPACE-complete. Zbl 1359.68223
Hofman, Piotr; Lasota, Slawomir; Mayr, Richard; Totzke, Patrick
2
2013
Reachability problem for weak multi-pushdown automata. Zbl 1364.68247
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2012
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1343.68164
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2011
Non-interleaving bisimulation equivalences on basic parallel processes. Zbl 1185.68444
Fröschle, Sibylle; Jančar, Petr; Lasota, Slawomir; Sawa, Zdeněk
2
2010
Decomposition and complexity of hereditary history preserving bisimulation on BPP. Zbl 1134.68434
Fröschle, Sibylle; Lasota, Sławomir
2
2005
Coalgebra morphisms subsume open maps. Zbl 1014.68106
Lasota, Sławomir
2
2002
Coalgebra morphisms subsume open maps. Zbl 0918.68022
Lasota, Slawomir
2
1999
WQO dichotomy for 3-graphs. Zbl 06904556
Lasota, Sławomir; Piórkowski, Radosław
1
2018
Separability of reachability sets of vector addition systems. Zbl 1402.68132
Clemente, Lorenzo; Czerwiński, Wojciech; Lasota, Sławomir; Paperman, Charles
1
2017
Decidability border for Petri nets with data: WQO dichotomy conjecture. Zbl 1346.68137
Lasota, Sławomir
1
2016
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1319.68147
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2014
Reachability problem for weak multi-pushdown automata. Zbl 1274.68156
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2013
A machine-independent characterization of timed languages. Zbl 1367.68159
Bojańczyk, Mikołaj; Lasota, Sławomir
1
2012
Partially-commutative context-free processes. Zbl 1254.68164
Czerwiński, Wojciech; Fröschle, Sibylle; Lasota, Sławomir
1
2009
Causality versus true-concurrency. Zbl 1143.68052
Fröschle, Sibylle; Lasota, Sławomir
1
2007
Complete lax logical relations for cryptographic lambda-calculi. Zbl 1095.03009
Goubault-Larrecq, Jean; Lasota, Sławomir; Nowak, David; Zhang, Yu
1
2004
Weak bisimilarity and open maps. Zbl 0936.68070
Lasota, Sławomir
1
1998
Open maps as a bridge between algebraic observational equivalence and bisimilarity. Zbl 0903.08008
Lasota, Sławomir
1
1998
The reachability problem for Petri nets is not elementary. Zbl 1433.68245
Czerwiński, Wojciech; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Mazowiecki, Filip
2
2019
WQO dichotomy for 3-graphs. Zbl 06904556
Lasota, Sławomir; Piórkowski, Radosław
1
2018
Separability of reachability sets of vector addition systems. Zbl 1402.68132
Clemente, Lorenzo; Czerwiński, Wojciech; Lasota, Sławomir; Paperman, Charles
1
2017
Coverability trees for Petri nets with unordered data. Zbl 06591835
Hofman, Piotr; Lasota, Sławomir; Lazić, Ranko; Leroux, Jérôme; Schmitz, Sylvain; Totzke, Patrick
5
2016
Relating timed and register automata. Zbl 1362.68138
Figueira, Diego; Hofman, Piotr; Lasota, Sławomir
4
2016
Simulation problems over one-counter nets. Zbl 1448.68342
Hofman, Piotr; Lasota, Slawomir; Mayr, Richard; Totzke, Patrick
4
2016
Decidability border for Petri nets with data: WQO dichotomy conjecture. Zbl 1346.68137
Lasota, Sławomir
1
2016
Timed pushdown automata revisited. Zbl 1401.68157
Clemente, Lorenzo; Lasota, Sławomir
2
2015
Reachability analysis of first-order definable pushdown systems. Zbl 1373.68280
Clemente, Lorenzo; Lasota, Slawomir
2
2015
Automata theory in nominal sets. Zbl 1338.68140
Bojańczyk, Mikołaj; Klin, Bartek; Lasota, Sławomir
12
2014
Turing machines with atoms, constraint satisfaction problems, and descriptive complexity. Zbl 1401.68079
Klin, Bartek; Lasota, Sławomir; Ochremiak, Joanna; Toruńczyk, Szymon
4
2014
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1319.68147
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2014
Turing machines with atoms. Zbl 1367.68098
Bojánczyk, Mikolaj; Klin, Bartek; Lasota, Sławomir; Toruńczyk, Szymon
6
2013
Simulation over one-counter nets is PSPACE-complete. Zbl 1359.68223
Hofman, Piotr; Lasota, Slawomir; Mayr, Richard; Totzke, Patrick
2
2013
Reachability problem for weak multi-pushdown automata. Zbl 1274.68156
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
1
2013
Towards nominal computation. Zbl 1321.68139
Bojanczyk, Mikolaj; Braud, Laurent; Klin, Bartek; Lasota, Slawomir
11
2012
An extension of data automata that captures XPath. Zbl 1241.68077
Bojańczyk, Mikołaj; Lasota, Sławomir
3
2012
Reachability problem for weak multi-pushdown automata. Zbl 1364.68247
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2012
A machine-independent characterization of timed languages. Zbl 1367.68159
Bojańczyk, Mikołaj; Lasota, Sławomir
1
2012
Decidability of branching bisimulation on normed commutative context-free processes. Zbl 1343.68164
Czerwiński, Wojciech; Hofman, Piotr; Lasota, Sławomir
2
2011
Fast equivalence-checking for normed context-free processes. Zbl 1245.68134
Czerwiński, Wojciech; Lasota, Sławomir
4
2010
Non-interleaving bisimulation equivalences on basic parallel processes. Zbl 1185.68444
Fröschle, Sibylle; Jančar, Petr; Lasota, Slawomir; Sawa, Zdeněk
2
2010
Normed processes, unique decomposition, and complexity of bisimulation equivalences. Zbl 1347.68264
Fröschle, Sibylle; Lasota, Sławomir
7
2009
Partially-commutative context-free processes. Zbl 1254.68164
Czerwiński, Wojciech; Fröschle, Sibylle; Lasota, Sławomir
1
2009
Alternating timed automata. Zbl 1367.68172
Lasota, Slawomir; Walukiewicz, Igor
8
2008
Logical relations for monadic types. Zbl 1156.03014
Goubault-Larrecq, Jean; Lasota, Sławomir; Nowak, David
5
2008
Causality versus true-concurrency. Zbl 1143.68052
Fröschle, Sibylle; Lasota, Sławomir
1
2007
Faster algorithm for bisimulation equivalence of normed context-free processes. Zbl 1132.68498
Lasota, Sławomir; Rytter, Wojciech
5
2006
Decidability of performance equivalence for basic parallel processes. Zbl 1099.68070
Lasota, Sławomir
4
2006
Alternating timed automata. Zbl 1119.68109
Lasota, Sławomir; Walukiewicz, Igor
4
2005
Decomposition and complexity of hereditary history preserving bisimulation on BPP. Zbl 1134.68434
Fröschle, Sibylle; Lasota, Sławomir
2
2005
Complete lax logical relations for cryptographic lambda-calculi. Zbl 1095.03009
Goubault-Larrecq, Jean; Lasota, Sławomir; Nowak, David; Zhang, Yu
1
2004
A polynomial-time algorithm for deciding true concurrency equivalences of basic parallel processes. Zbl 1124.68392
Lasota, Sławomir
6
2003
Logical relations for monadic types. Zbl 1021.03003
Goubault-Larrecq, Jean; Lasota, Slawomir; Nowak, David
3
2002
Decidability of strong bisimilarity for timed BPP. Zbl 1012.68126
Lasota, Sławomir
3
2002
Coalgebra morphisms subsume open maps. Zbl 1014.68106
Lasota, Sławomir
2
2002
Coalgebra morphisms subsume open maps. Zbl 0918.68022
Lasota, Slawomir
2
1999
Weak bisimilarity and open maps. Zbl 0936.68070
Lasota, Sławomir
1
1998
Open maps as a bridge between algebraic observational equivalence and bisimilarity. Zbl 0903.08008
Lasota, Sławomir
1
1998
all top 5

Cited by 144 Authors

16 Lasota, Sławomir
6 Fröschle, Sibylle B.
5 Czerwiński, Wojciech
5 Hofman, Piotr
5 Jančar, Petr
4 Bouyer, Patricia
4 Worrell, James B.
3 Bollig, Benedikt
3 Gabbay, Murdoch James
3 Katsumata, Shin-ya
3 Keshvardoost, Khadijeh
3 Kozen, Dexter C.
3 Krishna, Shankara Narayanan
3 Ouaknine, Joel O.
2 Akshay, S.
2 Babari, Parvaneh
2 Blondin, Michael
2 Brázdil, Tomáš
2 Droste, Manfred
2 Finkel, Alain
2 Gastin, Paul
2 Kiefer, Stefan
2 Klin, Bartek
2 Kucera, Antonin
2 Mahmoudi, Mojgan
2 Mamouras, Konstantinos
2 Markey, Nicolas
2 Milius, Stefan
2 Perevoshchikov, Vitaly
2 Petrisan, Daniela Luan
2 Quaas, Karin
2 Sangnier, Arnaud
2 Sato, Tetsuya
2 Sawa, Zdeněk
2 Schmitz, Sylvain
2 Schnoebelen, Philippe
2 Silva, Alexandra
2 Totzke, Patrick
2 Wißmann, Thorsten
2 Zhang, Yu
1 Abdul Rauf, Rose H.
1 Abdulla, Parosh Aziz
1 Aiswarya, Cyriac
1 Atig, Mohamed Faouzi
1 Baez, John C.
1 Berger, Ulrich
1 Bhave, Devendra
1 Bickford, Mark
1 Bodirsky, Manuel
1 Böhm, Stanislav
1 Bojańczyk, Mikołaj
1 Bolognesi, Tommaso
1 Bonchi, Filippo
1 Bruni, Roberto
1 Brütsch, Benedikt
1 Chatterjee, Krishnendu
1 Ciancia, Vincenzo
1 Corradini, Andrea
1 Dal Lago, Ugo
1 Dave, Vrunda
1 De Nicola, Rocco
1 Demri, Stéphane P.
1 Deng, Yuxin
1 Deters, Morgan
1 Dingel, Juergen
1 Dowek, Gilles
1 Dubut, Jérémy
1 Ebrahimi, Mohammad Mehdi
1 Esparza, Javier
1 Fahrenberg, Uli
1 Figueira, Diego
1 Forejt, Vojtěch
1 Fu, Yuxi
1 Gabbay, Michael J.
1 Gascón, Adrià
1 Gavazzo, Francesco
1 Godoy, Guillem
1 Göller, Stefan
1 Gorla, Daniele
1 Goubault-Larrecq, Jean
1 Große-Rhode, Martin
1 Haddad, Serge
1 Hague, Matthew
1 Heckel, Reiko
1 Ho, Hsi-Ming
1 Huang, Mingzhang
1 Jeż, Artur
1 Karandikar, Prateek
1 Konur, Savas
1 Kot, Martin
1 Labella, Anna
1 Landwehr, Patrick
1 Larsen, Kim Guldstrand
1 Lazić, Ranko
1 Łełyk, Mateusz
1 Leroux, Jérôme
1 Lin, Anthony Widjaja
1 Lösch, Steffen
1 Luttenberger, Michael
1 Luttik, Bas
...and 44 more Authors

Citations by Year