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