An introduction to metric semantics: operational and denotational models for programming and specification languages

Our focus is on the semantics of programming and specification languages. Over the years, different approaches to give semantics to these languages have been put forward. We restrict ourselves to the operational and the denotational approach, two main streams in the field of semantics. Two notions w...

Full description

Saved in:
Bibliographic Details
Published in:Theoretical computer science Vol. 258; no. 1; pp. 1 - 98
Main Author: van Breugel, Franck
Format: Journal Article
Language:English
Published: Amsterdam Elsevier B.V 2001
Elsevier
Subjects:
ISSN:0304-3975, 1879-2294
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Our focus is on the semantics of programming and specification languages. Over the years, different approaches to give semantics to these languages have been put forward. We restrict ourselves to the operational and the denotational approach, two main streams in the field of semantics. Two notions which play an important role in this paper are ( non) determinism and ( non) termination. Nondeterminism arises naturally in concurrent languages and it is a key concept in specification languages. Nontermination is usually caused by recursive constructs which are crucial in programming. The operational models are based on labelled transition systems. The definition of these systems is guided by the structure of the language. Metric spaces are an essential ingredient of our denotational models. We exploit the metric structure to model recursive constructs and to define operators on infinite entities. Furthermore, we also employ the metric structure to relate operational and denotational models for a given language. On the basis of four toy languages, we develop some general theory for defining operational and denotational semantic models and for relating them. This theory is applicable to a wide variety of languages. We start with a very simple deterministic and terminating imperative programming language. By adding the recursive while statement, we obtain a deterministic and nonterminating language. Next, we augment the language with the parallel composition resulting in a bounded nondeterministic and nonterminating language. Finally, we add some timed constructs. We obtain an unbounded nondeterministic and nonterminating specification language.
AbstractList Our focus is on the semantics of programming and specification languages. Over the years, different approaches to give semantics to these languages have been put forward. We restrict ourselves to the operational and the denotational approach, two main streams in the field of semantics. Two notions which play an important role in this paper are (non)determinism and (non)termination. Nondeterminism arises naturally in concurrent languages and it is a key concept in specification languages. Nontermination is usually caused by recursive constructs which are crucial in programming. The operational models are based on labelled transition systems. The definition of these systems is guided by the structure of the language. Metric spaces are an essential ingredient of our denotational models. We exploit the metric structure to model recursive constructs and to define operators on infinite entities. Furthermore, we also employ the metric structure to relate operational and denotational models for a given language. On the basis of four toy languages, we develop some general theory for defining operational and denotational semantic models and for relating them. This theory is applicable to a wide variety of languages. We start with a very simple deterministic and terminating imperative programming language. By adding the recursive while statement, we obtain a deterministic and nonterminating language. Next, we augment the language with the parallel composition resulting in a bounded nondeterministic and nonterminating language. Finally, we add some timed constructs. We obtain an unbounded nondeterministic and nonterminating specification language. copyright 2001 Elsevier Science B.V. All rights reserved.
Our focus is on the semantics of programming and specification languages. Over the years, different approaches to give semantics to these languages have been put forward. We restrict ourselves to the operational and the denotational approach, two main streams in the field of semantics. Two notions which play an important role in this paper are ( non) determinism and ( non) termination. Nondeterminism arises naturally in concurrent languages and it is a key concept in specification languages. Nontermination is usually caused by recursive constructs which are crucial in programming. The operational models are based on labelled transition systems. The definition of these systems is guided by the structure of the language. Metric spaces are an essential ingredient of our denotational models. We exploit the metric structure to model recursive constructs and to define operators on infinite entities. Furthermore, we also employ the metric structure to relate operational and denotational models for a given language. On the basis of four toy languages, we develop some general theory for defining operational and denotational semantic models and for relating them. This theory is applicable to a wide variety of languages. We start with a very simple deterministic and terminating imperative programming language. By adding the recursive while statement, we obtain a deterministic and nonterminating language. Next, we augment the language with the parallel composition resulting in a bounded nondeterministic and nonterminating language. Finally, we add some timed constructs. We obtain an unbounded nondeterministic and nonterminating specification language.
Author van Breugel, Franck
Author_xml – sequence: 1
  givenname: Franck
  surname: van Breugel
  fullname: van Breugel, Franck
  email: franck@cs.yorku.ca
  organization: York University, Department of Computer Science, 4700 Keele Street, Toronto, Canada M3J 1P3
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=960331$$DView record in Pascal Francis
BookMark eNqFkc2LFDEQxYOs4OzqnyAEBNFDayXp9IcelmXxCxY8qOdQW6keIt3JmGQE_3t7ZtY9eNm6BCq_9yjeOxdnMUUW4rmCNwpU9_YbGGgbM_b2FcBrgBZMYx-JjRr6sdF6bM_E5h55Is5L-Qnr2L7biHoVZYg1J7-nGlKUNcmFaw4kCy8Ya6DyTqYdZzx84ywxeuk5pvpvsSTPc5FTynKX0zbjsoS4PXJlxxSmQEdUzhi3e9xyeSoeTzgXfnb3XogfHz98v_7c3Hz99OX66qah1ujaGEN2UF6N06DJwsSavPZm7FpCT53xLarbWwLlbT9YP4ysleVOoZ4GNL0yF-LlyXe969eeS3VLKMTzeginfXG6G9q-h2EFX9yBWAjnKWOkUNwuhwXzHzd2YMzBzp4oyqmUzNM9oMAdmnDHJtwhZgfgjk04u-re_6ejcEqvZgzzg-rLk3oNmX8Hzq5Q4EjsQ2aqzqfwgMNf9sqnBg
CODEN TCSCDI
CitedBy_id crossref_primary_10_4304_jnw_8_8_1720_1725
crossref_primary_10_1016_j_topol_2011_02_003
crossref_primary_10_1145_3093333_3009890
crossref_primary_10_1016_j_entcs_2007_08_015
crossref_primary_10_1016_j_ic_2008_03_025
crossref_primary_10_1007_s00450_013_0251_7
crossref_primary_10_1017_S1755020319000510
crossref_primary_10_1016_j_tcs_2011_08_002
crossref_primary_10_1016_j_tcs_2020_10_001
crossref_primary_10_1016_j_tcs_2014_08_019
crossref_primary_10_1007_s12209_016_2565_6
crossref_primary_10_1093_jigpal_jzae121
Cites_doi 10.1016/S0019-9958(86)80019-5
10.1007/3-540-09526-8_8
10.1016/0304-3975(88)90030-8
10.1016/0304-3975(94)90052-3
10.1016/0304-3975(92)90390-2
10.1016/0304-3975(84)90114-2
10.1016/0304-3975(90)90060-U
10.4064/fm-8-1-114-134
10.1007/BFb0013038
10.1016/S0304-3975(99)00035-3
10.1016/S0019-9958(82)91250-5
10.1016/0890-5401(89)90057-6
10.1137/0219023
10.1016/0022-0000(89)90027-5
10.1007/3-540-15198-2_15
10.1016/S1571-0661(05)80465-7
10.1145/360248.360251
10.1007/3-540-60084-1_112
10.1049/ic:19990011
10.4064/fm-3-1-133-181
10.1016/0022-0000(88)90026-8
10.1007/BFb0036895
10.1145/512644.512662
10.1007/BF02403213
10.1007/BF01898401
10.1007/BF01691063
10.1090/S0002-9947-1951-0042109-4
10.1007/BF01209186
10.1016/0304-3975(94)00046-8
10.1007/3-540-12896-4_352
10.1145/800057.808663
10.1137/0213001
10.4064/fm-43-1-114-138
10.1016/0304-3975(90)90016-B
ContentType Journal Article
Copyright 2001 Elsevier Science B.V.
2001 INIST-CNRS
Copyright_xml – notice: 2001 Elsevier Science B.V.
– notice: 2001 INIST-CNRS
DBID 6I.
AAFTH
AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1016/S0304-3975(00)00403-5
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts

DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
Applied Sciences
EISSN 1879-2294
EndPage 98
ExternalDocumentID 960331
10_1016_S0304_3975_00_00403_5
S0304397500004035
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
29Q
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABTAH
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
G8K
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TAE
TN5
WH7
WUQ
XJT
YNT
ZMT
ZY4
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
CITATION
EFKBS
~HD
BNPGV
IQODW
SSH
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c432t-33c581d19f82c50fe2cd2d3964cadc63d4a1bbc01d5785d89e215e61a2f8a3713
ISICitedReferencesCount 28
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000168502800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0304-3975
IngestDate Sun Sep 28 08:48:07 EDT 2025
Wed Apr 02 08:08:53 EDT 2025
Sat Nov 29 06:16:34 EST 2025
Tue Nov 18 22:01:32 EST 2025
Fri Feb 23 02:23:13 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Specification language
Operational semantics
Programming language
Metric space
Denotational semantics
Metric semantics
Nondeterminism
Nontermination
Labelled transition system
Transition system
Semantics
Lambda calculus
Specification
Non termination
Non determinism
Language English
License http://www.elsevier.com/open-access/userlicense/1.0
https://www.elsevier.com/tdm/userlicense/1.0
https://www.elsevier.com/open-access/userlicense/1.0
CC BY 4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c432t-33c581d19f82c50fe2cd2d3964cadc63d4a1bbc01d5785d89e215e61a2f8a3713
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
OpenAccessLink https://dx.doi.org/10.1016/S0304-3975(00)00403-5
PQID 26847708
PQPubID 23500
PageCount 98
ParticipantIDs proquest_miscellaneous_26847708
pascalfrancis_primary_960331
crossref_primary_10_1016_S0304_3975_00_00403_5
crossref_citationtrail_10_1016_S0304_3975_00_00403_5
elsevier_sciencedirect_doi_10_1016_S0304_3975_00_00403_5
PublicationCentury 2000
PublicationDate 2001-00-00
PublicationDateYYYYMMDD 2001-01-01
PublicationDate_xml – year: 2001
  text: 2001-00-00
