Edward Ochmanski

Kamila Barylska, Lukasz Mikulski, Edward Ochmanski: On persistent reachability in Petri nets. Inf. Comput. 223: 67-77 (2013)

Kamila Barylska, Lukasz Mikulski, Edward Ochmanski: On Persistent Reachability in Petri Nets. ACSD/Petri Nets Workshops 2010: 373-384

Kamila Barylska, Edward Ochmanski: Levels of Persistency in Place/Transition Nets. Fundam. Inform. 93(1-3): 33-43 (2009)

Joanna Jólkowska, Edward Ochmanski: On Trace-Expressible Behaviour of Petri Nets. Fundam. Inform. 85(1-4): 281-295 (2008)

Edward Ochmanski, Jerzy Tyszkiewicz (Eds.): Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings. Lecture Notes in Computer Science 5162, Springer 2008, isbn 978-3-540-85237-7

Edward Ochmanski, Joanna Pieckowska: On Ethics of Mazurkiewicz Traces. Fundam. Inform. 80(1-3): 259-272 (2007)

Edward Ochmanski, Krystyna Stawikowska: A Star Operation for Star-Free Trace Languages. Developments in Language Theory 2007: 337-345

Krystyna Stawikowska, Edward Ochmanski: On Star-Free Trace Languages and their Lexicographic Representations. LATA 2007: 541-552

Edward Ochmanski, Joanna Pieckowska: Trace Nets and Conflict-free Computations. Fundam. Inform. 72(1-3): 311-321 (2006)

Edward Ochmanski, Krystyna Stawikowska: Star-free Star and Trace Languages. Fundam. Inform. 72(1-3): 323-331 (2006)

Barbara Klunder, Edward Ochmanski, Krystyna Stawikowska: On Star-Connected Flat Languages. Fundam. Inform. 67(1-3): 93-105 (2005)

Edward Ochmanski: Best Fairness Hierarchy in Elementary Nets. Fundam. Inform. 60(1-4): 237-250 (2004)

Edward Ochmanski: Covering Fairness against Conspiracies. ICATPN 2004: 312-330

Volker Diekert, Edward Ochmanski, Klaus Reinhardt: On Confluent Semi-commutations: Decidability and Complexity Results. Inf. Comput. 110(1): 164-182 (1994)

Edward Ochmanski, Pierre-André Wacrenier: On Regular Compatibility of Semi-Commutations. ICALP 1993: 445-456

Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy: Decidability of the Star Problem in A* x {b}*. Inf. Process. Lett. 44(2): 65-71 (1992)

Edward Ochmanski: Modelling Concurrency with Semi-Commutations. MFCS 1992: 412-420

Volker Diekert, Edward Ochmanski, Klaus Reinhardt: On Confluent Semi-Commutations - Decidability and Complexity Results. ICALP 1991: 229-241

Edward Ochmanski: Notes on a star mystery. Bulletin of the EATCS 40: 252-256 (1990)

Edward Ochmanski, Wojciech Penczek: Inevitability in diamond processes. ITA 24: 37-46 (1990)

Edward Ochmanski: Semi-Commutation and Deterministic Petri Nets. MFCS 1990: 430-438

Edward Ochmanski: Semi-commutation for P-T Systems. Bulletin of the EATCS 38: 191-198 (1989)

Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek: Concurrent Systems and Inevitability. Theor. Comput. Sci. 64(3): 281-304 (1989)

Edward Ochmanski: On Morphisms of Trace Monoids. STACS 1988: 346-355

Edward Ochmanski: A non-invertible PCF language. Bulletin of the EATCS 33: 83-84 (1987)

Edward Ochmanski: Inevitability in Concurrent Systems. Inf. Process. Lett. 25(4): 221-225 (1987)

Yves Métivier, Edward Ochmanski: On Lexicographic Semi-Commutations. Inf. Process. Lett. 26(2): 55-59 (1987)

Edward Ochmanski: Occurrence Traces: Processes of Elementary Net Systems. European Workshop on Applications and Theory of Petri Nets 1987: 331-342

Edward Ochmanski: Regular behaviour of concurrent systems. Bulletin of the EATCS 27: 56-67 (1985)