UNSPECIFIED. (2005) Deciding global partial-order properties. FORMAL METHODS IN SYSTEM DESIGN, 26 (1). pp. 7-25. ISSN 0925-9856

Full text not available from this repository.

Abstract

Model checking of asynchronous systems is traditionally based on the interleaving model, where an execution is modeled by a total order between atomic events. Recently, the use of partial order semantics, representing the causal order between events, is becoming popular. This paper considers the model checking problem for partial-order temporal logics. Solutions to this problem exist for partial order logics over local states. For the more general global logics that are interpreted over global states, only undecidability results have been proved. In this paper, we present a decision procedure for a partial order temporal logic over global states. We also sharpen the undecidability results by showing that a single until operator is sufficient for undecidability.

Item Type:	Journal Article
Subjects:	Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
Journal or Publication Title:	FORMAL METHODS IN SYSTEM DESIGN
Publisher:	SPRINGER
ISSN:	0925-9856
Date:	January 2005
Volume:	26
Number:	1
Number of Pages:	19
Page Range:	pp. 7-25
Identification Number:	10.1007/s10703-005-4592-0
Publication Status:	Published
URI:	http://wrap.warwick.ac.uk/id/eprint/7386

Data sourced from Thomson Reuters' Web of Knowledge

Request changes to a record

Actions (login required)

View Item