Generalisation of the Well-Specified Check

Holger Hermanns; Daulet Turetayev

Generalisation of the Well-Specified Check

Holger Hermanns
, Daulet Turetayev

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

52 Downloads (Pure)

Abstract

This extended abstract sketches a generalisation of the well-specified algorithm which is used to check whether a stochastic process associated with instances of popular specification formalisms is unique. The generalised algorithm is computationally more expensive, since it explores the specified behaviour in multiple levels up to a user-specified depth. For depth 1, the essence of the original algorithm is obtained, while the exploration of more than 1 level allows one to accept specifications that are rejected by the original algorithm.

Original language	English
Title of host publication	PMCCS-6
Subtitle of host publication	The Sixth International Workshop on Performability Modeling of Computer and Communication Systems
Editors	Andrea Bobbio, Daniel Deavours, Yue Ma
Place of Publication	Urbana-Champaign
Publisher	University of Illinois at Urbana-Champaign
Pages	19-22
Publication status	Published - 6 Sept 2003
Event	6th International Workshop on Performability Modeling of Computer and Communication Systems, PMCCS 2003 - Monticello, United States Duration: 6 Sept 2003 → 7 Sept 2003 Conference number: 6

Conference

Conference	6th International Workshop on Performability Modeling of Computer and Communication Systems, PMCCS 2003
Abbreviated title	PMCCS
Country/Territory	United States
City	Monticello
Period	6/09/03 → 7/09/03

Access to Document

Hermanns2003generalisationFinal published version, 112 KB

Cite this

@inproceedings{e9937a4f898544249b42ab5b7605f7d7,

title = "Generalisation of the Well-Specified Check",

abstract = "This extended abstract sketches a generalisation of the well-specified algorithm which is used to check whether a stochastic process associated with instances of popular specification formalisms is unique. The generalised algorithm is computationally more expensive, since it explores the specified behaviour in multiple levels up to a user-specified depth. For depth 1, the essence of the original algorithm is obtained, while the exploration of more than 1 level allows one to accept specifications that are rejected by the original algorithm.",

author = "Holger Hermanns and Daulet Turetayev",

year = "2003",

month = sep,

day = "6",

language = "English",

pages = "19--22",

editor = "Andrea Bobbio and Daniel Deavours and Yue Ma",

booktitle = "PMCCS-6",

publisher = "University of Illinois at Urbana-Champaign",

address = "United States",

note = "6th International Workshop on Performability Modeling of Computer and Communication Systems, PMCCS 2003, PMCCS ; Conference date: 06-09-2003 Through 07-09-2003",

}

Hermanns, H & Turetayev, D 2003, Generalisation of the Well-Specified Check. in A Bobbio, D Deavours & Y Ma (eds), PMCCS-6: The Sixth International Workshop on Performability Modeling of Computer and Communication Systems. University of Illinois at Urbana-Champaign, Urbana-Champaign, pp. 19-22, 6th International Workshop on Performability Modeling of Computer and Communication Systems, PMCCS 2003, Monticello, Illinois, United States, 6/09/03.

Generalisation of the Well-Specified Check. / Hermanns, Holger; Turetayev, Daulet.
PMCCS-6: The Sixth International Workshop on Performability Modeling of Computer and Communication Systems. ed. / Andrea Bobbio; Daniel Deavours; Yue Ma. Urbana-Champaign: University of Illinois at Urbana-Champaign, 2003. p. 19-22.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

TY - GEN

T1 - Generalisation of the Well-Specified Check

AU - Hermanns, Holger

AU - Turetayev, Daulet

N1 - Conference code: 6

PY - 2003/9/6

Y1 - 2003/9/6

N2 - This extended abstract sketches a generalisation of the well-specified algorithm which is used to check whether a stochastic process associated with instances of popular specification formalisms is unique. The generalised algorithm is computationally more expensive, since it explores the specified behaviour in multiple levels up to a user-specified depth. For depth 1, the essence of the original algorithm is obtained, while the exploration of more than 1 level allows one to accept specifications that are rejected by the original algorithm.

AB - This extended abstract sketches a generalisation of the well-specified algorithm which is used to check whether a stochastic process associated with instances of popular specification formalisms is unique. The generalised algorithm is computationally more expensive, since it explores the specified behaviour in multiple levels up to a user-specified depth. For depth 1, the essence of the original algorithm is obtained, while the exploration of more than 1 level allows one to accept specifications that are rejected by the original algorithm.

M3 - Conference contribution

SP - 19

EP - 22

BT - PMCCS-6

A2 - Bobbio, Andrea

A2 - Deavours, Daniel

A2 - Ma, Yue

PB - University of Illinois at Urbana-Champaign

CY - Urbana-Champaign

T2 - 6th International Workshop on Performability Modeling of Computer and Communication Systems, PMCCS 2003

Y2 - 6 September 2003 through 7 September 2003

ER -

Generalisation of the Well-Specified Check

Abstract

Conference

Access to Document

Fingerprint

Cite this