Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Labeled Transition Systems and Their Refinement Read chapter Read first chapter

2018 | OriginalPaper | Chapter

9. Relational Concurrent Refinement

Authors : John Derrick, Eerke Boiten

Published in: Refinement

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

In the previous parts of the book, basic refinement relations were introduced semantically and for a variety of specification languages. This chapter starts the task of relating these different refinement relations by defining corresponding processes for ADT specifications, as well as process semantics for ADT specifications, and providing theorems relating refinement relations across formalisms via such embeddings.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter State-Based Languages: Event-B and ASM
next chapter Relating Data Refinement and Failures-Divergences Refinement
Footnotes
1
See [1].
 
2
This condition is left implicit in the rest of this chapter.
 
Literature
1.
Derrick J, Boiten EA (2003) Relational concurrent refinement. Form Asp Comput 15(1):182–214CrossRef
2.
Schneider S (2006) Non-blocking data refinement and traces-divergences semantics, personal communication
3.
Bolton C, Davies J (2002) Refinement in Object-Z and CSP. In: Butler M, Petre L, Sere K (eds) Integrated formal methods (IFM 2002). Lecture notes in computer science, vol 2335. Springer, Berlin, pp 225–244
4.
Bolton C, Davies J (2006) A singleton failures semantics for communicating sequential processes. Form Asp Comput 18(2):181–210CrossRef
5.
Josephs MB (1988) A state-based approach to communicating processes. Distrib Comput 3:9–18CrossRef
6.
Boiten EA, Derrick J (2002) Unifying concurrent and relational refinement. In: Derrick J, Boiten EA, von Wright J, Woodcock JCP (eds) ENTCS. Proceedings REFINE’02, vol 70
7.
Reeves S, Streader D (2008) Data refinement and singleton failures refinement are not equivalent. Form Asp Comput 20(3):295–301CrossRef
8.
Boiten EA, Derrick J, Schellhorn G (2009) Relational concurrent refinement II: internal operations and outputs. Form Asp Comput 21(1–2):65–102CrossRef
9.
Derrick J, Boiten EA (2008) More relational refinement: traces and partial relations. Electron Notes Theor Comput Sci 214:255–276 (Proceedings of REFINE, Turku, 2008)
10.
Boiten EA, Derrick J (2009) Modelling divergence in relational concurrent refinement. In: Leuschel M, Wehrheim H (eds) IFM 2009: Integrated formal methods. Lecture notes in computer science, vol 5423. Springer, Berlin, pp 183–199
11.
Bolton C (2002) On the refinement of state-based and event-based models. PhD thesis, University of Oxford
12.
van Glabbeek RJ (2001) The linear time - branching time spectrum I. The semantics of concrete sequential processes. In: Bergstra JA, Ponse A, Smolka SA (eds) Handbook of process algebra. Amsterdam, North-Holland, pp 3–99
13.
Bolton C, Lowe G (2005) A hierarchy of failures-based models: theory and application. Theor Comput Sci 330(3):407–438MathSciNetCrossRef
14.
Bolton C, Lowe G (2003) A hierarchy of failures-based models. In: Corradini F, Westmann U (eds) Proceedings of express 2003: 10th international workshop on expressiveness in concurrency. Elsevier Science Publishers, Amsterdam
15.
Reeves S, Streader D (2006) State- and event-based refinement. Technical report, University of Waikato, Department of computer science, University of Waikato, New Zealand
16.
17.
Tretmans J (1996) Test generation with inputs, outputs, and quiescence. In: Margaria T, Steffen B (eds) Second international workshop on tools and algorithms for the construction and analysis of systems (TACAS’96). Lecture notes in computer science, vol 1055. Springer, Berlin, pp 127–146
18.
19.
20.
Segala R (1993) Quiescence, fairness, testing, and the notion of implementation (extended abstract). In: International conference on concurrency theory, pp 324–338
21.
Vaandrager FW (1991) On the relationship between process algebra and input/output automata. Logic in computer science, pp 387–398
22.
de Nicola R, Segala R (1995) A process algebraic view of I/O automata. Theor Comput Sci 138:391–423CrossRef
Metadata
Title
Relational Concurrent Refinement
Authors
John Derrick
Eerke Boiten
Copyright Year
2018
Book
Refinement

Print ISBN: 978-3-319-92709-1

Electronic ISBN: 978-3-319-92711-4

Copyright Year: 2018

DOI
https://doi.org/10.1007/978-3-319-92711-4_9

Premium Partner

    Image Credits