Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Decision procedures and expressiveness in the temporal logic of branching time
Journal of Computer and System Sciences
The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Communicating sequential processes
Communicating sequential processes
“Sometimes” and “not never” revisited: on branching versus linear time temporal logic
Journal of the ACM (JACM) - The MIT Press scientific computation series
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The complementation problem for Bu¨chi automata with applications to temporal logic
Theoretical Computer Science
Characterizing finite Kripke structures in propositional temporal logic
Theoretical Computer Science - International Joint Conference on Theory and Practice of Software Development, P
POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the Fourth Annual Symposium on Logic in computer science
Modular verification of Petri Nets: the temporal logic approach
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Verifying the correctness of AADL modules using model checking
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
On the development of reactive systems
Logics and models of concurrent systems
The existence of refinement mappings
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Handbook of theoretical computer science (vol. B)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Handbook of logic in computer science (vol. 2)
Memory-efficient algorithms for the verification of temporal properties
Formal Methods in System Design - Special issue on computer-aided verification: general methods
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about infinite computations
Information and Computation
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Testing language containment for &ohgr;-automata using BDDs
Information and Computation
Efficient generation of counterexamples and witnesses in symbolic model checking
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
High-density reachability analysis
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
IEEE Spectrum
An automata-theoretic approach to linear temporal logic
Proceedings of the VIII Banff Higher order workshop conference on Logics for concurrency : structure versus automata: structure versus automata
IEEE Transactions on Software Engineering - Special issue on formal methods in software practice
IBM Journal of Research and Development - Special issue: IBM S/390 G3 and G4
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Modalities for model checking (extended abstract): branching time strikes back
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Model checking
An automata-theoretic approach to modular model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Specifying Concurrent Program Modules
ACM Transactions on Programming Languages and Systems (TOPLAS)
Symbolic Model Checking
Communication and Concurrency
Formal Equivalence Checking and Design DeBugging
Formal Equivalence Checking and Design DeBugging
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
"Sometime" is sometimes "not never": on the temporal logic of programs
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Timing Diagrams: Formalization and Algorithmic Verification
Journal of Logic, Language and Information
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
What Do Message Sequence Charts Mean?
FORTE '93 Proceedings of the IFIP TC6/WG6.1 Sixth International Conference on Formal Description Techniques, VI
On the Synthesis of an Asynchronous Reactive Module
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Bisimulation Minimization in an Automata-Theoretic Verification Framework
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
Linear and Branching Structures in the Semantics and Logics of Reactive Systems
Proceedings of the 12th Colloquium on Automata, Languages and Programming
Sometimes and Not Never Re-revisited: On Branching Versus Linear Time
CONCUR '98 Proceedings of the 9th International Conference on Concurrency Theory
Vacuity Detection in Temporal Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Hierarchical Development of Cncurrent Systems in a Temporal Logic Framework
Seminar on Concurrency, Carnegie-Mellon University
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
Temporal Logic with Fixed Points
Temporal Logic in Specification
Relating linear and branching model checking
PROCOMET '98 Proceedings of the IFIP TC2/WG2.2,2.3 International Conference on Programming Concepts and Methods
Specification and verification of concurrent systems in CESAR
Proceedings of the 5th Colloquium on International Symposium on Programming
On-the-Fly Model Checking of RCTL Formulas
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Verification of an Implementation of Tomasulo's Algorithm by Compositional Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Efficient Decision Procedures for Model Checking of Linear Time Logic Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Model Checking of Safety Properties
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Generation of Reduced Models for Checking Fragments of CTL
CAV '93 Proceedings of the 5th International Conference on Computer Aided Verification
Methodology and System for Practical Formal Verification of Reactive Hardware
CAV '94 Proceedings of the 6th International Conference on Computer Aided Verification
Selective Quantitative Analysis and Interval Model Checking: Verifying Different Facets of a System
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
VIS: A System for Verification and Synthesis
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
On Combining Formal and Informal Verification
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Strong Cyclic Planning Revisited
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Proceedings of the Conference on Logic of Programs
The anchored version of the temporal framework
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Expressibility results for linear-time and branching-time logics
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop
Verification Tools for Finite-State Concurrent Systems
A Decade of Concurrency, Reflections and Perspectives, REX School/Symposium
Freedom, Weakness, and Determinism: From Linear-Time to Branching-Time
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
Linear vs. Branching Time: A Complexity-Theoretic Perspective
LICS '98 Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science
The common fragment of CTL and LTL
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Real-time programming and asynchronous message passing
PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Weak Alternating Automata Are Not That Weak
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Proofs of Networks of Processes
IEEE Transactions on Software Engineering
The temporal logic of programs
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
An algebraic definition of simulation between programs
IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Tractable multiagent planning for epistemic goals
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
Verifying cross-cutting features as open systems
Proceedings of the 10th ACM SIGSOFT symposium on Foundations of software engineering
Verifying cross-cutting features as open systems
ACM SIGSOFT Software Engineering Notes
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Games, Probability, and the Quantitative µ-Calculus qMµ
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Model Checking Knowledge and Time
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
The Influence of Software Module Systems on Modular Verification
Proceedings of the 9th International SPIN Workshop on Model Checking of Software
The ForSpec Temporal Logic: A New Temporal Property-Specification Language
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Advanced techniques for RTL debugging
Proceedings of the 40th annual Design Automation Conference
Weak, strong, and strong cyclic planning via symbolic model checking
Artificial Intelligence - special issue on planning with uncertainty and incomplete information
Reasoning about partial goal satisfaction for requirements and design engineering
Proceedings of the 12th ACM SIGSOFT twelfth international symposium on Foundations of software engineering
Modular Verification of Open Features Using Three-Valued Model Checking
Automated Software Engineering
On the logic of cooperation and propositional control
Artificial Intelligence
Dual Flow Nets: Modeling the control/data-flow relation in embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
Imcompleteness of States w.r.t traces in model Checking
Information and Computation
Results on the quantitative μ-calculus qMμ
ACM Transactions on Computational Logic (TOCL)
A static compliance-checking framework for business process models
IBM Systems Journal
Declarative programming for verification: lessons and outlook
Proceedings of the 10th international ACM SIGPLAN conference on Principles and practice of declarative programming
The Beginning of Model Checking: A Personal Perspective
25 Years of Model Checking
25 Years of Model Checking
Assertion-Based Verification: Industry Myths to Realities (Invited Tutorial)
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Model-checking Timed Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Applied Assertion-Based Verification: An Industry Perspective
Foundations and Trends in Electronic Design Automation
Model checking temporal logics of knowledge in distributed systems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Computational Logic in Multi-Agent Systems
Automated verification: graphs, logic, and automata
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
On the logic of cooperation and propositional control
Artificial Intelligence
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
Adopting model checking techniques for clinical guidelines verification
Artificial Intelligence in Medicine
Incompleteness of states w.r.t. traces in model checking
Information and Computation
Automata-theoretic model checking revisited
VMCAI'07 Proceedings of the 8th international conference on Verification, model checking, and abstract interpretation
Model checking PSL using HOL and SMV
HVC'06 Proceedings of the 2nd international Haifa verification conference on Hardware and software, verification and testing
QBF-based symbolic model checking for knowledge and time
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Linear-time model checking: automata theory in practice
CIAA'07 Proceedings of the 12th international conference on Implementation and application of automata
Axiomatizing extended temporal logic fragments via instantiation
ICTAC'07 Proceedings of the 4th international conference on Theoretical aspects of computing
Branching vs. linear time: semantical perspective
ATVA'07 Proceedings of the 5th international conference on Automated technology for verification and analysis
PSL for runtime verification: theory and practice
RV'07 Proceedings of the 7th international conference on Runtime verification
Pillars of computer science
Authoring and verification of clinical guidelines: A model driven approach
Journal of Biomedical Informatics
Making prophecies with decision predicates
Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Business process compliance through reusable units of compliant processes
ICWE'10 Proceedings of the 10th international conference on Current trends in web engineering
On the formal specification of regulatory compliance: a comparative analysis
ICSOC'10 Proceedings of the 2010 international conference on Service-oriented computing
CSSL: a logic for specifying conditional scenarios
Proceedings of the 19th ACM SIGSOFT symposium and the 13th European conference on Foundations of software engineering
Size-change termination and satisfiability for linear-time temporal logics
FroCoS'11 Proceedings of the 8th international conference on Frontiers of combining systems
Ten years of analyzing actors: Rebeca experience
Formal modeling
An abstract interpretation perspective on linear vs. branching time
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Model checking temporal logics of knowledge and its application in security verification
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part I
Model checking for database theoreticians
ICDT'05 Proceedings of the 10th international conference on Database Theory
Bounded model checking for weak alternating büchi automata
CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Representational content and the reciprocal interplay of agent and environment
DALT'04 Proceedings of the Second international conference on Declarative Agent Languages and Technologies
Concurrency, Compositionality, and Correctness
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
Representation for reciprocal agent-environment interaction
Cognitive Systems Research
Hi-index | 0.02 |
The discussion of the relative merits of linear- versus branching-time frameworks goes back to early 1980s. One of the beliefs dominating this discussion has been that "while specifying is easier in LTL (linear-temporal logic), verification is easier for CTL (branching-temporal logic)". Indeed, the restricted syntax of CTL limits its expressive power and many important behaviors (e.g., strong fairness) can not be specified in CTL. On the other hand, while model checking for CTL can be done in time that is linear in the size of the specification, it takes time that is exponential in the specification for LTL. Because of these arguments, and for historical reasons, the dominant temporal specification language in industrial use is CTL.In this paper we argue that in spite of the phenomenal success of CTL-based model checking, CTL suffers from several fundamental limitations as a specification language, all stemming from the fact that CTL is a branching-time formalism: the language is unintuitive and hard to use, it does not lend itself to compositional reasoning, and it is fundamentally incompatible with semiformal verification. These inherent limitations severely impede the functionality of CTL-based model checkers. In contrast, the linear-time framework is expressive and intuitive, supports compositional reasoning and semi-formal verification, and is amenable to combining enumerative and symbolic search methods. While we argue in favor of the linear-time framework, we also we argue that LTL is not expressive enough, and discusswhat would be the "ultimate" temporal specification language.