Irek Ulidowski
Irek Ulidowski
Verifierad e-postadress på le.ac.uk - Startsida
TitelCiteras avÅr
Reversing algebraic process calculi
I Phillips, I Ulidowski
The Journal of Logic and Algebraic Programming 73 (1-2), 70-96, 2007
1202007
Ordered SOS process languages for branching and eager bisimulations
I Ulidowski, I Phillips
Information and Computation 178 (1), 180-213, 2002
60*2002
Equivalences on observable processes
I Ulidowski
LICS 92, 148-159, 1992
591992
Process languages with discrete relative time based on the ordered SOS format and rooted eager bisimulation
I Ulidowski, S Yuen
Journal of Logic and Algebraic Programming 60, 401-460, 2004
49*2004
A reversible process calculus and the modelling of the ERK signalling pathway
I Phillips, I Ulidowski, S Yuen
International Workshop on Reversible Computation, 218-232, 2012
482012
Event Identifier Logic
I Phillips, I Ulidowski
Mathematical Structures in Computer Science 24 (2), 2014
40*2014
Reversibility and models for concurrency
I Phillips, I Ulidowski
Electronic Notes in Theoretical Computer Science 192 (1), 93-108, 2007
402007
A hierarchy of reverse bisimulations on stable configuration structures
I Phillips, I Ulidowski
Mathematical Structures in Computer Science 22 (02), 333-372, 2012
34*2012
Reversibility and asymmetric conflict in event structures
I Phillips, I Ulidowski
Journal of Logical and Algebraic Methods in Programming 84 (6), 781-805, 2015
332015
Finite axiom systems for testing preorder and De Simone process languages
I Ulidowski
Theoretical Computer Science 239 (1), 97-139, 2000
33*2000
Reversing event structures
I Ulidowski, I Phillips, S Yuen
New Generation Computing 36 (3), 281-306, 2018
32*2018
Preface
N Cannata, E Merelli, I Ulidowski
Theoretical Computer Science 411 (20), 1997-1998, 2010
23*2010
Local reversibility in a calculus of covalent bonding
S Kuhn, I Ulidowski
Science of Computer Programming 151, 18-47, 2018
21*2018
Local testing and implementable concurrent processes
I Ulidowski
Department of Computing, Imperial College, 1994
201994
Process languages for rooted eager bisimulation
I Ulidowski, S Yuen
CONCUR 2000—Concurrency Theory, 275-289, 2000
182000
Semantics and expressiveness of ordered SOS
MR Mousavi, I Phillips, MA Reniers, I Ulidowski
Information and Computation 207 (2), 85-119, 2009
17*2009
Axiomatisations of weak equivalences for De Simone languages
I Ulidowski
CONCUR'95: Concurrency Theory, 219-233, 1995
141995
Processing semi-structured data in object bases
K Subieta, J Leszczyłowski, I Ulidowski
Polish Academy of Sciences [PAS]. Institute of Computer Science, 1998
101998
Generating priority rewrite systems for OSOS process languages
I Ulidowski, S Yuen
Information and Computation 207 (2), 120-145, 2009
9*2009
Reversing parallel programs with blocks and procedures
J Hoey, I Ulidowski, S Yuen
arXiv preprint arXiv:1808.08651, 2018
82018
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20