default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdward Ochmanski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[i2]Kamila Barylska, Edward Ochmanski:
Hierarchy of persistence with respect to the length of action's disability. CoRR abs/1512.01952 (2015)- 2013
- [j18]Kamila Barylska
, Lukasz Mikulski, Edward Ochmanski:
On persistent reachability in Petri nets. Inf. Comput. 223: 67-77 (2013) - 2012
- [c11]Kamila Agata Barylska, Edward Ochmanski:
Hierarchy of persistency with respect to the length of actions disability. PNSE 2012: 125-137 - 2010
- [c10]Kamila Barylska, Lukasz Mikulski, Edward Ochmanski:
On Persistent Reachability in Petri Nets. ACSD/Petri Nets Workshops 2010: 373-384
2000 – 2009
- 2009
- [j17]Kamila Barylska, Edward Ochmanski:
Levels of Persistency in Place/Transition Nets. Fundam. Informaticae 93(1-3): 33-43 (2009) - 2008
- [j16]Joanna Jólkowska, Edward Ochmanski:
On Trace-Expressible Behaviour of Petri Nets. Fundam. Informaticae 85(1-4): 281-295 (2008) - [e1]Edward Ochmanski, Jerzy Tyszkiewicz:
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 [contents] - 2007
- [j15]Edward Ochmanski, Joanna Pieckowska:
On Ethics of Mazurkiewicz Traces. Fundam. Informaticae 80(1-3): 259-272 (2007) - [c9]Edward Ochmanski, Krystyna Stawikowska:
A Star Operation for Star-Free Trace Languages. Developments in Language Theory 2007: 337-345 - [c8]Krystyna Stawikowska, Edward Ochmanski:
On Star-Free Trace Languages and their Lexicographic Representations. LATA 2007: 541-552 - 2006
- [j14]Edward Ochmanski, Joanna Pieckowska:
Trace Nets and Conflict-free Computations. Fundam. Informaticae 72(1-3): 311-321 (2006) - [j13]Edward Ochmanski, Krystyna Stawikowska:
Star-free Star and Trace Languages. Fundam. Informaticae 72(1-3): 323-331 (2006) - 2005
- [j12]Barbara Klunder, Edward Ochmanski, Krystyna Stawikowska:
On Star-Connected Flat Languages. Fundam. Informaticae 67(1-3): 93-105 (2005) - 2004
- [j11]Edward Ochmanski:
Best Fairness Hierarchy in Elementary Nets. Fundam. Informaticae 60(1-4): 237-250 (2004) - [c7]Edward Ochmanski:
Covering Fairness against Conspiracies. ICATPN 2004: 312-330
1990 – 1999
- 1995
- [p1]Edward Ochmanski:
Recognizable Trace Languages. The Book of Traces 1995: 167-204 - 1994
- [j10]Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On Confluent Semi-commutations: Decidability and Complexity Results. Inf. Comput. 110(1): 164-182 (1994) - 1993
- [c6]Edward Ochmanski, Pierre-André Wacrenier:
On Regular Compatibility of Semi-Commutations. ICALP 1993: 445-456 - 1992
- [j9]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) - [c5]Edward Ochmanski:
Modelling Concurrency with Semi-Commutations. MFCS 1992: 412-420 - 1991
- [c4]Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On Confluent Semi-Commutations - Decidability and Complexity Results. ICALP 1991: 229-241 - 1990
- [j8]Edward Ochmanski:
Notes on a star mystery. Bull. EATCS 40: 252-256 (1990) - [j7]Edward Ochmanski, Wojciech Penczek:
Inevitability in diamond processes. RAIRO Theor. Informatics Appl. 24: 37-46 (1990) - [c3]Edward Ochmanski:
Semi-Commutation and Deterministic Petri Nets. MFCS 1990: 430-438 - [i1]Volker Diekert, Edward Ochmanski, Klaus Reinhardt:
On confluent semi-commutations: decidability and complexity results. Forschungsberichte, TU Munich TUM I 9041: 1-18 (1990)
1980 – 1989
- 1989
- [j6]Edward Ochmanski:
Semi-commutation for P-T Systems. Bull. EATCS 38: 191-198 (1989) - [j5]Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek:
Concurrent Systems and Inevitability. Theor. Comput. Sci. 64(3): 281-304 (1989) - 1988
- [c2]Edward Ochmanski:
On Morphisms of Trace Monoids. STACS 1988: 346-355 - 1987
- [j4]Edward Ochmanski:
A non-invertible PCF language. Bull. EATCS 33: 83-84 (1987) - [j3]Edward Ochmanski:
Inevitability in Concurrent Systems. Inf. Process. Lett. 25(4): 221-225 (1987) - [j2]Yves Métivier, Edward Ochmanski:
On Lexicographic Semi-Commutations. Inf. Process. Lett. 26(2): 55-59 (1987) - [c1]Edward Ochmanski:
Occurrence Traces: Processes of Elementary Net Systems. European Workshop on Applications and Theory of Petri Nets 1987: 331-342 - 1985
- [j1]Edward Ochmanski:
Regular behaviour of concurrent systems. Bull. EATCS 27: 56-67 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
