Skip to main content

Some results about logical descriptions of non deterministic behaviours

  • Conference paper
  • First Online:
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 761))

  • 110 Accesses

Abstract

Process logics, also called temporal logics, generally rely on an extension of modal logic often called Hennessy and Milner Logic (HML). In this paper, we show how HML modalities induce some semantic overloading of usual logic connectives. We build then a logic of processes that expresses better (deterministic) action choices and (non deterministic) execution choices. We prove that our logic is equivalent, in term of expressivity, to a strict extension of HML, though, in some sense, it still have the same discriminating power, i.e. under usual finiteness assumption, the logical indistinguishability coincides with a natural extension of the bisimulation equivalence.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Arnold. Mec: a system for constructing and analysing transition systems. In J. Sifakis, editor, Automatic Verification of Finite State Systems, pages 117–132. Springer-Verlag, 1989. LNCS 407.

    Google Scholar 

  2. A. Arnold. Verification and comparison of transition systems. In M.-C. Gaudel and J. P. Jouannaud, editors, Theory And Practice Of Software Development. Springer-Verlag, 1993. LNCS 668.

    Google Scholar 

  3. E. Emerson. Temporal and modal logic. In J. Van Leeuwen, editor, Handbook of Theoretical Computer Science (vol. B), pages 995–1072. Elsevier, 1990.

    Google Scholar 

  4. J-Y. Girard. Linear logic. Theoretical Computer Science, 50:1–110, 1987.

    Google Scholar 

  5. M. Hennessy and R. Milner. Observing nondeterminism and concurrency. In J. de Backer and M. van Leeuwen, editors, 7th Int. Coll. on Automata, Languages and Programming. Springer-Verlag, 1980. LNCS 85.

    Google Scholar 

  6. M. Hennessy and R.Milner. Algebraic laws for nondeterminism and concurrency. J. Assoc. Comput. Mach., 32:137–161, 1985.

    Google Scholar 

  7. W. Hodges. Model theory. Encyclopedia of mathematics and its application. Cambridg University Press, 1993.

    Google Scholar 

  8. D. Park. Concurrency and automata on infinite sequences. In 5th GI Conf. on Theoret. Comput. Sct., pages 167–183, Karlsruhe, 1981. LNCS 104.

    Google Scholar 

  9. V. Pratt. A decidable μ-calculus. In Proc. 22nd Symp. on Foundations of Comput. Sci., pages 421–427, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rudrapatna K. Shyamasundar

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Janin, D. (1993). Some results about logical descriptions of non deterministic behaviours. In: Shyamasundar, R.K. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1993. Lecture Notes in Computer Science, vol 761. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57529-4_67

Download citation

  • DOI: https://doi.org/10.1007/3-540-57529-4_67

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57529-0

  • Online ISBN: 978-3-540-48211-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics