Peter Ladkin's Publications Before 1995

• Books
• Journal Articles and Book Chapters
• My Ph.D. Thesis

• Static Analysis of Communicating Processes
  [ Abstract | Postscript ]
  Peter Ladkin and Barbara Simons
  preliminary, incomplete version 22 April 1995
  This book includes chapters corresponding to material in
  • Compile-Time Analysis of Communicating Processes,
    by Peter Ladkin and Barbara Simons,
    in Proceedings of the 1992 International Conference on Supercomputing, pp248-259, ACM Press, 1992;
  • Static Deadlock Analysis for CSP-Type Communications,
    by Peter B. Ladkin and Barbara B. Simons,
    Chapter 5 of Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems, ed. Donald S. Fussell and Miroslaw Malek, Kluwer Academic Publishers, 1995.
  • Static Analysis of Multiway Sychronization,
    by Peter B. Ladkin and Barbara B. Simons,
    in Proceedings of CASCON'94, ed. J. Botsford, A. Gawman, M. Gentlemen, E. Kidd, K. Lyons and J. Slonim, pp142-156, IBM Toronto Lab and Natural Sciences and Engineering Research Council, Toronto, Canada, 1994.

Journal Articles and Book Chapters

Articles and Chapters with their origins in work published previously to 1995, as well as those publications previous to my appointment to the chair in Bielefeld in 1995, are included here.

• Implementing and Verifying Message Sequence Chart Specifications Using Promela/XSpin [ Abstract | Postscript ]
  Stefan Leue and Peter B. Ladkin
  in The SPIN Verification System, ed. J.-C. Grégoire, G. Holtzmann and D. Peled, DIMACS Series Vol. 32, American Mathematical Society, 1997, 65-89. This paper conjoins the work reported in
  • Implementing Message Sequence Charts in Promela,
    by Stefan Leue and Peter B. Ladkin,
    in Proceedings of the First SPIN Workshop, ed J.-C. Grégoire, Montréal, Canada, October 1995;
  • Implementing and Verifying Scenario-Based Specifications Using Promela/XSpin by Stefan Leue and Peter B. Ladkin,
    in Proceedings of the Second SPIN Workshop, Rutgers University, New Brunswick, New Jersey, August 1996;

• Simple Reasoning With Time-Dependent Propositions [ Abstract | Postscript | DVI ]
  Maroua Bouzid and Peter Ladkin
  To appear in the Journal of the IGPL, 1997.

• Fast Algebraic Methods for Interval Constraint Problems [ Abstract | Postscript | DVI ]
  Peter Ladkin and Alexander Reinefeld
  Invited Paper for Annals of Mathematics and Artificial Intelligence 19:383-411, 1997.
  This paper extends results reported in
  • A Symbolic Approach to Interval Constraint Problems,
    by Peter Ladkin and Alexander Reinefeld,
    in Artificial Intelligence and Symbolic Mathematical Computing, ed. Jacques Calmet and John A. Campbell, LNCS vol. 737, pp65-84, Springer Verlag, 1993;
  • Fast Solution of Large Interval Constraint Networks,
    by Alexander Reinefeld and Peter Ladkin,
    in Proceedings of AI'92, the 9th Canadian Conference on Artificial Intelligence, ed. Janice Glasgow and Roland Hedley, pp156-162, Morgan Kaufmann, San Mateo, California, 1992;
  • Effective solution of qualitative interval constraint problems,
    by Peter B. Ladkin and Alexander Reinefeld,
    Artificial Intelligence 57:105-124, September 1992;

• Analysis of a Technical Description of the Airbus A320 Braking System [ Abstract | Postscript ]
  Peter Ladkin
  High Integrity Systems 1(4):331-349, 1995

• Static Deadlock Analysis for CSP-Type Communications [ Abstract | Postscript | DVI ]
  Peter Ladkin and Barbara Simons
  in Responsive Computer Systems: Steps Toward Fault-Tolerant Real-Time Systems, ed. Donald S. Fussell and Miroslav Malek, Kluwer Academic Publishers, 1995

• A proper explanation when you need one [ Abstract | Postscript | DVI ]
  Harold Thimbleby and Peter Ladkin
  in People and Computers X, Proceedings of the BCS Conference on Human-Computer Interaction, HCI'95,,
  ed. M. A. R. Kirby, A. J. Dix and J. E. Finlay,
  Cambridge University Press, 1995.

• Interpreting Message Flow Graphs [ Abstract | Postscript ]
  Peter B. Ladkin and Stefan Leue
  Formal Aspects of Computing 7(5):473-509, 1995
  

• Four Issues Concerning the Semantics of Message Flow Graphs [ Abstract | Postscript ]
  Peter B. Ladkin and Stefan Leue
  Formal Description Techniques VII,ed. D. Hogrefe and S. Leue,IFIP Series, Chapman and Hall, 1995

• On Binary Constraint Problems [ Abstract | Postscript | DVI ]
  by Peter B. Ladkin and Roger D. Maddux,
  Journal of the ACM 41(3):435-469, May 1994.
  This paper is a substantial reworking of the technical report:
  • On Binary Constraint Networks, by Peter B. Ladkin and Roger Maddux,
    Technical Report KES.U.88.8, Kestrel Institute, 1988.
  but does not include the parts on the derivation of the pointisable relations (due independently to P. van Beek) or the construction of the IA from certain four-node path-consistent networks of the PA, later generalised by R. Hirsch in Relation Algebras of Intervals, preprint, Imperial College of Science and Technology, London, 1994;

• Comments on a Paper by Voas, Payne and Cohen, "A model for detecting the existence of software corruption in real time" [ Postscript | DVI ]
  by Peter Ladkin and Harold Thimbleby,
  Computers and Security 13(6):527-531, October 1994;

• Comments on a Proposed Semantics for Message Sequence Charts
  [ Abstract | Postscript | DVI ]
  Peter Ladkin and Stefan Leue
  Technical Correspondence, The Computer Journal 37(9):814-815, 1995.