The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Proving partial order properties
Theoretical Computer Science
Reasoning about infinite computations
Information and Computation
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Communicating sequential processes
Communications of the ACM
Simple on-the-fly automatic verification of linear temporal logic
Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification XV
Difficult Configurations - On the Complexity of LTrL
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Deciding Global Partial-Order Properties
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Proceedings of an Advanced Course on Petri Nets: Central Models and Their Properties, Advances in Petri Nets 1986-Part II
Detection of global predicates: techniques and their limitations
Distributed Computing
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
| Hi-index | 5.24 |
Certain behavioral properties of distributed systems are difficult to express in interleaving semantics, whereas they are naturally expressed in terms of partial orders of events or, equivalently, Mazurkiewicz traces. Two examples of such properties are serializability of a database and global snapshots of concurrent systems. Recently, a modest extension for LTL by an operator that expresses snapshots, has been proposed. It combines the ease of linear (interleaving) specification with this useful partial order concept. The new construct allows one to assert that a global snapshot appeared in the past, perhaps not in the observed execution sequence, but possibly in an equivalent one. Originally, a model checking algorithm for this logic that is exponential space in the size of the system was suggested. In this paper, we provide a model checking algorithm that is in polynomial space in the size of the system. Our construction can also serve as an efficient (polynomial) algorithm for detecting conjunctive properties (i.e., conjunction of local process properties) in a concurrent history of execution.