Deciding Global Partial-Order Properties

Authors:
Rajeev Alur;Ken McMillan;Doron Peled
Affiliations:
Department of Computer and Information Science, University of Pennsylvania;Cadence Berkeley Labs, USA;Department of Computer Science, University of Warwick, Warwick
Venue:
Formal Methods in System Design
Year:
2005

Citing 16
Cited 1

Modeling concurrency with partial orders

International Journal of Parallel Programming
Trace theory

Advances in Petri nets 1986, part II on Petri nets: applications and relationships to other models of concurrency
Interleaving set temporal logic

Theoretical Computer Science
On undecidability of propositional temporal logics on trace systems

Information Processing Letters
Proving partial order properties

Theoretical Computer Science
A partial approach to model checking

Papers presented at the IEEE symposium on Logic in computer science
A logical study of distributed transition systems

Information and Computation
Stutter-invariant temporal properties are expressible without the next-time operator

Information Processing Letters
Checking that finite state concurrent programs satisfy their linear specification

POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Stubborn Attack On State Explosion

CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Using Unfoldings to Avoid the State Explosion Problem in the Verification of Asynchronous Circuits

CAV '92 Proceedings of the Fourth International Workshop on Computer Aided Verification
Combining Partial Order Reductions with On-the-fly Model-Checking

CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
The State of SPIN

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Model-Checking of causality properties

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Model-checking of correctness conditions for concurrent objects

LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
A temporal logic for reasoning about partially ordered computations (Extended Abstract)

PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing

Modal logic over higher dimensional automata

CONCUR'10 Proceedings of the 21st international conference on Concurrency theory

Quantified Score

Hi-index	0.00

Visualization

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.