| Hierarchy of persistence with respect to the length of action's disability. | 2 | 0.38 | 2015 |
| Hierarchy of persistency with respect to the length of actions disability. | 0 | 0.34 | 2012 |
| On persistent reachability in Petri nets | 4 | 0.47 | 2010 |
| Mathematical Foundations of Computer Science 2008: 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings | 37 | 2.23 | 2008 |
| On Trace-Expressible Behaviour of Petri Nets | 0 | 0.34 | 2008 |
| A star operation for star-free trace languages | 3 | 0.42 | 2007 |
| On Ethics of Mazurkiewicz Traces | 0 | 0.34 | 2007 |
| On Star-Free Trace Languages and their Lexicographic Representations. | 1 | 0.37 | 2007 |
| Star-free Star and Trace Languages | 3 | 0.42 | 2006 |
| Trace Nets and Conflict-free Computations | 0 | 0.34 | 2006 |
| On Star-Connected Flat Languages | 2 | 0.51 | 2005 |
| Covering Fairness against Conspiracies | 0 | 0.34 | 2004 |
| On Regular Compatibility of Semi-Commutations | 5 | 0.58 | 1993 |
| Modelling Concurrency with Semi-Commutations | 3 | 0.46 | 1992 |
| Decidability of the Star Problem in A∗ × {b}∗ | 7 | 0.60 | 1992 |
| On confluent semi-commutations: decidability and complexity results | 0 | 0.34 | 1991 |
| Inevitability in diamond processes | 0 | 0.34 | 1990 |
| Notes on a star mystery | 7 | 0.58 | 1990 |
| Semi-commutation and deterministic Petri Nets | 2 | 0.59 | 1990 |
| Semi-commutation for P-T Systems | 1 | 0.35 | 1989 |
| Concurrent systems and inevitability | 16 | 1.22 | 1989 |
| On Morphisms of Trace Monoids | 8 | 0.71 | 1988 |
| A non-invertible PCF language | 0 | 0.34 | 1987 |
| Inevitability in concurrent systems | 4 | 0.78 | 1987 |
| Regular behaviour of concurrent systems | 80 | 7.06 | 1985 |
