Slawomir Lasota

According to our database1, Slawomir Lasota authored at least 90 papers between 1996 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Symbolic analysis of electric networks with higher order summative cofactors and parameter decision diagrams.
I. J. Circuit Theory and Applications, 2018

The Reachability Problem for Petri Nets is Not Elementary (Extended Abstract).
CoRR, 2018

Binary reachability of timed pushdown automata via quantifier elimination and cyclic order atoms.
CoRR, 2018

Definable isomorphism problem.
CoRR, 2018

WQO dichotomy for 3-graphs.
CoRR, 2018

Linear Equations with Ordered Data.
CoRR, 2018

Binary Reachability of Timed Pushdown Automata via Quantifier Elimination and Cyclic Order Atoms.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

WQO Dichotomy for 3-Graphs.
Proceedings of the Foundations of Software Science and Computation Structures, 2018

Linear Equations with Ordered Data.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

Regular Separability of Well-Structured Transition Systems.
Proceedings of the 29th International Conference on Concurrency Theory, 2018

2017
Equivariant algorithms for constraint satisfaction problems over coset templates.
Inf. Process. Lett., 2017

Regular Separability of Well Structured Transition Systems.
CoRR, 2017

Regular Separability of One Counter Automata.
CoRR, 2017

Separability of Reachability Sets of Vector Addition Systems.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

Regular separability of one counter automata.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Timed pushdown automata and branching vector addition systems.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

Regular Separability of Parikh Automata.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Undecidability of performance equivalence of Petri nets.
Theor. Comput. Sci., 2016

Relating timed and register automata.
Mathematical Structures in Computer Science, 2016

Simulation Problems Over One-Counter Nets.
Logical Methods in Computer Science, 2016

Regular Separability of Parikh Automata.
CoRR, 2016

Separability of Reachability Sets of Vector Addition Systems.
CoRR, 2016

Homomorphism Problems for First-Order Definable Structures.
Proceedings of the 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2016

Coverability Trees for Petri Nets with Unordered Data.
Proceedings of the Foundations of Software Science and Computation Structures, 2016

Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2016

2015
Incremental test case generation using bounded model checking: an application to automatic rating.
STTT, 2015

Reachability analysis of first-order definable pushdown systems.
CoRR, 2015

Timed pushdown automata revisited.
CoRR, 2015

Timed Pushdown Automata Revisited.
Proceedings of the 30th Annual ACM/IEEE Symposium on Logic in Computer Science, 2015

Reachability Analysis of First-order Definable Pushdown Systems.
Proceedings of the 24th EACSL Annual Conference on Computer Science Logic, 2015

2014
Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes.
Theory Comput. Syst., 2014

Bounded width = strict width 2, for coset templates.
CoRR, 2014

Automata theory in nominal sets.
Logical Methods in Computer Science, 2014

Turing machines with atoms, constraint satisfaction problems, and descriptive complexity.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Simulation Over One-counter Nets is PSPACE-Complete.
CoRR, 2013

Reachability Problem for Weak Multi-Pushdown Automata.
Logical Methods in Computer Science, 2013

Turing Machines with Atoms.
Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Simulation Over One-counter Nets is PSPACE-Complete.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2013

2012
Minimization of semilinear automata
CoRR, 2012

Partially-commutative context-free languages
Proceedings of the Proceedings Combined 19th International Workshop on Expressiveness in Concurrency and 9th Workshop on Structured Operational Semantics, 2012

An extension of data automata that captures XPath
Logical Methods in Computer Science, 2012

Tav4SB: integrating tools for analysis of kinetic models of biological systems.
BMC Systems Biology, 2012

Fraenkel-Mostowski Sets with Non-homogeneous Atoms.
Proceedings of the Reachability Problems - 6th International Workshop, 2012

Towards nominal computation.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Fast multilevel & always cancelation-free method for large electric networks exact symbolic analysis.
Proceedings of the 11th IFAC Conference on Programmable Devices and Embedded Systems, 2012

A Machine-Independent Characterization of Timed Languages.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

Reachability Problem for Weak Multi-Pushdown Automata.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

2011
Partially-commutative context-free processes: Expressibility and tractability.
Inf. Comput., 2011

Automata with Group Actions.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes.
Proceedings of the CONCUR 2011 - Concurrency Theory - 22nd International Conference, 2011

