Property Preserving Transition Refinement with Concurrent Runs: An Example

Newcastle upon Tyne, UK June 25-June 29

DOI Bookmark:

http://doi.ieeecomputersociety.org/10.1109/CSD.2001.981766

Second International Conference on Ap ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by Sibylle Peuker

	ASCII Text	x
	Sibylle Peuker, "Property Preserving Transition Refinement with Concurrent Runs: An Example," Application of Concurrency to System Design, International Conference on, pp. 77, Second International Conference on Application of Concurrency to System Design (ACSD'01), 2001.

	BibTex	x
	@article{ 10.1109/CSD.2001.981766, author = {Sibylle Peuker}, title = {Property Preserving Transition Refinement with Concurrent Runs: An Example}, journal ={Application of Concurrency to System Design, International Conference on}, volume = {0}, year = {2001}, isbn = {0-7695-1071-X}, pages = {77}, doi = {http://doi.ieeecomputersociety.org/10.1109/CSD.2001.981766}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Application of Concurrency to System Design, International Conference on TI - Property Preserving Transition Refinement with Concurrent Runs: An Example SN - 0-7695-1071-X SP EP A1 - Sibylle Peuker, PY - 2001 KW - Distributed Systems; Transition Refinement; Partial Order Semantics; Verification; Petri Nets. VL - 0 JA - Application of Concurrency to System Design, International Conference on ER -

Sibylle Peuker, Humboldt-Universit?t zu Berlin

We suggest a new notion of behavior preserving transition refinement based on partial order semantics. Furthermore, we discuss how to prove the correctness of a transition refinement step. Our results are formalized in the setting of Petri nets. We use Petri nets because they have a canonical partial order semantics, which is defined by concurrent runs.

Index Terms:

Distributed Systems; Transition Refinement; Partial Order Semantics; Verification; Petri Nets.

Citation:

Sibylle Peuker, "Property Preserving Transition Refinement with Concurrent Runs: An Example," acsd, pp.77, Second International Conference on Application of Concurrency to System Design (ACSD'01), 2001

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.