Skip to main content
SpringerLink
Log in

A practical technique for process abstraction

  • Conference paper
  • First Online:
CONCUR'93 (CONCUR 1993)

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

Included in the following conference series:

Abstract

With algebraic laws a process can be simplified before verifying its equivalence with another process. Also needed are laws to allow a process to be simplified before verifying that it satisfies a temporal logic formula. Most previous work on this problem is based on property-preserving mappings between transition systems. The results presented here allow direct simplification of process terms for some important classes of temporal properties.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Property preserving simulations. In Proceedings of the Fourth Workshop on Computer Aided Verification, 1992.

    Google Scholar 

  2. Gerard Boudol and Ilaria Castellani. Permutations of transitions: an event structure semantics for CCS and SCCS. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models. Springer Verlag, 1989. Lecture Notes in Computer Science, volume 354.

    Google Scholar 

  3. Glenn Bruns. A case study in safety-critical design. In Proceedings of CAV '92, 1992.

    Google Scholar 

  4. C.A.R. Hoare. Communicating Sequential Processes. Prentice Hall International, 1985.

    Google Scholar 

  5. D. Kozen. Results on the propositional mu-calculus. Theoretical Computer Science, 27:333–354, 1983

    Article  Google Scholar 

  6. Y. S. Kwong. On reduction of asynchronous systems. Theoretical Computer Science, 5:25–50, 1977.

    Article  Google Scholar 

  7. Kim G. Larsen and Bent Thomsen. A modal process logic. In Proceedings of the Third Annual Symposium on Logic in Computer Science, 1988.

    Google Scholar 

  8. Kim G. Larsen and Liu Xinxin. Compositionality through an operational semantics of contexts. In Proceedings of ICALP '90, 1990.

    Google Scholar 

  9. Robin Milner. Communication and Concurrency. Prentice Hall International, 1989.

    Google Scholar 

  10. Davide Sangiorgi and Robin Milner. The problem of “weak bisimulation up to”. In Proceedings of CONCUR '92, 1992.

    Google Scholar 

  11. Joseph Sifakis. Property preserving homomorphisms of transition systems. In Logics of Programs. Springer Verlag, 1983. Lecture Notes in Computer Science, volume 164.

    Google Scholar 

  12. Colin Stirling. An introduction to modal and temporal logics for CCS. In A. Yonezawa and T. Ito, editors, Concurrency: Theory, Language, and Architecture. Springer Verlag, 1989. Lecture Notes in Computer Science, volume 391.

    Google Scholar 

  13. Colin Stirling. Temporal logics for CCS. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Linear Time, Branching Time and Partial Order in Logics and Models. Springer Verlag, 1989. Lecture Notes in Computer Science, volume 354.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Edinburgh, EH9 3JZ, Edinburgh, UK

    Glenn Bruns

Authors
  1. Glenn Bruns
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Eike Best

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruns, G. (1993). A practical technique for process abstraction. In: Best, E. (eds) CONCUR'93. CONCUR 1993. Lecture Notes in Computer Science, vol 715. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57208-2_4

Download citation

  • DOI: https://doi.org/10.1007/3-540-57208-2_4

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57208-4

  • Online ISBN: 978-3-540-47968-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation