Keywords
Computer scienceSatisfiabilityTemporal logicSynchronization (alternating current)Property (philosophy)Skeleton (computer programming)Branching (polymer chemistry)Model checkingProgramming languageLinear temporal logicAlgorithmTheoretical computer scienceBoolean satisfiability problem
Affiliated Institutions
Related Publications
Planning using a temporal world model
Current problem solving systems are constrained in their applicability by inadequate world models. We suggest a world model based on a temporal logic. This approach allows the p...
A really temporal logic
A real-time temporal logic for the specification of reactive systems is introduced. The novel feature of the logic, TPTL, is the adoption of temporal operators as quantifiers ov...
The temporal logic of programs
A unified approach to program verification is suggested, which applies to both sequential and parallel programs. The main proof method suggested is that of temporal reasoning in...
Automatic verification of finite-state concurrent systems using temporal logic specifications
We give an efficient procedure for verifying that a finite-state concurrent system meets a specification expressed in a (propositional, branching-time) temporal logic. Our algor...
Model-checking for real-time systems
This research extends CTL model-checking to the analysis of real-time systems, whose correctness depends on the magnitudes of the timing delays. For specifications, the syntax o...
Publication Info
- Year
- 1982
- Type
- article
- Volume
- 2
- Issue
- 3
- Pages
- 241-266
- Citations
- 659
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
659
OpenAlex
80
Influential
475
CrossRef
Cite This
E. Allen Emerson,
Edmund M. Clarke
(1982).
Using branching time temporal logic to synthesize synchronization skeletons.
Science of Computer Programming
, 2
(3)
, 241-266.
https://doi.org/10.1016/0167-6423(83)90017-5
Identifiers
- DOI
- 10.1016/0167-6423(83)90017-5