PublicationDecade 2000
PublicationPlace Amsterdam
PublicationPlace_xml – name: Amsterdam
PublicationTitle Theoretical computer science
PublicationYear 2001
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Michael (BIB41) 1951; 71
G. Costa, A metric characterization of fair computations in CCS, in: H. Ehrig, C. Floyd, M. Nivat, J. Thatcher, Proc. Internat. Joint Conf. on Theory and Practice of Software Development, Lecture Notes in Computer Science, vol. 185, Springer, Berlin, March 1985, 239–252.
de Bakker, Bergstra, Klop, Meyer (BIB11) 1984; 34
de Bakker, de Vink (BIB15) 1996
J.W. de Bakker, J.I. Zucker, Compactness in semantics for merge and fair merge, in: E. Clarke, D. Kozen (Eds.), Proc. 4th Workshop on Logics of Programs, Pittsburgh, Lecture Notes in Computer Science, vol. 164, Springer, Berlin, June 1983, pp. 18–33.
de Vink, Rutten (BIB52) 1999; 221
de Bruin (BIB21) 1984; 13
M. Escardó, A metric model of PCF, Presented at the Workshop on Realizability Semantics and Applications, Trento, June/July 1999.
J. Desharnais, V. Gupta, R. Jagadeesan, P. Panangaden, Metrics for labeled Markov processes, in: J.C.M. Baeten, S. Mauw (Eds.), Proc. 10th Internat. Conf. on Concurrency Theory, Eindhoven, Lecture Notes in Computer Science, vol. 1664, Springer, Berlin, August 1999, 258–273.
Banach (BIB18) 1922; 3
G.J. Norman, Metric semantics for reactive probabilistic systems, Ph.D. Thesis, University of Birmingham, November 1997.
Rutten, Zucker (BIB50) 1992; 16
de Bakker, Zucker (BIB16) 1982; 54
Baeten, Bergstra (BIB7) 1991; 3
F. Hausdorff, Grundzüge der Mengenlehre, Leipzig, 1914.
Nivat (BIB43) 1979; vol. 109
V. Natarajan, R. Cleaveland, Divergence and fair testing, in: Z. Fulop, F. Gecseg (Eds.), Proc. 22th Internat. Colloquium on Automata, Languages and Programming, Szeged, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, July 1995, 648–659.
Arnold, Nivat (BIB6) 1980; 3
de Bakker, Kok (BIB12) 1990; 75
F. van Breugel, Solutions to the Exercises in “An introduction to metric semantics: operational and denotational models for programming and specification languages”, Report CS-2000-02, York University, Toronto, August 2000.
Darondeau, Nolte, Priese, Yoccoz (BIB23) 1992; 97
Gunter (BIB28) 1992
MacQueen, Plotkin, Sethi (BIB39) 1986; 71
Reed, Roscoe (BIB47) 1988; 58
de Bakker, Meyer, Olderog, Zucker (BIB13) 1988; 36
A. Arnold, Topological characterizations of infinite behaviours of transition systems, in: J. Diaz (Ed.), Proc. 10th Internat. Colloquium on Automata, Languages and Programming, Barcelona, Lecture Notes in Computer Science, vol. 154, Springer, Berlin, July 1983, pp. 28–38.
Keller (BIB33) 1976; 19
A. Giacalone, C.-C. Jou, S.A. Smolka, Algebraic reasoning for probabilistic concurrent systems, Proc. IFIP WG 2.2/2.3 Working Conf. on Programming Concepts and Methods, Sea of Gallilee, North-Holland, Amsterdam, April 1990, pp. 443–458.
Sutherland (BIB51) 1975
M. Hennessy, G.D. Plotkin, Full abstraction for a simple parallel programming language, in: J. Bečvář (Eds.), Proc. 8th Symp. on Mathematical Foundations of Computer Science, Olomouc, Lecture Notes in Computer Science, vol. 74, Springer, Berlin, September 1979, 108–120.
van Breugel (BIB19) 1997
Kok, Rutten (BIB34) 1990; 76
P. America, J.W. de Bakker, J.N. Kok, J.J.M.M. Rutten, Operational semantics of a parallel object-oriented language, Proc. 13th Annual ACM Symp. on Principles of Programming Languages, St. Petersburg Beach, ACM, New York, January 1986, pp. 194–208.
Baier, Majster-Cederbaum (BIB9) 1994; 135
Rutten (BIB49) 1990; 19
Hennessy (BIB31) 1990
C. Baier, M. Kwiatkowska, Domain equations for probabilistic processes, in: C. Palamidessi, J. Parrow (Eds.), Proceedings of EXPRESS’97, Santa Margherita Ligure, Electronic Notes in Theoretical Computer Science, vol. 7, Elsevier, Amsterdam, September 1997.
J.J.M.M. Rutten, Correctness and full abstraction of metric semantics for concurrency, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Proc. School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, Lecture Notes in Computer Science, vol. 354, Springer, Berlin, May/June 1988, 628–659.
de Bakker, Rutten (BIB14) 1992
König (BIB35) 1926; 8
G.D. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Aarhus University, Aarhus, 1981.
P. Degano, U. Montanari, Liveness properties as convergence in metric spaces, Proc. 16th Annual ACM Symp. on Theory of Computing, Washington, ACM, New York, April/May 1984, pp. 31–38.
Alexandroff (BIB1) 1927; 96
J.I. den Hartog, Comparative Semantics for a process language with probabilistic choice and non-determinism, Report IR-445, Free University, Amsterdam, February 1998.
America, de Bakker, Kok, Rutten (BIB3) 1989; 83
Landweber (BIB38) 1969; 3
Majster-Cederbaum, Zetzsche (BIB40) 1994; 124
America, Rutten (BIB4) 1989; 39
Baire (BIB10) 1909; 32
J. Ouaknine, G.M. Reed, Model-checking temporal behaviour in CSP, in: H.R. Arabnia (Ed.), Proc. Internat. Conf. on Parallel and Distributed Processing Techniques and Applications, vol. 1, CSREA Press, Las Vegas, June/July 1999, 295–311.
R. Kuiper, An operational semantics for bounded nondeterminism equivalent to a denotational one, in: J.W. de Bakker, J.C. Vliet (Eds.), Proc. Internat. Symp. on Algorithmic Languages, North-Holland, Amsterdam, October 1981, 373–398.
Kuratowski (BIB37) 1956; 43
de Bakker (10.1016/S0304-3975(00)00403-5_BIB11) 1984; 34
Majster-Cederbaum (10.1016/S0304-3975(00)00403-5_BIB40) 1994; 124
Gunter (10.1016/S0304-3975(00)00403-5_BIB28) 1992
de Bakker (10.1016/S0304-3975(00)00403-5_BIB13) 1988; 36
Arnold (10.1016/S0304-3975(00)00403-5_BIB6) 1980; 3
Baeten (10.1016/S0304-3975(00)00403-5_BIB7) 1991; 3
10.1016/S0304-3975(00)00403-5_BIB29
de Bruin (10.1016/S0304-3975(00)00403-5_BIB21) 1984; 13
10.1016/S0304-3975(00)00403-5_BIB27
10.1016/S0304-3975(00)00403-5_BIB26
10.1016/S0304-3975(00)00403-5_BIB25
10.1016/S0304-3975(00)00403-5_BIB24
Baire (10.1016/S0304-3975(00)00403-5_BIB10) 1909; 32
10.1016/S0304-3975(00)00403-5_BIB22
Rutten (10.1016/S0304-3975(00)00403-5_BIB50) 1992; 16
10.1016/S0304-3975(00)00403-5_BIB20
de Bakker (10.1016/S0304-3975(00)00403-5_BIB12) 1990; 75
America (10.1016/S0304-3975(00)00403-5_BIB3) 1989; 83
Sutherland (10.1016/S0304-3975(00)00403-5_BIB51) 1975
MacQueen (10.1016/S0304-3975(00)00403-5_BIB39) 1986; 71
Nivat (10.1016/S0304-3975(00)00403-5_BIB43) 1979; vol. 109
America (10.1016/S0304-3975(00)00403-5_BIB4) 1989; 39
Darondeau (10.1016/S0304-3975(00)00403-5_BIB23) 1992; 97
10.1016/S0304-3975(00)00403-5_BIB36
Michael (10.1016/S0304-3975(00)00403-5_BIB41) 1951; 71
de Bakker (10.1016/S0304-3975(00)00403-5_BIB16) 1982; 54
10.1016/S0304-3975(00)00403-5_BIB32
10.1016/S0304-3975(00)00403-5_BIB30
Rutten (10.1016/S0304-3975(00)00403-5_BIB49) 1990; 19
de Bakker (10.1016/S0304-3975(00)00403-5_BIB15) 1996
10.1016/S0304-3975(00)00403-5_BIB8
Landweber (10.1016/S0304-3975(00)00403-5_BIB38) 1969; 3
Kok (10.1016/S0304-3975(00)00403-5_BIB34) 1990; 76
Alexandroff (10.1016/S0304-3975(00)00403-5_BIB1) 1927; 96
Baier (10.1016/S0304-3975(00)00403-5_BIB9) 1994; 135
10.1016/S0304-3975(00)00403-5_BIB48
10.1016/S0304-3975(00)00403-5_BIB46
10.1016/S0304-3975(00)00403-5_BIB45
10.1016/S0304-3975(00)00403-5_BIB2
10.1016/S0304-3975(00)00403-5_BIB44
10.1016/S0304-3975(00)00403-5_BIB42
10.1016/S0304-3975(00)00403-5_BIB5
Reed (10.1016/S0304-3975(00)00403-5_BIB47) 1988; 58
de Bakker (10.1016/S0304-3975(00)00403-5_BIB14) 1992
Keller (10.1016/S0304-3975(00)00403-5_BIB33) 1976; 19
Banach (10.1016/S0304-3975(00)00403-5_BIB18) 1922; 3
de Vink (10.1016/S0304-3975(00)00403-5_BIB52) 1999; 221
Hennessy (10.1016/S0304-3975(00)00403-5_BIB31) 1990
10.1016/S0304-3975(00)00403-5_BIB17
Kuratowski (10.1016/S0304-3975(00)00403-5_BIB37) 1956; 43
König (10.1016/S0304-3975(00)00403-5_BIB35) 1926; 8
van Breugel (10.1016/S0304-3975(00)00403-5_BIB19) 1997
References_xml – reference: J. Ouaknine, G.M. Reed, Model-checking temporal behaviour in CSP, in: H.R. Arabnia (Ed.), Proc. Internat. Conf. on Parallel and Distributed Processing Techniques and Applications, vol. 1, CSREA Press, Las Vegas, June/July 1999, 295–311.
– reference: M. Escardó, A metric model of PCF, Presented at the Workshop on Realizability Semantics and Applications, Trento, June/July 1999.
– volume: 13
  start-page: 59
  year: 1984
  end-page: 71
  ident: BIB21
  article-title: On the existence of cook semantics
  publication-title: SIAM J. Comput.
– volume: 221
  start-page: 271
  year: 1999
  end-page: 293
  ident: BIB52
  article-title: Bisimulation for probabilistic transition systems: a coalgebraic approach
  publication-title: Theoret. Comput. Sci.
– year: 1996
  ident: BIB15
  publication-title: Control Flow Semantics, Foundations of Computing Series
– reference: J.W. de Bakker, J.I. Zucker, Compactness in semantics for merge and fair merge, in: E. Clarke, D. Kozen (Eds.), Proc. 4th Workshop on Logics of Programs, Pittsburgh, Lecture Notes in Computer Science, vol. 164, Springer, Berlin, June 1983, pp. 18–33.
– volume: 3
  start-page: 376
  year: 1969
  end-page: 384
  ident: BIB38
  article-title: Decision problems for
  publication-title: Math. Systems Theory
– volume: 39
  start-page: 343
  year: 1989
  end-page: 375
  ident: BIB4
  article-title: Solving reflexive domain equations in a category of complete metric spaces
  publication-title: J. Comput. System Sci.
– year: 1997
  ident: BIB19
  publication-title: Comparative Metric Semantics of Programming Languages
– volume: 43
  start-page: 114
  year: 1956
  end-page: 138
  ident: BIB37
  article-title: Sur une méthode de métrisation complète des certains espaces d'ensembles compacts
  publication-title: Fund. Math.
– volume: 34
  start-page: 135
  year: 1984
  end-page: 156
  ident: BIB11
  article-title: Linear time and branching time semantics for recursion with merge
  publication-title: Theoret. Comput. Sci.
– reference: J. Desharnais, V. Gupta, R. Jagadeesan, P. Panangaden, Metrics for labeled Markov processes, in: J.C.M. Baeten, S. Mauw (Eds.), Proc. 10th Internat. Conf. on Concurrency Theory, Eindhoven, Lecture Notes in Computer Science, vol. 1664, Springer, Berlin, August 1999, 258–273.
– volume: 3
  start-page: 133
  year: 1922
  end-page: 181
  ident: BIB18
  article-title: Sur les opérations dans les ensembles abstraits et leurs applications aux equations intégrales
  publication-title: Fund. Math.
– volume: 16
  start-page: 1
  year: 1992
  end-page: 38
  ident: BIB50
  article-title: A semantic approach to fairness
  publication-title: Fund. Inform.
– reference: G.D. Plotkin, A structural approach to operational semantics, Report DAIMI FN-19, Aarhus University, Aarhus, 1981.
– volume: 83
  start-page: 152
  year: 1989
  end-page: 205
  ident: BIB3
  article-title: Denotational semantics of a parallel object-oriented language
  publication-title: Inform. and Comput.
– reference: G. Costa, A metric characterization of fair computations in CCS, in: H. Ehrig, C. Floyd, M. Nivat, J. Thatcher, Proc. Internat. Joint Conf. on Theory and Practice of Software Development, Lecture Notes in Computer Science, vol. 185, Springer, Berlin, March 1985, 239–252.
– reference: F. van Breugel, Solutions to the Exercises in “An introduction to metric semantics: operational and denotational models for programming and specification languages”, Report CS-2000-02, York University, Toronto, August 2000.
– volume: 97
  start-page: 131
  year: 1992
  end-page: 142
  ident: BIB23
  article-title: Fairness, distances and degrees
  publication-title: Theoret. Comput. Sci.
– volume: 135
  start-page: 171
  year: 1994
  end-page: 220
  ident: BIB9
  article-title: Denotational semantics in the cpo and metric approach
  publication-title: Theoret. Comput. Sci.
– volume: 19
  start-page: 371
  year: 1976
  end-page: 384
  ident: BIB33
  article-title: Formal verification of parallel programs
  publication-title: Comm. ACM
– reference: F. Hausdorff, Grundzüge der Mengenlehre, Leipzig, 1914.
– volume: vol. 109
  start-page: 3
  year: 1979
  end-page: 52
  ident: BIB43
  article-title: Infinite words, infinite trees, infinite computations
  publication-title: Foundations of Computer Science III, part 2
– volume: 19
  start-page: 341
  year: 1990
  end-page: 383
  ident: BIB49
  article-title: Semantic correctness for a parallel object-oriented language
  publication-title: SIAM J. Comput.
– reference: V. Natarajan, R. Cleaveland, Divergence and fair testing, in: Z. Fulop, F. Gecseg (Eds.), Proc. 22th Internat. Colloquium on Automata, Languages and Programming, Szeged, Lecture Notes in Computer Science, vol. 944, Springer, Berlin, July 1995, 648–659.
– reference: M. Hennessy, G.D. Plotkin, Full abstraction for a simple parallel programming language, in: J. Bečvář (Eds.), Proc. 8th Symp. on Mathematical Foundations of Computer Science, Olomouc, Lecture Notes in Computer Science, vol. 74, Springer, Berlin, September 1979, 108–120.
– volume: 58
  start-page: 249
  year: 1988
  end-page: 261
  ident: BIB47
  article-title: A timed model for communicating sequential processes
  publication-title: Theoret. Comput. Sci.
– volume: 124
  start-page: 1
  year: 1994
  end-page: 40
  ident: BIB40
  article-title: The comparison of a cpo-based semantics with a cms-based semantics for CSP
  publication-title: Theoret. Comput. Sci.
– volume: 36
  start-page: 158
  year: 1988
  end-page: 224
  ident: BIB13
  article-title: Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
  publication-title: J. Comput. System Sci.
– volume: 96
  start-page: 555
  year: 1927
  end-page: 571
  ident: BIB1
  article-title: Über stetige Abbildungen kompakter Räume
  publication-title: Math. Ann.
– reference: P. Degano, U. Montanari, Liveness properties as convergence in metric spaces, Proc. 16th Annual ACM Symp. on Theory of Computing, Washington, ACM, New York, April/May 1984, pp. 31–38.
– volume: 71
  start-page: 95
  year: 1986
  end-page: 130
  ident: BIB39
  article-title: An ideal model for recursive polymorphic types
  publication-title: Inform. and Control
– year: 1990
  ident: BIB31
  publication-title: The Semantics of Programming Languages: an Elementary Introduction Using Structural Operational Semantics
– volume: 3
  start-page: 445
  year: 1980
  end-page: 476
  ident: BIB6
  article-title: The metric space of infinite trees, algebraic and topological properties
  publication-title: Fund. Inform.
