Lukasz Mikulski

According to our database1, Lukasz Mikulski
  • authored at least 31 papers between 2007 and 2017.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
An extension of the taxonomy of persistent and nonviolent steps.
Inf. Sci., 2017

Alphabets of Acyclic Invariant Structures.
Fundam. Inform., 2017

2016
Conditions for Petri Net Solvable Binary Words.
T. Petri Nets and Other Models of Concurrency, 2016

Step traces.
Acta Inf., 2016

Generating All Minimal Petri Net Unsolvable Binary Words.
Proceedings of the Prague Stringology Conference 2016, 2016

Reversible Computation vs. Reversibility in Petri Nets.
Proceedings of the Reversible Computation - 8th International Conference, 2016

Reversing Transitions in Bounded Petri Nets.
Proceedings of the 25th International Workshop on Concurrency, 2016

2015
Characterising Concurrent Histories.
Fundam. Inform., 2015

Persistent and Nonviolent Steps and the Design of GALS Systems.
Fundam. Inform., 2015

Square-Free Words over Partially Commutative Alphabets.
Proceedings of the Language and Automata Theory and Applications, 2015

Order Structures for Subclasses of Generalised Traces.
Proceedings of the Language and Automata Theory and Applications, 2015

On Decidability of Persistence Notions.
Proceedings of the 24th International Workshop on Concurrency, 2015

On Binary Words Being Petri Net Solvable.
Proceedings of the International Workshop on Algorithms & Theories for the Analysis of Event Data, 2015

2014
Folded Hasse diagrams of combined traces.
Inf. Process. Lett., 2014

On Generation of Context-Abstract Plans.
Proceedings of the Software Engineering and Formal Methods, 2014

Generating CA-Plans from Multisets of Services.
Proceedings of the International Workshop on Petri Nets and Software Engineering, 2014

2013
On persistent reachability in Petri nets.
Inf. Comput., 2013

Algorithmics of Posets Generated by Words Over Partially Commutative Alphabets (Extended).
Sci. Ann. Comp. Sci., 2013

Algebraic Structure of Combined Traces.
Logical Methods in Computer Science, 2013

Causal Structures for General Concurrent Behaviours.
Proceedings of the 22nd International Workshop on Concurrency, 2013

A Taxonomy of Persistent and Nonviolent Steps.
Proceedings of the Application and Theory of Petri Nets and Concurrency, 2013

Lexicographical Generations of Combined Traces.
Proceedings of the 13th International Conference on Application of Concurrency to System Design, 2013

2012
Algebraic Structure of Combined Traces.
Proceedings of the CONCUR 2012 - Concurrency Theory - 23rd International Conference, 2012

Hasse Diagrams of Combined Traces.
Proceedings of the 12th International Conference on Application of Concurrency to System Design, 2012

2011
Algorithmics of Posets Generated by Words over Partially Commutative Alphabets.
Proceedings of the Prague Stringology Conference 2011, 2011

2010
On Persistent Reachability in Petri Nets.
Proceedings of the Workshops of the 31st International Conference on Application and Theory of Petri Nets and Other Models of Concurrency (PETRI NETS 2010) and of the 10th International Conference on Application of Concurrency to System Design (ACSD 2010), 2010

2009
Transposition Rearrangement: Linear Algorithm for Length-Cost Model.
Annales UMCS, Informatica, 2009

Contests Hosting Service as a tool to teach programming.
Annales UMCS, Informatica, 2009

Internal Conflict-Free Projection Sets.
Proceedings of the Man-Machine Interactions, 2009

2008
Projection Representation of Mazurkiewicz Traces.
Fundam. Inform., 2008

2007
Asynchronous Parallel Molecular Dynamics Simulations.
Proceedings of the Parallel Processing and Applied Mathematics, 2007


  Loading...