The use of static constructs in a model process logic

  • Hans Hüttel
  • Kim G. Larsen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 363)


Data Link Operational Semantic Modal Transition Parallel Composition Operational Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Hennessy, M. and R. Milner: Algebraic Laws for Nondeterminism and Concurrency, J.Assoc.Comput.Mach. 32, pp. 137–161, 1985.Google Scholar
  2. [2]
    Holmström, S.: Reasoning about CCS agents using Hennessy-Milner logic extended with fixed points, Workshop on Parallel Systems, Stirling, 1988.Google Scholar
  3. [3]
    Hüttel, Hans: Operational and Denotational Properties of a Modal Process Logic, Master's Thesis, Department of Mathematics and Computer Science, Aalborg University Centre, 1988.Google Scholar
  4. [4]
    Larsen, Kim G.: A Context-Dependent Bisimulation Between Processes, Ph.D. Thesis, University of Edinburgh, 1986.Google Scholar
  5. [5]
    Larsen, Kim G.: Proof Systems for Hennessy-Milner Logic with Recursion, in: CAAP 88, LNCS 299, Springer-Verlag New York Berlin 1988. (Extended version to appear in Theoretical Computer Science, North-Holland).Google Scholar
  6. [6]
    Larsen, Kim and Robin Milner: Verifying a Protocol Using Relativized Bisimulation, in Proceedings of ICALP'87, LNCS 267, Springer-Verlag New York Berlin 1987.Google Scholar
  7. [7]
    Larsen, Kim and Bent Thomsen: Compositional Proofs by Partial Specification of Processes, in Proceedings of Mathematical Foundations of Computer Science 1988, LNCS 324, Springer-Verlag New York Berlin 1988.Google Scholar
  8. [8]
    Larsen, Kim. G and Bent Thomsen: A Modal Process Logic, in Proceedings of Third Annual symposium on Logic in Computer Science, Edinburgh, 1988.Google Scholar
  9. [9]
    Milner, Robin: A Calculus of Communicating Systems, LNCS 92, Springer-Verlag New York Berlin 1980.Google Scholar
  10. [10]
    Milner, Robin: Calculi for Synchrony and Asynchrony, Theoretical Computer Science 25, pp. 267–310, North-Holland 1983.Google Scholar
  11. [11]
    D. Park: Concurrency and automata on infinite sequences, in Proceedings og 5th GI Conference, LNCS 104, Springer-Verlag New York Berlin 1981.Google Scholar
  12. [12]
    Parrow, Joachim: Fairness Properties in Process Algebra, Ph.D. Thesis, Dept. of Computer Systems, Uppsala University, Uppsala 1985.Google Scholar
  13. [13]
    Plotkin, Gordon: A Structural Approach to Operational Semantics, Tech. Rep., DAIMI FN-19, Computer Science Department, Aarhus University 1981.Google Scholar
  14. [14]
    Prasad, K.V.S.: Combinators and Bisimulation Proofs for Restartable Systems, Ph.D. Thesis, Dept. of Computer Science, University of Edinburgh 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Hans Hüttel
    • 1
  • Kim G. Larsen
    • 2
  1. 1.Laboratory for the Foundations of Computer Science, JCMBUniversity of EdinburghEdinburghScotland
  2. 2.Department of Mathematics and Computer ScienceAalborg University CentreAalborgDenmark

Personalised recommendations