Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Irek Ulidowski
2010 – today
- 2012
[j17]Iain Phillips, Irek Ulidowski: A hierarchy of reverse bisimulations on stable configuration structures. Mathematical Structures in Computer Science 22(2): 333-372 (2012)- [j16]Rolf Drechsler, Irek Ulidowski, Robert Wille: Foreword: Special Issue on Reversible Computation. Multiple-Valued Logic and Soft Computing 18(1): 1-3 (2012)
- [c14]Iain Phillips, Irek Ulidowski, Shoji Yuen: A Reversible Process Calculus and the Modelling of the ERK Signalling Pathway. RC 2012: 218-232
- [e1]Maciej Koutny, Irek Ulidowski (Eds.): CONCUR 2012 - Concurrency Theory - 23rd International Conference, CONCUR 2012, Newcastle upon Tyne, UK, September 4-7, 2012. Proceedings. Lecture Notes in Computer Science 7454, Springer 2012, ISBN 978-3-642-32939-5
- 2011
- [c13]Iain Phillips, Irek Ulidowski: A Logic with Reverse Modalities for History-preserving Bisimulations. EXPRESS 2011: 104-118
- 2010
- [j15]
- [j14]Nicola Cannata, Emanuela Merelli, Irek Ulidowski: Preface: Hybrid automata and oscillatory behaviour in biological systems. Theor. Comput. Sci. 411(20): 1997-1998 (2010)
2000 – 2009
- 2009
- [j13]Nicola Cannata, Emanuela Merelli, Irek Ulidowski: Preface. Electr. Notes Theor. Comput. Sci. 229(1): 1-2 (2009)
- [j12]Mohammad Reza Mousavi, Iain Phillips, Michel A. Reniers, Irek Ulidowski: Semantics and expressiveness of ordered SOS. Inf. Comput. 207(2): 85-119 (2009)
- [j11]Irek Ulidowski, Shoji Yuen: Generating priority rewrite systems for OSOS process languages. Inf. Comput. 207(2): 120-145 (2009)
- [c12]Iain C. C. Phillips, Irek Ulidowski: Reverse Bisimulations on Stable Configuration Structures. SOS 2009: 62-76
- 2007
- [j10]Iain Phillips, Irek Ulidowski: Reversibility and Models for Concurrency. Electr. Notes Theor. Comput. Sci. 192(1): 93-108 (2007)
- [j9]Iain C. C. Phillips, Irek Ulidowski: Reversing algebraic process calculi. J. Log. Algebr. Program. 73(1-2): 70-96 (2007)
- [j8]
- 2006
- [j7]
- [j6]Iain C. C. Phillips, Irek Ulidowski: Operational Semantics of Reversibility in Process Algebra. Electr. Notes Theor. Comput. Sci. 162: 281-286 (2006)
- [c11]
- [c10]Mohammad Reza Mousavi, Iain C. C. Phillips, Michel A. Reniers, Irek Ulidowski: The Meaning of Ordered SOS. FSTTCS 2006: 333-344
- 2005
- [j5]Luca Aceto, Wan Fokkink, Irek Ulidowski: Preface. Electr. Notes Theor. Comput. Sci. 128(1): 1- (2005)
- [j4]
- 2004
- [j3]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
- [c9]
- 2002
- [j2]Irek Ulidowski, Iain C. C. Phillips: Ordered SOS Process Languages for Branching and Eager Bisimulations. Inf. Comput. 178(1): 180-213 (2002)
- [c8]
- 2000
- [j1]Irek Ulidowski: Finite axiom systems for testing preorder and De Simone process languages. Theor. Comput. Sci. 239(1): 97-139 (2000)
- [c7]
1990 – 1999
- 1997
- [c6]
- [c5]Irek Ulidowski, Iain C. C. Phillips: Formats of Ordered SOS Rules with Silent Actions. TAPSOFT 1997: 297-308
- 1996
- [c4]Irek Ulidowski: Finite Axiom Systems for Testing Preorder and De Simone Process Languages. AMAST 1996: 210-224
- 1995
- [c3]
- 1993
- [c2]Irek Ulidowski: Congrurences for tau-Respecting Formats of Rules. Theory and Formal Methods 1993: 314-325
- 1992
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-05 22:17 CEST by the dblp team