Interleaving set temporal logic

Theoretical Computer Science

Volumn 75, Issue 3, 1990, Pages 263-287

  Katz, Shmuel ^a   Peled, Doron ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL - DISTRIBUTED;

INTERLEAVING; TEMPORAL LOGIC;

COMPUTER METATHEORY;

EID: 0025506042     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(90)90096-Z     Document Type: Article

References (39)

1. Decidability and expressiveness of logics of programs
2. Appraising fairness in languages for distributed programming
3. A proof system for Communicating Sequential Processes
4. The temporal logic of branching time
5. A formal model of atomicity in asynchronous systems
6. On the semantics of concurrency: partial orders and transition systems
7. Repeated snapshots in synchronous systems and their implementation in CSP
8. Distributed snapshots: determining global states of distributed systems
9. Design and synthesis of synchronization skeletons using branching time temporal logic
10. Reasoning about fair concurrent programs
11. Partial ordering for CCS
12. Decomposition of distributed programs into communication-closed layers
13. Alternative semantics for temporal logic
14. “Sometimes” and “not never” revisited: on branching versus linear time temporal logic
15. Decision procedures and expressiveness in temporal logic of branching time
16. Fairness
17. An implementation of P and V
18. Axioms for concurrent objects
19. Communicating sequential processes
20. Hyper finite state systems: a hypergraph model for distributed finite systems
21. Paradigms for distributed programs: computing global states
22. What good is temporal logic?
23. On interprocess communication
24. What it means for a concurrent program to satisfy a specification: why no one has specified priority
25. Time, clocks, and the ordering of events in a distributed system
26. Impartiality, justice, fairness: the ethics of concurrent termination
27. Reasoning with time and chance
28. Verification of concurrent programs: the temporal framework
29. Adequate proof principles for invariance and liveness properties of concurrent programs
30. How to cook a temporal proof system for your pet language
31. Trade semantics
32. A Calculus of Communicating System
33. A temporal logic for reasoning about partially ordered computations
34. Modeling concurrency with partial orders
35. Partial order semantics versus interleaving semantics for CSP like languages and its impact on fairness
36. Event structures