– reference: J.J.M.M. Rutten, Correctness and full abstraction of metric semantics for concurrency, in: J.W. de Bakker, W.-P. de Roever, G. Rozenberg (Eds.), Proc. School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Noordwijkerhout, Lecture Notes in Computer Science, vol. 354, Springer, Berlin, May/June 1988, 628–659.
– volume: 54
  start-page: 70
  year: 1982
  end-page: 120
  ident: BIB16
  article-title: Processes and the denotational semantics of concurrency
  publication-title: Inform. and Control
– reference: P. America, J.W. de Bakker, J.N. Kok, J.J.M.M. Rutten, Operational semantics of a parallel object-oriented language, Proc. 13th Annual ACM Symp. on Principles of Programming Languages, St. Petersburg Beach, ACM, New York, January 1986, pp. 194–208.
– year: 1992
  ident: BIB28
  publication-title: Semantics of Programming Languages
– volume: 76
  start-page: 179
  year: 1990
  end-page: 222
  ident: BIB34
  article-title: Contractions in comparing concurrency semantics
  publication-title: Theoret. Comput. Sci.
– volume: 8
  start-page: 114
  year: 1926
  end-page: 134
  ident: BIB35
  article-title: Sur les correspondances multivoques des ensembles
  publication-title: Fund. Math.
– volume: 3
  start-page: 142
  year: 1991
  end-page: 188
  ident: BIB7
  article-title: Real time process algebra
  publication-title: Formal Aspects Comput.
– year: 1975
  ident: BIB51
  publication-title: Introduction to Metric and Topological Spaces
– reference: A. Giacalone, C.-C. Jou, S.A. Smolka, Algebraic reasoning for probabilistic concurrent systems, Proc. IFIP WG 2.2/2.3 Working Conf. on Programming Concepts and Methods, Sea of Gallilee, North-Holland, Amsterdam, April 1990, pp. 443–458.
– volume: 32
  start-page: 97
  year: 1909
  end-page: 176
  ident: BIB10
  article-title: Sur la représentation des fonctions discontinues (deuxième parti)
  publication-title: Acta Math.
– reference: R. Kuiper, An operational semantics for bounded nondeterminism equivalent to a denotational one, in: J.W. de Bakker, J.C. Vliet (Eds.), Proc. Internat. Symp. on Algorithmic Languages, North-Holland, Amsterdam, October 1981, 373–398.
– reference: J.I. den Hartog, Comparative Semantics for a process language with probabilistic choice and non-determinism, Report IR-445, Free University, Amsterdam, February 1998.
– volume: 71
  start-page: 152
  year: 1951
  end-page: 182
  ident: BIB41
  article-title: Topologies on spaces of subsets
  publication-title: Trans. Amer. Math. Soc.
– reference: A. Arnold, Topological characterizations of infinite behaviours of transition systems, in: J. Diaz (Ed.), Proc. 10th Internat. Colloquium on Automata, Languages and Programming, Barcelona, Lecture Notes in Computer Science, vol. 154, Springer, Berlin, July 1983, pp. 28–38.
– year: 1992
  ident: BIB14
  publication-title: Ten Years of Concurrency Semantics, selected papers of the Amsterdam Concurrency Group
– volume: 75
  start-page: 15
  year: 1990
  end-page: 43
  ident: BIB12
  article-title: Comparative metric semantics for concurrent prolog
  publication-title: Theoret. Comput. Sci.
– reference: G.J. Norman, Metric semantics for reactive probabilistic systems, Ph.D. Thesis, University of Birmingham, November 1997.
– reference: C. Baier, M. Kwiatkowska, Domain equations for probabilistic processes, in: C. Palamidessi, J. Parrow (Eds.), Proceedings of EXPRESS’97, Santa Margherita Ligure, Electronic Notes in Theoretical Computer Science, vol. 7, Elsevier, Amsterdam, September 1997.
– volume: 71
  start-page: 95
  issue: 1/2
  year: 1986
  ident: 10.1016/S0304-3975(00)00403-5_BIB39
  article-title: An ideal model for recursive polymorphic types
  publication-title: Inform. and Control
  doi: 10.1016/S0019-9958(86)80019-5
– ident: 10.1016/S0304-3975(00)00403-5_BIB25
– ident: 10.1016/S0304-3975(00)00403-5_BIB32
  doi: 10.1007/3-540-09526-8_8
– volume: 58
  start-page: 249
  issue: 1/3
  year: 1988
  ident: 10.1016/S0304-3975(00)00403-5_BIB47
  article-title: A timed model for communicating sequential processes
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(88)90030-8
– ident: 10.1016/S0304-3975(00)00403-5_BIB44
– ident: 10.1016/S0304-3975(00)00403-5_BIB29
– volume: 124
  start-page: 1
  issue: 1
  year: 1994
  ident: 10.1016/S0304-3975(00)00403-5_BIB40
  article-title: The comparison of a cpo-based semantics with a cms-based semantics for CSP
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(94)90052-3
– volume: 97
  start-page: 131
  issue: 1
  year: 1992
  ident: 10.1016/S0304-3975(00)00403-5_BIB23
  article-title: Fairness, distances and degrees
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(92)90390-2
– volume: 34
  start-page: 135
  issue: 1/2
  year: 1984
  ident: 10.1016/S0304-3975(00)00403-5_BIB11
  article-title: Linear time and branching time semantics for recursion with merge
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(84)90114-2
– volume: 16
  start-page: 1
  issue: 1
  year: 1992
  ident: 10.1016/S0304-3975(00)00403-5_BIB50
  article-title: A semantic approach to fairness
  publication-title: Fund. Inform.
