Safety and liveness in branching time

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2001, Pages 366-373

  Manolios, P ^a   Trefler, R ^a  

^a University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; AUTOMATA THEORY; DIFFERENTIATION (CALCULUS); FORMAL LOGIC; LINEARIZATION; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS; SET THEORY; TREES (MATHEMATICS);

BRANCHING TIME; RABIN AUTOMATA;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0034871631     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. Algorithmic analysis of programs with well quasi-ordered domains
2. Defining liveness
3. Recognizing safety and liveness
4. Countable nondeterminism and random assignment
5. Safety for branching time semantics
6. Synthesis of synchronization skeletons for branching time temporal logic
7. Temporal and modal logic
8. Characterizing correctness properties of parallel programs as fixpoints
9. "Sometimes" and "not never" revisited: On branching versus linear time temporal logic
10. Another glance at the alpern-schneider characterization of safety and liveness in concurrent executions
11. On the development of reactive systems
12. Results on the propositional Mu-Calculus
13. Model checking of safety properties
14. Proving the correctness of multiprocess programs
15. The temporal logic of programs
16. A decidable mu-calculus: Preliminary report
17. A personal perspective of the alpern-schneider characterization of safety and liveness
18. Safety, liveness and fairness in temporal logic
19. Automata on infinite objects