
Transactions on Petri Nets and Other Models of Concurrency III
Springer (Publisher)
Published on 11. November 2009
Book
Paperback/Softback
XVII, 275 pages
978-3-642-04854-8 (ISBN)
Description
AccordingtoHolzmann [14], protocol speci?cationscomprise ?veelements: the service the protocol provides toits users; the set of messages that are exchanged between protocol entities; the format of each message; the rules governingm- sage exchange (procedures); and the assumptionsabout the environment in which the protocol is intended tooperate. In protocol standards documents, information related to the operatingenvironment isusually writteninformally andmayoccur in several di?erentplaces [37]. This informal speci?cation style canlead to misunderstandings andpossibly incompatible implementations. In contrast,executableformalmodelsrequireprecisespeci?cations oftheoperating environment. Ofparticularsigni?canceisthecommunicationmediumorchannel over which the protocol operates. Channelscan havedi?erent characteristics depending on the physical media (e. g. optical ?bre, copper, cable orunguided media (radio)) they employ. The characteristics also depend on the levelof the protocol inacomputer protocol architecture.
Forexample, the link-leveloperates over a singlemedium,whereas the network, transport andapplication levelsmayoperate over a network,or network of networks such as the Internet,which couldemploy several di?erent physical media. Channels (such as satellite links) can be noisy resulting in bit errors in packets. To correct biterrors in packets, many importantprotocols (such the Internet's TransmissionControl Protocol [27]) use CyclicRedundancy Checks (CRCs)[28] to detect errors. On detectingan error,the receiver discards the packet andrelies on the sender to retransmit itforrecovery,known as Au- maticRepeatreQuest(ARQ)[28]. Thisisachievedbythereceiveracknowledging the receipt of good packets, andby the transmitter maintainingatimer. When the timer expires before an acknowledgementhasbeen received, the transmitter retransmits packets that havebeen sent but are as yet notacknowledged. It may also be possibleforpacketsto be lost due to routers in networks discarding packets when congested.
Forexample, the link-leveloperates over a singlemedium,whereas the network, transport andapplication levelsmayoperate over a network,or network of networks such as the Internet,which couldemploy several di?erent physical media. Channels (such as satellite links) can be noisy resulting in bit errors in packets. To correct biterrors in packets, many importantprotocols (such the Internet's TransmissionControl Protocol [27]) use CyclicRedundancy Checks (CRCs)[28] to detect errors. On detectingan error,the receiver discards the packet andrelies on the sender to retransmit itforrecovery,known as Au- maticRepeatreQuest(ARQ)[28]. Thisisachievedbythereceiveracknowledging the receipt of good packets, andby the transmitter maintainingatimer. When the timer expires before an acknowledgementhasbeen received, the transmitter retransmits packets that havebeen sent but are as yet notacknowledged. It may also be possibleforpacketsto be lost due to routers in networks discarding packets when congested.
More details
Series
Edition
2009 ed.
Language
English
Place of publication
Berlin
Germany
Publishing group
Springer Berlin
Target group
Professional and scholarly
Research
Illustrations
XVII, 275 p.
Dimensions
Height: 235 mm
Width: 155 mm
Thickness: 17 mm
Weight
452 gr
ISBN-13
978-3-642-04854-8 (9783642048548)
DOI
10.1007/978-3-642-04856-2
Schweitzer Classification
Persons
Content
Designing a Workflow System Using Coloured Petri Nets.- From Requirements via Colored Workflow Nets to an Implementation in Several Workflow Systems.- Soundness of Workflow Nets with Reset Arcs.- Parameterised Coloured Petri Net Channel Models.- On Modelling and Analysing the Dynamic MANET On-Demand (DYMO) Routing Protocol.- Modelling Mobile IP with Mobile Petri Nets.- A Discretization Method from Coloured to Symmetric Nets: Application to an Industrial Example.- The ComBack Method Revisited: Caching Strategies and Extension with Delayed Duplicate Detection.- Comparison of Different Algorithms to Synthesize a Petri Net from a Partial Language.- On Bisimulation Theory in Linear Higher-Order ?-Calculus.