Subset Seed Extension to Protein BLAST.
Proceedings of the BIOINFORMATICS 2011, 2011

2010
Non-interleaving bisimulation equivalences on Basic Parallel Processes.
Inf. Comput., 2010

Relating timed and register automata
Proceedings of the Proceedings 17th International Workshop on Expressiveness in Concurrency, 2010

An Extension of Data Automata that Captures XPath.
Proceedings of the 25th Annual IEEE Symposium on Logic in Computer Science, 2010

Fast equivalence-checking for normed context-free processes.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
On Subset Seeds for Protein Alignment.
IEEE/ACM Trans. Comput. Biology Bioinform., 2009

EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system.
Inf. Process. Lett., 2009

Normed Processes, Unique Decomposition, and Complexity of Bisimulation Equivalences.
Electr. Notes Theor. Comput. Sci., 2009

Undecidability of performance equivalence of Petri nets.
CoRR, 2009

Partially-Commutative Context-Free Processes.
Proceedings of the CONCUR 2009 - Concurrency Theory, 20th International Conference, 2009

2008
Alternating timed automata.
ACM Trans. Comput. Log., 2008

Logical relations for monadic types.
Mathematical Structures in Computer Science, 2008

Efficient Seeding Techniques for Protein Similarity Search.
Proceedings of the Bioinformatics Research and Development, 2008

2007
Causality versus true-concurrency.
Theor. Comput. Sci., 2007

2006
Decidability of performance equivalence for basic parallel processes.
Theor. Comput. Sci., 2006

Analyzing Stationary States of Gene Regulatory Network Using Petri Nets.
In Silico Biology, 2006

Causality Versus True-Concurrency.
Electr. Notes Theor. Comput. Sci., 2006

On Completeness of Logical Relations for Monadic Types
CoRR, 2006

Faster Algorithm for Bisimulation Equivalence of Normed Context-Free Processes.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

On Completeness of Logical Relations for Monadic Types.
Proceedings of the Advances in Computer Science, 2006

2005
Positron emission tomography by Markov chain Monte Carlo with auxiliary variables.
Pattern Recognition, 2005

Alternating Timed Automata
CoRR, 2005

Logical Relations for Monadic Types
CoRR, 2005

Alternating Timed Automata.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

Decomposition and Complexity of Hereditary History Preserving Bisimulation on BPP.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
Complete Lax Logical Relations for Cryptographic Lambda-Calculi.
Proceedings of the Computer Science Logic, 18th International Workshop, 2004

2003
A version of the Swendsen-Wang algorithm for restoration of images degraded by Poisson noise.
Pattern Recognition, 2003

A Polynomial-Time Algorithm for Deciding True Concurrency Equivalences of Basic Parallel Processes.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

2002
Coalgebra morphisms subsume open maps.
Theor. Comput. Sci., 2002

Contextual alignment of biological sequences.
Proceedings of the European Conference on Computational Biology (ECCB 2002), 2002

Logical Relations for Monadic Types.
Proceedings of the Computer Science Logic, 16th International Workshop, 2002

Decidability of Strong Bisimilarity for Timed BPP.
Proceedings of the CONCUR 2002, 2002

2001
On Different Models for Packet Flow in Multistage Interconnection Networks.
Fundam. Inform., 2001

2000
Finitary Observations in Regular Algebras.
Proceedings of the SOFSEM 2000: Theory and Practice of Informatics, 27th Conference on Current Trends in Theory and Practice of Informatics, Milovy, Czech Republic, November 25, 2000

Behavioural Constructor Implementation for Regular Algebras.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

1999
Coalgebra morphisms subsume open maps.
Electr. Notes Theor. Comput. Sci., 1999

1998
Weak Bisimilarity and Open Maps.
Proceedings of the SOFSEM '98: Theory and Practice of Informatics, 1998

Partial-Congruence Factorization of Bisimilarity Induced by Open Maps.
Proceedings of the Automata, Languages and Programming, 25th International Colloquium, 1998

1997
Open maps as a bridge between algebraic observational equivalence and bisimilarity.
Proceedings of the Recent Trends in Algebraic Development Techniques, 1997

1996
On the Semantics of Multistage Interconnection Networks.
Proceedings of the SOFSEM '96: Theory and Practice of Informatics, 1996


  Loading...