The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Irek Ulidowski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Irek Ulidowski
    Refusal Simulation and Interactive Games. [Citation Graph (0, 0)][DBLP]
    AMAST, 2002, pp:208-222 [Conf]
  2. Irek Ulidowski
    Finite Axiom Systems for Testing Preorder and De Simone Process Languages. [Citation Graph (0, 0)][DBLP]
    AMAST, 1996, pp:210-224 [Conf]
  3. Irek Ulidowski, Shoji Yuen
    Extending Process Languages with Time. [Citation Graph (0, 0)][DBLP]
    AMAST, 1997, pp:524-538 [Conf]
  4. Irek Ulidowski
    Priority Rewrite Systems for OSOS Process Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:87-101 [Conf]
  5. Irek Ulidowski
    Axiomatisations of Weak Equivalences for De Simone Languages. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:219-233 [Conf]
  6. Irek Ulidowski, Shoji Yuen
    Process Languages for Rooted Eager Bisimulation. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2000, pp:275-289 [Conf]
  7. Iain Phillips, Irek Ulidowski
    Reversing Algebraic Process Calculi. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:246-260 [Conf]
  8. Mohammad Reza Mousavi, Iain Phillips, Michel A. Reniers, Irek Ulidowski
    The Meaning of Ordered SOS. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:333-344 [Conf]
  9. Irek Ulidowski
    Congrurences for tau-Respecting Formats of Rules. [Citation Graph (0, 0)][DBLP]
    Theory and Formal Methods, 1993, pp:314-325 [Conf]
  10. Irek Ulidowski
    Equivalences on Observable Processes [Citation Graph (0, 0)][DBLP]
    LICS, 1992, pp:148-159 [Conf]
  11. Irek Ulidowski, Iain Phillips
    Formats of Ordered SOS Rules with Silent Actions. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1997, pp:297-308 [Conf]
  12. Luca Aceto, Wan Fokkink, Irek Ulidowski
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:128, n:1, pp:1-0 [Journal]
  13. Peter D. Mosses, Irek Ulidowski
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:156, n:1, pp:1-2 [Journal]
  14. Irek Ulidowski
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:139, n:1, pp:1-2 [Journal]
  15. Iain Phillips, Irek Ulidowski
    Operational Semantics of Reversibility in Process Algebra. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:162, n:, pp:281-286 [Journal]
  16. Irek Ulidowski, Iain Phillips
    Ordered SOS Process Languages for Branching and Eager Bisimulations. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:178, n:1, pp:180-213 [Journal]
  17. Irek Ulidowski, Shoji Yuen
    Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulation. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2004, v:60, n:, pp:401-460 [Journal]
  18. Irek Ulidowski
    Finite axiom systems for testing preorder and De Simone process languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:239, n:1, pp:97-139 [Journal]
  19. Peter D. Mosses, Irek Ulidowski
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:373, n:3, pp:161-162 [Journal]
  20. Iain Phillips, Irek Ulidowski
    Reversing algebraic process calculi. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:73, n:1-2, pp:70-96 [Journal]

  21. Reverse Bisimulations on Stable Configuration Structures [Citation Graph (, )][DBLP]


  22. Reversibility and Models for Concurrency. [Citation Graph (, )][DBLP]


  23. Preface. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002