– year: 1992
  ident: 10.1016/S0304-3975(00)00403-5_BIB28
– volume: 75
  start-page: 15
  issue: 1/2
  year: 1990
  ident: 10.1016/S0304-3975(00)00403-5_BIB12
  article-title: Comparative metric semantics for concurrent prolog
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(90)90060-U
– ident: 10.1016/S0304-3975(00)00403-5_BIB26
– volume: 8
  start-page: 114
  year: 1926
  ident: 10.1016/S0304-3975(00)00403-5_BIB35
  article-title: Sur les correspondances multivoques des ensembles
  publication-title: Fund. Math.
  doi: 10.4064/fm-8-1-114-134
– ident: 10.1016/S0304-3975(00)00403-5_BIB48
  doi: 10.1007/BFb0013038
– year: 1975
  ident: 10.1016/S0304-3975(00)00403-5_BIB51
– volume: 221
  start-page: 271
  issue: 1/2
  year: 1999
  ident: 10.1016/S0304-3975(00)00403-5_BIB52
  article-title: Bisimulation for probabilistic transition systems: a coalgebraic approach
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(99)00035-3
– volume: 54
  start-page: 70
  issue: 1/2
  year: 1982
  ident: 10.1016/S0304-3975(00)00403-5_BIB16
  article-title: Processes and the denotational semantics of concurrency
  publication-title: Inform. and Control
  doi: 10.1016/S0019-9958(82)91250-5
– year: 1996
  ident: 10.1016/S0304-3975(00)00403-5_BIB15
– volume: 83
  start-page: 152
  issue: 2
  year: 1989
  ident: 10.1016/S0304-3975(00)00403-5_BIB3
  article-title: Denotational semantics of a parallel object-oriented language
  publication-title: Inform. and Comput.
  doi: 10.1016/0890-5401(89)90057-6
– volume: 19
  start-page: 341
  issue: 2
  year: 1990
  ident: 10.1016/S0304-3975(00)00403-5_BIB49
  article-title: Semantic correctness for a parallel object-oriented language
  publication-title: SIAM J. Comput.
  doi: 10.1137/0219023
– volume: 39
  start-page: 343
  issue: 3
  year: 1989
  ident: 10.1016/S0304-3975(00)00403-5_BIB4
  article-title: Solving reflexive domain equations in a category of complete metric spaces
  publication-title: J. Comput. System Sci.
  doi: 10.1016/0022-0000(89)90027-5
– ident: 10.1016/S0304-3975(00)00403-5_BIB22
  doi: 10.1007/3-540-15198-2_15
– ident: 10.1016/S0304-3975(00)00403-5_BIB36
– ident: 10.1016/S0304-3975(00)00403-5_BIB8
  doi: 10.1016/S1571-0661(05)80465-7
– ident: 10.1016/S0304-3975(00)00403-5_BIB27
– volume: 19
  start-page: 371
  issue: 7
  year: 1976
  ident: 10.1016/S0304-3975(00)00403-5_BIB33
  article-title: Formal verification of parallel programs
  publication-title: Comm. ACM
  doi: 10.1145/360248.360251
– ident: 10.1016/S0304-3975(00)00403-5_BIB42
  doi: 10.1007/3-540-60084-1_112
– volume: vol. 109
  start-page: 3
  year: 1979
  ident: 10.1016/S0304-3975(00)00403-5_BIB43
  article-title: Infinite words, infinite trees, infinite computations
– ident: 10.1016/S0304-3975(00)00403-5_BIB45
  doi: 10.1049/ic:19990011
– volume: 3
  start-page: 133
  year: 1922
  ident: 10.1016/S0304-3975(00)00403-5_BIB18
  article-title: Sur les opérations dans les ensembles abstraits et leurs applications aux equations intégrales
  publication-title: Fund. Math.
  doi: 10.4064/fm-3-1-133-181
– ident: 10.1016/S0304-3975(00)00403-5_BIB46
– volume: 36
  start-page: 158
  issue: 2
  year: 1988
  ident: 10.1016/S0304-3975(00)00403-5_BIB13
  article-title: Transition systems, metric spaces and ready sets in the semantics of uniform concurrency
  publication-title: J. Comput. System Sci.
  doi: 10.1016/0022-0000(88)90026-8
– year: 1992
  ident: 10.1016/S0304-3975(00)00403-5_BIB14
– ident: 10.1016/S0304-3975(00)00403-5_BIB5
  doi: 10.1007/BFb0036895
– volume: 3
  start-page: 445
  issue: 4
  year: 1980
  ident: 10.1016/S0304-3975(00)00403-5_BIB6
  article-title: The metric space of infinite trees, algebraic and topological properties
  publication-title: Fund. Inform.
– ident: 10.1016/S0304-3975(00)00403-5_BIB2
  doi: 10.1145/512644.512662
– volume: 32
  start-page: 97
  issue: 1
  year: 1909
  ident: 10.1016/S0304-3975(00)00403-5_BIB10
  article-title: Sur la représentation des fonctions discontinues (deuxième parti)
  publication-title: Acta Math.
  doi: 10.1007/BF02403213
– volume: 3
  start-page: 142
  issue: 2
  year: 1991
  ident: 10.1016/S0304-3975(00)00403-5_BIB7
  article-title: Real time process algebra
  publication-title: Formal Aspects Comput.
  doi: 10.1007/BF01898401
– volume: 3
  start-page: 376
  issue: 4
  year: 1969
  ident: 10.1016/S0304-3975(00)00403-5_BIB38
  article-title: Decision problems for ω-automata
  publication-title: Math. Systems Theory
  doi: 10.1007/BF01691063
