Skip to main content
SpringerLink
Log in
Book cover

Recent Trends in Algebraic Development Techniques pp 310–325Cite as

Modular Specification of Concurrent Systems with Observational Logic

  • Conference paper
  • First Online:

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

Abstract

We present a dynamic form of observational logic for specifying concurrent systems on the basis of their observable behaviour, in particular without needing a language for describing states, which are regarded as non-observable. The logic is based on quantales. The models are labelled transition systems, and a weakly complete proof system is presented. We study the logic from the point of view of modularity; vertical modularity is based on a notion of implementation of systems and renement of specifications, and horizontal modularity is based on parallel composition of systems and specifications. Several compositionality results are presented. As an example we see a specification of a stack and its implementation over an array and a pointer.

★

This work was partially supported by FCT, the PRAXIS XXI Projects 2/2.1/MAT/ 262/94 SitCalc, PCEX/P/MAT/46/96 ACL and 2/2.1/TIT/1658/95 LogComp, and the ESPRIT IV Working Groups 22704 ASPIRE and 23531 FIREworks.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky, Domain theory in logical form, Ann. Pure Appl. Logic 51 (1991) 1–77.

    Article  MathSciNet  Google Scholar 

  2. S. Abramsky and S. Vickers, Quantales, observational logic and process semantics, Math. Structures Comput. Sci. 3 (1993) 161–227.

    Article  MathSciNet  Google Scholar 

  3. E. Astesiano, A. Giovini, and G. Reggio, Observational structures and their logic. Theoret. Comput. Sci. 96 (1992) 249–283.

    Article  MathSciNet  Google Scholar 

  4. B. Bloom, S. Istrail, and A.R. Meyer, Bisimulation can’t be traced, J. ACM 42 (1995) 232–268.

    Article  MathSciNet  Google Scholar 

  5. R.J. van Glabbeek, The linear time-branching time spectrum, in: J.C.M. Baeten and J.W. Klop, ed., Proc. CONCUR’90, LNCS 458 (Springer, Berlin, 1990) 278–297.

    Google Scholar 

  6. R.J. van Glabbeek, The linear time-branching time spectrum II; the semantics of sequential systems with silent moves, Tech. Report, Stanford University, 1993. Extended abstract in: E. Best, ed., Proc. CONCUR’93, LNCS 715 (Springer, Berlin, 1993 66–81.

    Google Scholar 

  7. J. Goguen and R. Burstall, Institutions: abstract model theory for specification and programming. J. ACM, 39 (1992) 95–146.

    Article  MathSciNet  Google Scholar 

  8. J.F. Groote, Transition system specifications with negative premises, Theoret. Comput. Sci. 118 (1993) 263–299.

    Article  MathSciNet  Google Scholar 

  9. J.F. Groote and F. Vaandrager, Structured operational semantics and bisimulation as a congruence, Inform. and Comput. 100 (1992) 202–260.

    Article  MathSciNet  Google Scholar 

  10. M. Hennessy and R. Milner, Algebraic laws for nondeterminism and concurrency, J. ACM 32 (1985) 137–161.

    Article  MathSciNet  Google Scholar 

  11. C.A.R. Hoare, Communicating Sequential Processes (Prentice Hall, New York, 1985).

    MATH  Google Scholar 

  12. P. Johnstone, Stone Spaces (Cambridge University Press, Cambridge, 1982).

    MATH  Google Scholar 

  13. A. Kurz, Specifying coalgebras with modal logic. Electronic Notes in Theoret. Comput. Sci. 11 (1998).

    Google Scholar 

  14. A. Mazurkiewicz, Concurrent program schemes and their interpretations. Tech. Report DAIMI PB-78, Aarhus University, Computer Science Department, 1977.

    Google Scholar 

  15. P. Menezes, A. Sernadas, and J.-F. Costa, Nonsequential automata semantics for a concurrent object-based language. To appear in Electronic Notes in Theoret. Comput. Sci..

    Google Scholar 

  16. R. Milner, A modal characterisation of observable machine behaviour, in: G. Astesiano and C. Bohm, ed., Proc. CAAP 81, LNCS 112 (Springer, Berlin, 1981) 25–34.

    Chapter  Google Scholar 

  17. R. Milner, Communication and Concurrency (Prentice Hall, New York, 1989).

    MATH  Google Scholar 

  18. C. Mulvey, &, Rend. Circ. Mat. Palermo (2) Suppl., No. 12 (1986) 99–104.

    Google Scholar 

  19. P. Resende, Quantales, nite observations and strong bisimulation. Preprint 26/97, Dep. Math., Tech. Univ. Lisbon, 1997. Submitted. Also available by ftpat cs.math.ist.utl.pt/pub/ResendeP/97-R-bisim.ps.

    Google Scholar 

  20. P. Resende, Tropological Systems and Observational Logic in Concurrency and Specification. Ph.D. thesis, Universidade Técnica de Lisboa, 1997.

    Google Scholar 

  21. K. Rosenthal, Quantales and Their Applications (Longman Scientific & Technical, London, 1990).

    MATH  Google Scholar 

  22. M. Smyth, Powerdomains and predicate transformers: a topological view. In J. Diaz, ed., Automata, Languages and Programming, LNCS 154 (Springer, Berlin, 1983) 662–675.

    Chapter  Google Scholar 

  23. S. Vickers, Topology Via Logic (Cambridge University Press, Cambridge, 1989).

    MATH  Google Scholar 

  24. G. Winskel and M. Nielsen, Models for concurrency. In Handbook of Logic in Computer Science, Vol. 4. (Oxford University Press, Oxford, 1995).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Matemática, Instituto Superior Técnico, Av. Rovisco Pais, 1096, Lisboa, Portugal

    Pedro Resende

Authors
  1. Pedro Resende
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Lisbon, Campo Grande 1700, Lisbon, Portugal

    José Luiz Fiadeiro

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Resende, P. (1999). Modular Specification of Concurrent Systems with Observational Logic. In: Fiadeiro, J.L. (eds) Recent Trends in Algebraic Development Techniques. Lecture Notes in Computer Science, vol 1589. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48483-3_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-48483-3_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-48483-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation