University of Leicester

informatics

Publications of Irek Ulidowski

  1. Daniel Morrison and Irek Ulidowski, Direction-reversible self-timed cellular automata for Delay-Insensitive circuits. Journal of Cellular Automata 12(1-2):101-120. 2016.
  2. Stefan Kuhn and Irek Ulidowski, A calculus for local reversibility. Proceedings, Reversible Computation 2016, LNCS 9720, pp. 20-35. Springer 2016. doi:10.1017/10.1007/978-3-319-40578-0_2
  3. Iain Phillips and Irek Ulidowski, Reversibility and asymmetric conflict in event structures. Journal of Logical and Algebraic Methods in Programming. 2015. doi:10.1016/j.jlamp.2015.07.004
  4. Stefan Kuhn and Irek Ulidowski, Towards Modelling of Local Reversibility. Proceedings, Reversible Computation 2015, LNCS 9138, pp. 279-284. Springer 2015.
  5. Daniel Morrison and Irek Ulidowski, Direction-reversible self-timed cellular automata for Delay-Insensitive circuits. Proceedings, ACRI 2014, LNCS, pp. 367-377. Springer 2014.
  6. Irek Ulidowski, Iain Phillips and Shoji Yuen, Concurrency and reversibility. Proceedings, Reversible Computation 2014, LNCS 8507, pp. 1-14. Springer 2014.
  7. Daniel Morrison and Irek Ulidowski, Arbitration and reversibility of parallel Delay-Insensitive modules. Proceedings, Reversible Computation 2014, LNCS 8507, pp. 67-81. Springer 2014.
  8. Iain Phillips and Irek Ulidowski, An Event Identifier Logic. Mathematical Structures in Computer Science. 2014. doi:10.1017/S0960129513000510
  9. Iain Phillips and Irek Ulidowski, Reversibility and asymmetric conflict in event structures. Proceedings of CONCUR 2013, LNCS, volume 8052, pp. 303-318. Springer, 2013. doi:10.1007/978-3-642-40184-8_22
  10. Iain Phillips, Irek Ulidowski and Shoji Yuen, Modelling of bonding with processes and events. Proceedings, Reversible Computation 2013, LNCS, volume 7948, pp. 141-154. Springer, 2013.
  11. Daniel Morrison and Irek Ulidowski, Reversible delay-insensitive ditsributed memory modules. Proceedings, Reversible Computation 2013, LNCS, volume 7948, pp. 11-24. Springer, 2013.
  12. Iain Phillips , Irek Ulidowski and Shoji Yuen, A reversible process calculus and the modelling of the ERK signalling pathway. Proceedings, Reversible Computation 2012, LNCS, volume 7581, pp. 218-232. Springer, 2013.
  13. Maciej Koutny and Irek Ulidowski. Proceedings of the 23rd International Conference on Concurrency Theory CONCUR 2012. LNCS, volume 7454. Springer, 2012.
  14. Iain Phillips and Irek Ulidowski, A Hierarchy of Reverse Bisimulations on Stable Configuration Structures. Mathematical Structures in Computer Science, 22, pp 333-372, 2012. doi: 10.1017/S0960129511000429.
  15. Rolf Drechsler, Irek Ulidowski and Robert Wille, Special Issue on Reversible Computation. Multiple-Valued Logic and Soft Computing (MVL) 18(1), 2012.
  16. Iain Phillips and Irek Ulidowski, A Logic with Reverse Modalities for Hierarchy-preserving Bisimulations. Proceedings, 18th International Workshop on Expressiveness of Concurrency, EXPRESS'11, Aachen, Germany, September 2011. EPTCS, volume 64, 2011, pp. 104-118. doi:10.4204/EPTCS.64.8.
  17. Irek Ulidowski, Proceedings of the 1st Workshop on Reversible Computation (RC 2009). ENTCS 253(6), 2010.
  18. Nicola Cannata, Emanuela Merelli, Irek Ulidowski, Preface: Hybrid automata and oscillatory behaviour in biological systems. Theoretical Computer Science, 411(20): 1997-1998, 2010.
  19. I. Phillips and I. Ulidowski, Reverse Bisimulations on Stable Configuration Structures. Proceedings of the 6th Workshop on Structural Operational Semantics (SOS 2009). EPTCS, volume 18, 2010, pp. 62-76. doi:10.4204/EPTCS.18.5.
  20. Irek Ulidowski and Shoji Yuen, Generating priority rewrite systems for OSOS process languages. Information and Computation 207(2), pp 120-145, 2009. doi: 10.1016/j.ic.2008.10.002.
  21. Mohammad Reza Mousavi, Iain Phillips, Michel A. Reniers, Irek Ulidowski, Semantics and expressiveness of Ordered SOS. Information and Computation, 207(2), pp 85-119, 2009. doi: 10.1016/j.ic.2007.11.008.
  22. Nicola Cannata, Emanuela Merelli and Irek Ulidowski, Proceedings of the 2nd Workshop From Biology to Concurrency and back (FBTC 2008). ENTCS, volume 229(1), 2009.
  23. Iain Phillips and Irek Ulidowski, True Concurrency Semantics via Reversibility. 2008.
  24. I. Phillips and I. Ulidowski, Reversibility and Models for Concurrency. Proceedings of the 4th Workshop on Structural Operational Semantics (SOS 2007). ENTCS 192, pp 93-108, 2007. [bibtex].
  25. P.D. Mosses, and I. Ulidowski: Preface. Theoretical Computer Science, 373(3): pp 161-162, 2007.
  26. I. Phillips and I. Ulidowski, Reversing Algebraic Process Calculi. The Journal of Logic and Algebraic Programming, 73, pp 70-96, 2007. [bibtex].
  27. M. Mousavi , I. Phillips, M.A. Reniers and I. Ulidowski, The Meaning of Ordered SOS. In S. Arun-Kumar and Naveen Garg, editors, Proceedings of the 26th International Conference on Foundations of Software Technology and Theoretical Computer Science FSTTCS 2006, Kolkata, India, December 2006. Springer, LNCS 4337. [bibtex].
  28. I. Phillips and I. Ulidowski, Reversing Algebraic Process Calculi. In L. Aceto and A. Ingolfsdottir, editors, Proceedings of the 9th International Conference on Foundations of Software Science and Computation Structures FOSSACS 2006, Vienna, Austria, 2006. Springer, LNCS 3921. [bibtex] Technical Report CS-06-01, Department of Computer Science, University of Leicester, 2006.
  29. I. Phillips and I. Ulidowski, Operational Semantics of Reversibility in Process Algebra. In L. Aceto and A.D. Gordon, editors, Proceedings of the Workshop "Essays on Algebraic Process Calculi" (APC 25), Bertinoro, Italy, 1-5 August 2005. ENTCS, Volume 162, September 2006.
  30. P.D. Mosses and I. Ulidowski, Proceedings of the 2nd Workshop on Structural Operational Semantics (SOS 2005). ENTCS, Volume 156, Issue 1, Pages 1-190, May 2006.
  31. I. Ulidowski, Proceedings of ARTS 2004, the 6th AMAST Workshop on Real-Time Systems (ARTS 2004). ENTCS, Volume 139, Issue 1, Pages 1-168, 2005.
  32. L. Aceto, W. Fokkink and I. Ulidowski, Proceedings of the Workshop on Structural Operational Semantics (SOS 2004). ENTCS, Volume 128, Issue 1, Pages 1-122, 2005.
  33. I. Ulidowski and S. Yuen, Process Languages with Discrete Relative Time based on the Ordered SOS Format and Rooted Eager Bisimulation. The Journal of Logic and Algebraic Programming, 60-61, pp 401-460, 2004. [bibtex]
  34. I. Ulidowski, Priority Rewrite Systems for OSOS Process Languages. In R. Amadio and D. Lugiez, editors, Proceedings of the 14th International Conference on Concurrency Theory CONCUR 2003, Marseille, France, 2003. Springer, LNCS 2761. [bibtex]
  35. I. Ulidowski and I. Phillips, Ordered SOS Rules and Process Languages for Branching and Eager Bisimulations. Information and Computation, 178(1), pp 180-213, 2002. [bibtex]
  36. I. Ulidowski, Refusal Simulation and Interactive Games. In H. Kirchner and C. Ringeissen, editors, Proceedings of the 9th International Conference on Algebraic Methodology and Software Technology AMAST 2002, Saint-Gilles-les-Bains, Reunion Island, France, 2002. Springer, LNCS 2422. [bibtex]
  37. I. Ulidowski, Priority Rewrite Systems for OSOS Process Languages. Technical Report 2002/30, Department of Mathematics and Computer Science, University of Leicester, 2002.
  38. I. Ulidowski, Termination and Confluence of Term Rewrite Systems for GSOS Process Languages. Technical Report 2002/21, Department of Mathematics and Computer Science, University of Leicester, 2002.
  39. I. Ulidowski and S. Yuen, Process Languages for Rooted Weak Preorders. Technical Report 2002/11, Department of Mathematics and Computer Science, University of Leicester, 2002.
  40. I. Ulidowski and S. Yuen, Timed Properties for Process Languages with Time. Proceedings of RIEC International Symposium Rewriting in Proof and Computation, Sendai, Japan, 2001.
  41. I. Ulidowski and S. Yuen, General Process Languages with Time. Technical Report 2000/41, Department of Mathematics and Computer Science, University of Leicester, 2000.
  42. I. Ulidowski and S. Yuen, Process Languages for Rooted Eager Bisimulation. In C. Palamidessi, editor, Proceedings of the 11th International Conference on Concurrency Theory CONCUR 2000, University Park, Pennsylvania, 2000. Springer, LNCS 1877. [bibtex]
  43. I. Ulidowski, Finite Axiom Systems for Testing Preorder and De Simone Process Languages. Theoretical Computer Science, 239(1), pp 97-139, 2000. [bibtex]
  44. I. Ulidowski and I. Phillips, Ordered SOS Rules and Process Languages for Branching and Eager Bisimulations. Technical Report 1999/15, Department of Mathematics and Computer Science, University of Leicester, 1999.
  45. I. Ulidowski, Finite Axiom Systems for Testing Preorder and De Simone Process Languages. Technical Report 1999/8, Department of Mathematics and Computer Science, University of Leicester, 1999.
  46. K. Subieta, J. Leszczylowski and I. Ulidowski, Processing Semi-Structured Data in Object Bases. ICS PAS Report 852, Institute of Computer Science, Polish Academy of Sciences, 1998.
  47. I. Ulidowski and S. Yuen, Extending Process Languages with Time. In M. Johnson, editor, Proceedings of the 6th International Conference on Algebraic Methodology and Software Technology AMAST'97, Sydney, Australia, 1997. Springer, LNCS 1349. [bibtex]
  48. I. Ulidowski and I. Phillips, Formats of Ordered SOS Rules with Silent Actions. In M. Bidoit and M. Dauchet, editors, Proceedings of the 7th International Conference on Theory and Practice of Software Development TAPSOFT'97, Lille, France, 1997. Springer, LNCS 1214. [bibtex]
  49. I. Ulidowski, Concurrency Theory and Applications '96. Proceedings of the 4th International RIMS Workshop, Kyoto University, 1997.
  50. I. Phillips and I. Ulidowski, Ordered SOS Rules and Weak Bisimulation. In A. Adalat, S. Jourdan and G. McCusker, editors, Advances in Theory and Formal Methods of Computing , Imperial College Press, 1996.
  51. I. Ulidowski, Finite Axiom Systems for Testing Preorder and De Simone Process Languages. An extended version of an abstract that appeared in the Proceedings of the 5th International Conference on Algebraic Methodology and Software Technology AMAST'96, Munchen, Germany, 1996. Springer, LNCS 1101. [bibtex]
  52. I. Ulidowski, Axiom Systems for De Simone Process Languages. RIMS Technical Report 1099, Kyoto University, 1996.
  53. I. Ulidowski, Axiomatisations of Weak Equivalences for De Simone Languages. Extended abstract, in Proceedings of the 6th Conference on Concurrency Theory CONCUR'95, Philadelphia, 1995. Springer, LNCS 962. [bibtex]
  54. I. Ulidowski, A Complete Proof System for an ISOS Process Language. In the Proceedings of Applied Mathematics Workshop, Ryukoku University, Otsu, Japan, 1994.
  55. I. Ulidowski, Local Testing and Implementable Concurrent Processes. PhD Thesis, Imperial College, University of London, 1994. [bibtex]
  56. I. Ulidowski, Congruences for tau-respecting formats of rules. In G. Burn, S. Gay and M.D. Ryan, editors, Theory and Formal Methods 1993, Springer-Verlag, 1993.
  57. I. Ulidowski, Equivalences on Observable Processes. In Proceedings of the 7th Annual IEEE Symposium on Logic in Computer Science LICS'92, Santa Cruz, California, 1992. IEEE Computer Society Press. [bibtex]
  58. I. Ulidowski, Copy+refusal Testing. 7th British Colloquium for Theoretical Computer Science BCTCS 7, University of Liverpool, 1991.


Irek Ulidowski

University of Leicester. Last modified: 25th October 2016, 17:47:37.
Informatics Web Maintainer. Any opinions expressed on this page are those of the author.