Edward Ochmanski - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2013

On persistent reachability in Petri netsKamila Barylska, Lukasz Mikulski, Edward Ochmanski. iandc, 223:67-77, 2013. [doi]

2012

Hierarchy of persistency with respect to the length of actions disabilityKamila Agata Barylska, Edward Ochmanski. apn 2012: 125-137 [doi]

2010

On Persistent Reachability in Petri NetsKamila Barylska, Lukasz Mikulski, Edward Ochmanski. acsd 2010: 373-384 [doi]

2009

Levels of Persistency in Place/Transition NetsKamila Barylska, Edward Ochmanski. FUIN, 93(1-3):33-43, 2009. [doi]

2008

On Trace-Expressible Behaviour of Petri NetsJoanna Jólkowska, Edward Ochmanski. FUIN, 85(1-4):281-295, 2008. [doi]

2007

A Star Operation for Star-Free Trace LanguagesEdward Ochmanski, Krystyna Stawikowska. dlt 2007: 337-345 [doi]

On Ethics of Mazurkiewicz TracesEdward Ochmanski, Joanna Pieckowska. FUIN, 80(1-3):259-272, 2007. [doi]

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

2006

Star-free Star and Trace LanguagesEdward Ochmanski, Krystyna Stawikowska. FUIN, 72(1-3):323-331, 2006. [doi]

Trace Nets and Conflict-free ComputationsEdward Ochmanski, Joanna Pieckowska. FUIN, 72(1-3):311-321, 2006. [doi]

2005

On Star-Connected Flat LanguagesBarbara Klunder, Edward Ochmanski, Krystyna Stawikowska. FUIN, 67(1-3):93-105, 2005. [doi]

2004

Covering Fairness against ConspiraciesEdward Ochmanski. apn 2004: 312-330 [doi]

Best Fairness Hierarchy in Elementary NetsEdward Ochmanski. FUIN, 60(1-4):237-250, 2004. [doi]

1995

Recognizable Trace LanguagesEdward Ochmanski. In Volker Diekert, Grzegorz Rozenberg, editors, The Book of Traces. pages 167-204, World Scientific, 1995. [doi]

1994

On Confluent Semi-commutations: Decidability and Complexity ResultsVolker Diekert, Edward Ochmanski, Klaus Reinhardt. iandc, 110(1):164-182, April 1994.

1993

On Regular Compatibility of Semi-CommutationsEdward Ochmanski, Pierre-André Wacrenier. icalp 1993: 445-456

1992

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

Modelling Concurrency with Semi-CommutationsEdward Ochmanski. mfcs 1992: 412-420

1991

On Confluent Semi-Commutations - Decidability and Complexity ResultsVolker Diekert, Edward Ochmanski, Klaus Reinhardt. icalp 1991: 229-241

1990

Semi-Commutation and Deterministic Petri NetsEdward Ochmanski. mfcs 1990: 430-438

Notes on a star mysteryEdward Ochmanski. eatcs, 40:252-256, 1990.

Inevitability in diamond processesEdward Ochmanski, Wojciech Penczek. ita, 24:37-46, 1990.

1989

Concurrent Systems and InevitabilityAntoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek. TCS, 64(3):281-304, 1989.

Semi-commutation for P-T SystemsEdward Ochmanski. eatcs, 38:191-198, 1989.

1988

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

1987

On Lexicographic Semi-CommutationsYves Métivier, Edward Ochmanski. ipl, 26(2):55-59, 1987.

Occurrence Traces: Processes of Elementary Net SystemsEdward Ochmanski. apn 1988: 331-342

A non-invertible PCF languageEdward Ochmanski. eatcs, 33:83-84, 1987.

Inevitability in Concurrent SystemsEdward Ochmanski. ipl, 25(4):221-225, 1987.

1985

Regular behaviour of concurrent systemsEdward Ochmanski. eatcs, 27:56-67, 1985.

Sign in or sign up to see more results.

runs on WebDSL