Search the dblp DataBase

Publications of Author

1. Edward Ochmanski
   Covering Fairness against Conspiracies. [Citation Graph (0, 0)][DBLP]
   ICATPN, 2004, pp:312-330 [Conf]
   
2. Edward Ochmanski
   Occurrence Traces: Processes of Elementary Net Systems. [Citation Graph (0, 0)][DBLP]
   European Workshop on Applications and Theory of Petri Nets, 1987, pp:331-342 [Conf]
   
3. Volker Diekert, Edward Ochmanski, Klaus Reinhardt
   On Confluent Semi-Commutations - Decidability and Complexity Results. [Citation Graph (0, 0)][DBLP]
   ICALP, 1991, pp:229-241 [Conf]
   
4. Edward Ochmanski, Pierre-André Wacrenier
   On Regular Compatibility of Semi-Commutations. [Citation Graph (0, 0)][DBLP]
   ICALP, 1993, pp:445-456 [Conf]
   
5. Edward Ochmanski
   Semi-Commutation and Deterministic Petri Nets. [Citation Graph (0, 0)][DBLP]
   MFCS, 1990, pp:430-438 [Conf]
   
6. Edward Ochmanski
   Modelling Concurrency with Semi-Commutations. [Citation Graph (0, 0)][DBLP]
   MFCS, 1992, pp:412-420 [Conf]
   
7. Edward Ochmanski
   On Morphisms of Trace Monoids. [Citation Graph (0, 0)][DBLP]
   STACS, 1988, pp:346-355 [Conf]
   
8. Edward Ochmanski
   Regular behaviour of concurrent systems. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1985, v:27, n:, pp:56-67 [Journal]
   
9. Edward Ochmanski
   A non-invertible PCF language. [Citation Graph (0, 0)][DBLP]
   Bulletin of the EATCS, 1987, v:33, n:, pp:83-84 [Journal]
   
10. Edward Ochmanski
    Semi-commutation for P-T Systems. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1989, v:38, n:, pp:191-198 [Journal]
    
11. Edward Ochmanski
    Notes on a star mystery. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1990, v:40, n:, pp:252-256 [Journal]
    
12. Barbara Klunder, Edward Ochmanski, Krystyna Stawikowska
    On Star-Connected Flat Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:67, n:1-3, pp:93-105 [Journal]
    
13. Edward Ochmanski
    Best Fairness Hierarchy in Elementary Nets. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:60, n:1-4, pp:237-250 [Journal]
    
14. Edward Ochmanski, Krystyna Stawikowska
    Star-free Star and Trace Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:72, n:1-3, pp:323-331 [Journal]
    
15. Edward Ochmanski, Joanna Pieckowska
    Trace Nets and Conflict-free Computations. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:72, n:1-3, pp:311-321 [Journal]
    
16. Volker Diekert, Edward Ochmanski, Klaus Reinhardt
    On Confluent Semi-commutations: Decidability and Complexity Results [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:110, n:1, pp:164-182 [Journal]
    
17. Paul Gastin, Edward Ochmanski, Antoine Petit, Brigitte Rozoy
    Decidability of the Star Problem in A* x {b}*. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:2, pp:65-71 [Journal]
    
18. Yves Métivier, Edward Ochmanski
    On Lexicographic Semi-Commutations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:2, pp:55-59 [Journal]
    
19. Edward Ochmanski
    Inevitability in Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:25, n:4, pp:221-225 [Journal]
    
20. Edward Ochmanski, Wojciech Penczek
    Inevitability in diamond processes. [Citation Graph (0, 0)][DBLP]
    ITA, 1990, v:24, n:, pp:37-46 [Journal]
    
21. Antoni W. Mazurkiewicz, Edward Ochmanski, Wojciech Penczek
    Concurrent Systems and Inevitability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:64, n:3, pp:281-304 [Journal]
    
22. Edward Ochmanski, Krystyna Stawikowska
    A Star Operation for Star-Free Trace Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:337-345 [Conf]