Reasoning about fair concurrent programs
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Event fairness and non-interleaving concurrency
Formal Aspects of Computing
Information Processing Letters
A hierarchy of temporal properties (invited paper, 1989)
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Interleaving set temporal logic
Theoretical Computer Science
Modelling nondeterministic concurrent processes with event structures
Fundamenta Informaticae
On the domain of traces and sequential composition
TAPSOFT '91 Proceedings of the international joint conference on theory and practice of software development on Colloquium on trees in algebra and programming (CAAP '91): vol 1
Defining process fairness for non-interleaving concurrency
FST and TC 10 Proceedings of the tenth conference on Foundations of software technology and theoretical computer science
Metric pomset semantics for a concurrent language with recursion
Proceedings of the LITP spring school on theoretical computer science on Semantics of systems of concurrent processes
Handbook of theoretical computer science (vol. B)
On topological characterization of behavioural properties
Topology and category theory in computer science
Handbook of logic in computer science (vol. 3)
Denotational linear time semantics and sequential composition
Information Processing Letters
Metric completion versus ideal completion
Theoretical Computer Science
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Communication and Concurrency
A Hierarchy of Partial Order Temporal Properties
ICTL '94 Proceedings of the First International Conference on Temporal Logic
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Proving Partial Order Liveness Properties
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Characterization of Temporal Property Classes
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
The Pomset Model of Parallel Processes: Unifying the Temporal and the Spatial
Seminar on Concurrency, Carnegie-Mellon University
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
An introduction to event structures
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Decidability and expressiveness of logics of processes
Decidability and expressiveness of logics of processes
Proving the Correctness of Multiprocess Programs
IEEE Transactions on Software Engineering
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |
The classification of properties of concurrent programs into safety and liveness was first proposed by Lamport [22]. Since then several characterizations of hierarchies of properties have been given, see e.g. [3, 20, 9, 21]; this includes syntactic characterizations (in terms classes of formulas of logics such as the linear temporal logic) as well as extensional (as sets of computations in some abstract domain). The latter often admits a topological characterization with respect to the natural topologies of the domain of computations. We introduce a general notion of a linear time model of computation which consists of partial and completed computations satisfying certain axioms. The model is endowed with a natural topology. We show that the usual topologies on strings, Mazurkiewicz traces and pomsets arise as special cases. We then introduce a hierarchy of properties including safety, liveness, guarantee, response and persistence properties, and show that our definition subsumes the hierarchies of: Alpern & Schneider [3]; Chang, Manna & Pnueli [9]; and Kwiatkowska, Peled & Penczek [21]. Syntactic characterizations of the properties in the hierarchy in terms of temporal logic are also studied.