Edward Ochmanski

33 papers A* 2A 1B 3C 2Journal 20Unranked 4
YearRankTypeTitle / Venue / Authors
2015 J jnl
Hierarchy of persistence with respect to the length of action's disability.
CoRR
Kamila Barylska, Edward Ochmanski
2013 J jnl
On persistent reachability in Petri nets.
Inf. Comput.
Kamila Barylska, Lukasz Mikulski, Edward Ochmanski
2012 — conf
Hierarchy of persistency with respect to the length of actions disability.
PNSE
Kamila Agata Barylska, Edward Ochmanski
2010 — conf
On Persistent Reachability in Petri Nets.
ACSD/Petri Nets Workshops
Kamila Barylska, Lukasz Mikulski, Edward Ochmanski
2009 J jnl
Levels of Persistency in Place/Transition Nets.
Fundam. Informaticae
Kamila Barylska, Edward Ochmanski
2008 B ed.
Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings
MFCS
Edward Ochmanski, Jerzy Tyszkiewicz
2008 J jnl
On Trace-Expressible Behaviour of Petri Nets.
Fundam. Informaticae
Joanna Jólkowska, Edward Ochmanski
2007 C conf
A Star Operation for Star-Free Trace Languages.
Developments in Language Theory
Edward Ochmanski, Krystyna Stawikowska
2007 J jnl
On Ethics of Mazurkiewicz Traces.
Fundam. Informaticae
Edward Ochmanski, Joanna Pieckowska
2007 C conf
On Star-Free Trace Languages and their Lexicographic Representations.
LATA
Krystyna Stawikowska, Edward Ochmanski
2006 J jnl
Star-free Star and Trace Languages.
Fundam. Informaticae
Edward Ochmanski, Krystyna Stawikowska
2006 J jnl
Trace Nets and Conflict-free Computations.
Fundam. Informaticae
Edward Ochmanski, Joanna Pieckowska
2005 J jnl
On Star-Connected Flat Languages.
Fundam. Informaticae
Barbara Klunder, Edward Ochmanski, Krystyna Stawikowska
2004 J jnl
Best Fairness Hierarchy in Elementary Nets.
Fundam. Informaticae
Edward Ochmanski
2004 — conf
Covering Fairness against Conspiracies.
ICATPN
Edward Ochmanski
1995 — ch.
Recognizable Trace Languages.
The Book of Traces
Edward Ochmanski
1994 J jnl
On Confluent Semi-commutations: Decidability and Complexity Results
Inf. Comput.
Volker Diekert, Edward Ochmanski, Klaus Reinhardt
1993 A* conf
On Regular Compatibility of Semi-Commutations.
ICALP
Edward Ochmanski, Pierre-André Wacrenier
1992 J jnl
Decidability of the Star Problem in A* x {b}*.
Inf. Process. Lett.
Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy
1992 B conf
Modelling Concurrency with Semi-Commutations.
MFCS
Edward Ochmanski
1991 A* conf
On Confluent Semi-Commutations - Decidability and Complexity Results.
ICALP
Volker Diekert, Edward Ochmanski, Klaus Reinhardt
1990 J jnl
Inevitability in diamond processes.
RAIRO Theor. Informatics Appl.
Edward Ochmanski, Wojciech Penczek
1990 J jnl
Notes on a star mystery.
Bull. EATCS
Edward Ochmanski
1990 J jnl
On confluent semi-commutations: decidability and complexity results
Forschungsberichte, TU Munich
Volker Diekert, Edward Ochmanski, Klaus Reinhardt
1990 B conf
Semi-Commutation and Deterministic Petri Nets.
MFCS
Edward Ochmanski
1989 J jnl
Concurrent Systems and Inevitability.
Theor. Comput. Sci.
Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek
1989 J jnl
Semi-commutation for P-T Systems.
Bull. EATCS
Edward Ochmanski
1988 A conf
On Morphisms of Trace Monoids.
STACS
Edward Ochmanski
1987 J jnl
A non-invertible PCF language.
Bull. EATCS
Edward Ochmanski
1987 J jnl
Inevitability in Concurrent Systems.
Inf. Process. Lett.
Edward Ochmanski
1987 — conf
Occurrence Traces: Processes of Elementary Net Systems.
European Workshop on Applications and Theory of Petri Nets
Edward Ochmanski
1987 J jnl
On Lexicographic Semi-Commutations.
Inf. Process. Lett.
Yves Métivier, Edward Ochmanski
1985 J jnl
Regular behaviour of concurrent systems.
Bull. EATCS
Edward Ochmanski