– volume: 71
  start-page: 152
  issue: 1
  year: 1951
  ident: 10.1016/S0304-3975(00)00403-5_BIB41
  article-title: Topologies on spaces of subsets
  publication-title: Trans. Amer. Math. Soc.
  doi: 10.1090/S0002-9947-1951-0042109-4
– volume: 96
  start-page: 555
  year: 1927
  ident: 10.1016/S0304-3975(00)00403-5_BIB1
  article-title: Über stetige Abbildungen kompakter Räume
  publication-title: Math. Ann.
  doi: 10.1007/BF01209186
– ident: 10.1016/S0304-3975(00)00403-5_BIB30
– volume: 135
  start-page: 171
  issue: 2
  year: 1994
  ident: 10.1016/S0304-3975(00)00403-5_BIB9
  article-title: Denotational semantics in the cpo and metric approach
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(94)00046-8
– ident: 10.1016/S0304-3975(00)00403-5_BIB17
  doi: 10.1007/3-540-12896-4_352
– year: 1997
  ident: 10.1016/S0304-3975(00)00403-5_BIB19
– ident: 10.1016/S0304-3975(00)00403-5_BIB24
  doi: 10.1145/800057.808663
– year: 1990
  ident: 10.1016/S0304-3975(00)00403-5_BIB31
– volume: 13
  start-page: 59
  issue: 1
  year: 1984
  ident: 10.1016/S0304-3975(00)00403-5_BIB21
  article-title: On the existence of cook semantics
  publication-title: SIAM J. Comput.
  doi: 10.1137/0213001
– volume: 43
  start-page: 114
  issue: 1
  year: 1956
  ident: 10.1016/S0304-3975(00)00403-5_BIB37
  article-title: Sur une méthode de métrisation complète des certains espaces d'ensembles compacts
  publication-title: Fund. Math.
  doi: 10.4064/fm-43-1-114-138
– volume: 76
  start-page: 179
  issue: 2/3
  year: 1990
  ident: 10.1016/S0304-3975(00)00403-5_BIB34
  article-title: Contractions in comparing concurrency semantics
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/0304-3975(90)90016-B
– ident: 10.1016/S0304-3975(00)00403-5_BIB20
SSID ssj0000576
Score 1.8108637
Snippet Our focus is on the semantics of programming and specification languages. Over the years, different approaches to give semantics to these languages have been...
Our focus is on the semantics of programming and specification languages. Over the years, different approaches to give semantics to these languages have been...
SourceID proquest
pascalfrancis
crossref
elsevier
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 1
SubjectTerms Applied sciences
Computer science; control theory; systems
Denotational semantics
Exact sciences and technology
Labelled transition system
Language theory and syntactical analysis
Metric semantics
Metric space
Nondeterminism
Nontermination
Operational semantics
Programming language
Specification language
Theoretical computing
Title An introduction to metric semantics: operational and denotational models for programming and specification languages
URI https://dx.doi.org/10.1016/S0304-3975(00)00403-5
https://www.proquest.com/docview/26847708
Volume 258
WOSCitedRecordID wos000168502800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fq9MwFA6664Mi_rgqTq-aBxFl9Nok7dr6NmVDZe76sHvZW0iTVATXzbWT--d70iRdx0WmD8IoI7QN5Pt6cpKccz6EXgr4-lQUiiDUKgoiltNAMLNYyakiRNFINvopF9NkNksXi-yry7iuGjmBpCzTy8ts_V-hhjYA26TO_gPc7UuhAf4D6HAF2OH6V8CPTOxibQu5GmzBuVwa2Sw5qPQSxtFEBrHR4GytN34j0Gyeg_1Z1b6h0cdpKjX4AK6lT2Y0qZkmvMgSx293Vl0nd95JjpRONWLgploP8AXYlfcbvf1mowQme7sPpGOemDlTyazuibelNE67pHGZjdY2ks4ka5Wnr5hvu5NQta8GJ9toVWfG1LAg3s1Z_px-dsYn59Mpn48X81frn4FREzOn7k5a5To6ogksmXroaPRpvPi8m6PjxJ5iu452uV1vd72_DsM3ruc_eS2316KCwSysCMqV-bxxUub30B23usAjy4r76Jouj9Fdr9yBnSE_Rre-tNV6qweoHpW4Sxlcr7ClDG4p8w53CIOBCLhLGGwJg4EwuEOY5r49wuCWMA_R-WQ8__AxcGocgYwYrQPGZAyLG5IVKZVxWGgqFVUsG0ZSKDlkKhIkz2VIlKmfpNJMgzeph0TQIoXPn7BHqFeuSv0YYUEYFZoJLQtYMKssH1LJ0kIUsdSZiFgfRX60uXSl6o1iyg--i0kEkLgBiYemvi2AxOM-Om0fW9taLYceSD2U3H0F1pHkQMhDj57sQd92mA1DxkgfvfBM4GCvzSGcKPVqW3FTXSlJwvTJwTueops24NH8TlCv3mz1M3RD_qq_V5vnjtG_AXFyt54
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+introduction+to+metric+semantics%3A+Operational+and+denotational+models+for+programming+and+specification+languages&rft.jtitle=Theoretical+computer+science&rft.au=Van+Breugel%2C+F&rft.date=2001&rft.issn=0304-3975&rft.volume=258&rft.issue=1-2&rft.spage=1&rft.epage=98&rft_id=info:doi/10.1016%2Fs0304-3975%2800%2900403-5&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon