The following pages link to Sławomir Lasota (Q344533):
Displayed 50 items.
- Equivariant algorithms for constraint satisfaction problems over coset templates (Q344534) (← links)
- Undecidability of performance equivalence of Petri nets (Q507373) (← links)
- Partially-commutative context-free processes: expressibility and tractability (Q532392) (← links)
- EXPSPACE lower bounds for the simulation preorder between a communication-free Petri net and a finite-state system (Q989507) (← links)
- Item:Q344533 (redirect page) (← links)
- Non-interleaving bisimulation equivalences on basic parallel processes (Q1049404) (← links)
- Coalgebra morphisms subsume open maps (Q1603818) (← links)
- Reachability relations of timed pushdown automata (Q2221811) (← links)
- Nondeterministic and co-nondeterministic implies deterministic, for data languages (Q2233422) (← links)
- Decidability of branching bisimulation on normed commutative context-free processes (Q2254493) (← links)
- Causality versus true-concurrency (Q2465026) (← links)
- Decidability of performance equivalence for basic parallel processes (Q2503324) (← links)
- A lower bound for the coverability problem in acyclic pushdown VAS (Q2656343) (← links)
- (Q2762270) (← links)
- (Q2767007) (← links)
- Simulation Problems Over One-Counter Nets (Q2800968) (← links)
- Coverability Trees for Petri Nets with Unordered Data (Q2811357) (← links)
- Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture (Q2822649) (← links)
- (Q2852059) (← links)
- Automata theory in nominal sets (Q2878750) (← links)
- An extension of data automata that captures XPath (Q2881071) (← links)
- (Q2908855) (← links)
- Towards nominal computation (Q2942888) (← links)
- Simulation Over One-counter Nets is PSPACE-Complete (Q2963939) (← links)
- Relating timed and register automata (Q2971073) (← links)
- Decidability of Branching Bisimulation on Normed Commutative Context-Free Processes (Q3090854) (← links)
- A Machine-Independent Characterization of Timed Languages (Q3167002) (← links)
- Partially-Commutative Context-Free Processes (Q3184678) (← links)
- Logical relations for monadic types (Q3545276) (← links)
- (Q3839057) (← links)
- (Q4219023) (← links)
- (Q4247682) (← links)
- (Q4256308) (← links)
- (Q4411847) (← links)
- (Q4472004) (← links)
- (Q4484511) (← links)
- Turing machines with atoms, constraint satisfaction problems, and descriptive complexity (Q4635643) (← links)
- Timed Pushdown Automata Revisited (Q4635851) (← links)
- (Q4636561) (← links)
- Separability of Reachability Sets of Vector Addition Systems (Q4636622) (← links)
- Fraenkel-Mostowski Sets with Non-homogeneous Atoms (Q4899138) (← links)
- (Q4963999) (← links)
- (Q4968382) (← links)
- Binary Reachability of Timed-register Pushdown Automata and Branching Vector Addition Systems (Q4972152) (← links)
- (Q4986258) (← links)
- (Q5002803) (← links)
- (Q5009439) (← links)
- (Q5009453) (← links)
- The Reachability Problem for Petri Nets Is Not Elementary (Q5056399) (← links)
- (Q5089309) (← links)