( en | de | ru )

 

Disambiguation of "Lasota, Slawomir"

Author of the publication

copydeleteadd this publication to your clipboard
The reachability problem for Petri nets is not elementary.

, , , , and . STOC, page 24-33. ACM, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Bogdan Lasota

Joanna Lasota

Katarzyna Lasota

Slawomir Olszewski

Slawomir Plesz

 

Other publications of authors with the same name

Definable isomorphism problem., , , , and . Log. Methods Comput. Sci., (2019)Determinisability of register and timed automata., , and . Log. Methods Comput. Sci., (2022)Reachability relations of timed pushdown automata., and . CoRR, (2020)A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes.. MFCS, volume 2747 of Lecture Notes in Computer Science, page 521-530. Springer, (2003)Decidability of Strong Bisimilarity for Timed BPP.. CONCUR, volume 2421 of Lecture Notes in Computer Science, page 562-578. Springer, (2002)Partial-Congruence Factorization of Bisimilarity Induced by Open Maps.. ICALP, volume 1443 of Lecture Notes in Computer Science, page 91-102. Springer, (1998)On Completeness of Logical Relations for Monadic Types., , and . ASIAN, volume 4435 of Lecture Notes in Computer Science, page 223-230. Springer, (2006)Weak Bisimilarity and Open Maps.. SOFSEM, volume 1521 of Lecture Notes in Computer Science, page 381-388. Springer, (1998)A Machine-Independent Characterization of Timed Languages., and . ICALP (2), volume 7392 of Lecture Notes in Computer Science, page 92-103. Springer, (2012)WQO Dichotomy for 3-Graphs., and . FoSSaCS, volume 10803 of Lecture Notes in Computer Science, page 548-564. Springer, (2018)