The complexity of propositional linear temporal logics
Journal of the ACM (JACM)
Improved upper and lower bounds for modal logics of programs
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
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
Proving Liveness Properties of Concurrent Programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Synthesis of Communicating Processes from Temporal Logic Specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
POPL '83 Proceedings of the 10th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
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
The temporal logic of branching time
POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Process logic: preliminary report
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Characterizing Correctness Properties of Parallel Programs Using Fixpoints
Proceedings of the 7th Colloquium on Automata, Languages and Programming
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Yet Another Process Logic (Preliminary Version)
Proceedings of the Carnegie Mellon Workshop on Logic of Programs
Automata, Tableaux and Temporal Logics (Extended Abstract)
Proceedings of the Conference on Logic of Programs
Decision procedures and expressiveness in the temporal logic of branching time
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
"Sometimes" and "Not Never" Revisited: on Branching Versus Linear Time
"Sometimes" and "Not Never" Revisited: on Branching Versus Linear Time
Decidability and expressiveness of logics of processes
Decidability and expressiveness of logics of processes
Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Reasoning about networks with many identical finite-state processes
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
The complexity of reasoning about knowledge and time
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Interleaving set temporal logic
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A predicate transformer approach to semantics of parallel programs
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
On the synthesis of a reactive module
POPL '89 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
State-based model checking of event-driven system requirements
SIGSOFT '91 Proceedings of the conference on Software for citical systems
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
A branching time logic with past operators
Journal of Computer and System Sciences
Duplication, insertion and lossiness errors in unreliable communication channels
SIGSOFT '94 Proceedings of the 2nd ACM SIGSOFT symposium on Foundations of software engineering
Three logics for branching bisimulation
Journal of the ACM (JACM)
Compositional verification by model checking for counter-examples
ISSTA '96 Proceedings of the 1996 ACM SIGSOFT international symposium on Software testing and analysis
Branching time and abstraction in bisimulation semantics
Journal of the ACM (JACM)
Strategic directions in concurrency research
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Abstract interpretation of reactive systems
ACM Transactions on Programming Languages and Systems (TOPLAS)
A Formal Verification Environment for Railway Signaling System Design
Formal Methods in System Design - Special issue: industrial critical systems
Formal verification in hardware design: a survey
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Temporal abstract interpretation
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
An automata-theoretic approach to branching-time model checking
Journal of the ACM (JACM)
Formal specification: a roadmap
Proceedings of the Conference on The Future of Software Engineering
An automata-theoretic approach to modular model checking
ACM Transactions on Programming Languages and Systems (TOPLAS)
Temporal logics for real-time system specification
ACM Computing Surveys (CSUR)
An Interval Logic for Real-Time System Specification
IEEE Transactions on Software Engineering
Efficient Detection of Vacuity in Temporal Model Checking
Formal Methods in System Design - Special issue on CAV '97
Formal reasoning about actor programs using temporal logic
Concurrent object-oriented programming and petri nets
An infinite hierarchy of temporal logics over branching time
Information and Computation
Model checking multi-agent systems with MABLE
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Alternating-time temporal logic
Journal of the ACM (JACM)
Annals of Mathematics and Artificial Intelligence
Multi-Dimensional Modal Logic as a Framework for Spatio-Temporal Reasoning
Applied Intelligence
Linear, Branching Time and Joint ClosureSemantics for Temporal Logic
Journal of Logic, Language and Information
Another Look at LTL Model Checking
Formal Methods in System Design
On the Relationship Between BDI Logics and Standard Logics of Concurrency
Autonomous Agents and Multi-Agent Systems
Deciding Properties of Timed Transition Models
IEEE Transactions on Parallel and Distributed Systems
Declarative Representations of Multiagent Systems
IEEE Transactions on Knowledge and Data Engineering
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Improving Automata Generation for Linear Temporal Logic by Considering the Automaton Hierarchy
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Why so Many Temporal Logics Climb up the Trees?
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Faster Model Checking for Open Systems
ASIAN '99 Proceedings of the 5th Asian Computing Science Conference on Advances in Computing Science
Model Checking: A Tutorial Overview
MOVEP '00 Proceedings of the 4th Summer School on Modeling and Verification of Parallel Processes
Branching vs. Linear Time: Final Showdown
TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Fate and Free Will in Error Traces
TACAS '02 Proceedings of the 8th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
A HOL Conversion for Translating Linear Time Temporal Logic to omega-Automata
TPHOLs '99 Proceedings of the 12th International Conference on Theorem Proving in Higher Order Logics
Weak Muller Acceptance Conditions for Tree Automata
VMCAI '02 Revised Papers from the Third International Workshop on Verification, Model Checking, and Abstract Interpretation
Expressive Power of Temporal Logics
CONCUR '02 Proceedings of the 13th International Conference on Concurrency Theory
From Asymmetry to Full Symmetry: New Techniques for Symmetry Reduction in Model Checking
CHARME '99 Proceedings of the 10th IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
Alternating-Time Temporal Logic
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
Probabilistic Temporal Logics via the Modal Mu-Calculus
FoSSaCS '99 Proceedings of the Second International Conference on Foundations of Software Science and Computation Structure, Held as Part of the European Joint Conferences on the Theory and Practice of Software, ETAPS'99
Model Checking CTL+ and FCTL is Hard
FoSSaCS '01 Proceedings of the 4th International Conference on Foundations of Software Science and Computation Structures
Model Checking: Theory into Practice
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
A Symbolic Model Checker for ACTL
FM-Trends 98 Proceedings of the International Workshop on Current Trends in Applied Formal Method: Applied Formal Methods
Linking Theorem Proving and Model-Checking with Well-Founded Bisimulation
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
An Approximation Semantics for the Propositional Mu-Calculus
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Towards categorical models for fairness: fully abstract presheaf semantics of SCCS with finite delay
Theoretical Computer Science - Category theory and computer science
Model checking: a tutorial overview
Modeling and verification of parallel processes
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Handbook of automated reasoning
Qualitative spatiotemporal representation and reasoning: a computational perspective
Exploring artificial intelligence in the new millennium
Relating word and tree automata
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
LICS '00 Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science
An Abstraction Algorithm for the Verification of Level-Sensitive Latch-Based Netlists
Formal Methods in System Design
Feature specification and automated conflict detection
ACM Transactions on Software Engineering and Methodology (TOSEM)
A logical model of social commitment for agent communication
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
On temporal logic versus datalog
Theoretical Computer Science - Logic and complexity in computer science
A lattice-theoretic characterization of safety and liveness
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Counting on CTL: on the expressive power of monadic path logic
Information and Computation
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
Future temporal logic needs infinitely many modalities
Information and Computation
Mathematical modal logic: a view of its evolution
Journal of Applied Logic
The dMARS Architecture: A Specification of the Distributed Multi-Agent Reasoning System
Autonomous Agents and Multi-Agent Systems
A model-checking verification environment for mobile processes
ACM Transactions on Software Engineering and Methodology (TOSEM)
A unifying semantics for time and events
Artificial Intelligence - Special issue on logical formalizations and commonsense reasoning
An optimizing compiler for batches of temporal logic formulas
ISSTA '04 Proceedings of the 2004 ACM SIGSOFT international symposium on Software testing and analysis
A note on knowledge-based programs and specifications
Distributed Computing
The finite and the infinite in temporal logic
ACM SIGACT News
From linear time to branching time
ACM Transactions on Computational Logic (TOCL)
Verification of distributed programs using representative interleaving sequences
Distributed Computing
Distributed Computing - Special issue: Verification of lazy caching
A hierarchy of failures-based models: theory and application
Theoretical Computer Science - Expressiveness in concurrency
The relative completeness of a version of CTL
CATS '05 Proceedings of the 2005 Australasian symposium on Theory of computing - Volume 41
IEEE Transactions on Software Engineering
A decidable class of problems for control under partial observation
Information Processing Letters
Information and Computation
A new modality for almost everywhere properties in timed automata
CONCUR 2005 - Concurrency Theory
On relating functional specifications to architectural specifications: a case study
Science of Computer Programming
Dual Flow Nets: Modeling the control/data-flow relation in embedded systems
ACM Transactions on Embedded Computing Systems (TECS)
A clausal resolution method for branching-time logic ECTL+
Annals of Mathematics and Artificial Intelligence
On the universal and existential fragments of the μ-calculus
Theoretical Computer Science - Tools and algorithms for the construction and analysis of systems (TACAS 2003)
Imcompleteness of States w.r.t traces in model Checking
Information and Computation
Probabilistic temporal logics via the modal mu-calculus
Theoretical Computer Science
BTL2 and the expressive power of ECTL+
Information and Computation
Characterizing EF and EX tree logics
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Feature interaction detection by pairwise analysis of LTL properties: a case study
Formal Methods in System Design
Combining symmetry reduction and under-approximation for symbolic model checking
Formal Methods in System Design
A compositional approach to CTL* verification
Theoretical Computer Science - Formal methods for components and objects
Information and Computation - Special issue: Combining logical systems
Weak Muller acceptance conditions for tree automata
Theoretical Computer Science
On the freeze quantifier in Constraint LTL: Decidability and complexity
Information and Computation
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Complexity results on branching-time pushdown model checking
Theoretical Computer Science
Symbolic model checking of institutions
Proceedings of the ninth international conference on Electronic commerce
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Agents, beliefs, and plausible behavior in a temporal setting
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A grounded specification language for agent programs
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Fundamenta Informaticae - This is a SPECIAL ISSUE ON ASM'05
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Arity hierarchy for temporal logics
Theoretical Computer Science
Reliable Group Communication and Institutional Action in a Multi-agent Trading Scenario
Agent Communication II
A Temporal Dynamic Logic for Verifying Hybrid System Invariants
LFCS '07 Proceedings of the international symposium on Logical Foundations of Computer Science
Our Quest for the Holy Grail of Agent Verification
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
25 Years of Model Checking
The Beginning of Model Checking: A Personal Perspective
25 Years of Model Checking
25 Years of Model Checking
A Model Checking Language for Concurrent Value-Passing Systems
FM '08 Proceedings of the 15th international symposium on Formal Methods
Correcting a Space-Efficient Simulation Algorithm
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Verification of Linear Duration Invariants by Model Checking CTL Properties
Proceedings of the 5th international colloquium on Theoretical Aspects of Computing
Formal specification and validation of multi-agent behaviour using TLA+ and TLC model checker
International Journal of Artificial Intelligence and Soft Computing
From Philosophical to Industrial Logics
ICLA '09 Proceedings of the 3rd Indian Conference on Logic and Its Applications
Verification of Choreographies During Execution Using the Reactive Event Calculus
Web Services and Formal Methods
Open paper: caT: adapting and updating the trellis hypertext model
The New Review of Hypermedia and Multimedia
Verification Techniques for System-Level Design
Verification Techniques for System-Level Design
Applied Assertion-Based Verification: An Industry Perspective
Foundations and Trends in Electronic Design Automation
Model checking: algorithmic verification and debugging
Communications of the ACM - Scratch Programming for All
Branching-Time Logics Repeatedly Referring to States
Journal of Logic, Language and Information
Easy Yet Hard: Model Checking Strategies of Agents
Computational Logic in Multi-Agent Systems
Computable CTL* for Discrete-Time and Continuous-Space Dynamic Systems
RP '09 Proceedings of the 3rd International Workshop on Reachability Problems
Modeling time in computing: A taxonomy and a comparative survey
ACM Computing Surveys (CSUR)
FM '09 Proceedings of the 2nd World Congress on Formal Methods
AI '09 Proceedings of the 22nd Australasian Joint Conference on Advances in Artificial Intelligence
Bounded Semantics of CTL and SAT-Based Verification
ICFEM '09 Proceedings of the 11th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Modeling Web Applications by the Multiple Levels of Integrity Policy
Electronic Notes in Theoretical Computer Science (ENTCS)
Information and Computation
Incompleteness of states w.r.t. traces in model checking
Information and Computation
A decidable class of problems for control under partial observation
Information Processing Letters
Automated verification of security pattern compositions
Information and Software Technology
Automatic verification of sequential infinite-state processes
Automatic verification of sequential infinite-state processes
A new logical semantics for agent communication
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
CTL+ is complete for double exponential time
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Oracle circuits for branching-time model checking
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Model-checking one-clock priced timed automata
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
On simulations and bisimulations of general flow systems
HSCC'07 Proceedings of the 10th international conference on Hybrid systems: computation and control
On the universal and existential fragments of the µ-calculus
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
Formal Methods in System Design
Time and alternation: an automata based framework to software model checking
Proceedings of the 2010 ACM Symposium on Applied Computing
On the expressive power of QLTL
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
Model checking norms and sanctions in institutions
COIN'07 Proceedings of the 2007 international conference on Coordination, organizations, institutions, and norms in agent systems III
The complexity of CTL* + linear past
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
A Solver for Modal Fixpoint Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
Pillars of computer science
On the complexity of branching-time logics
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Generic Infinite Traces and Path-Based Coalgebraic Temporal Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
The Situation Calculus: A Case for Modal Logic
Journal of Logic, Language and Information
Journal of Logic, Language and Information
A CTL-based logic for program abstractions
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Graded computation tree logic with binary coding
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Journal of Computer Security - 7th International Workshop on Issues in the Theory of Security (WITS'07)
Reasoning about nondeterministic and concurrent actions: a process algebra approach
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Formal verification of UML state diagrams: a petri net based approach
ACM SIGSOFT Software Engineering Notes
InstQL: a query language for virtual institutions using answer set programming
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Extended computation tree logic
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Clausal graph tableaux for hybrid logic with eventualities and difference
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Relentful strategic reasoning in alternating-time temporal logic
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Comparison of model checking tools for information systems
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Finite identification from the viewpoint of epistemic update
Information and Computation
Revisiting synthesis of GR(1) specifications
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
Annals of Mathematics and Artificial Intelligence
A self-updating model for analysing system reconfigurability
Engineering Applications of Artificial Intelligence
Differential dynamic logics: automated theorem proving for hybrid systems
Differential dynamic logics: automated theorem proving for hybrid systems
dCTL: a branching time temporal logic for fault-tolerant system verification
SEFM'11 Proceedings of the 9th international conference on Software engineering and formal methods
Abstraction and refinement in model checking
FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Branching-time temporal logic extended with qualitative presburger constraints
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
An abstract interpretation perspective on linear vs. branching time
APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Analysing robot swarm behaviour via probabilistic model checking
Robotics and Autonomous Systems
Trust in LORA: towards a formal definition of trust in BDI agents
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Model checking linear duration invariants of networks of automata
FSEN'09 Proceedings of the Third IPM international conference on Fundamentals of Software Engineering
Deciding full branching time logic by program transformation
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Dealing with time in content language expressions
AC'04 Proceedings of the 2004 international conference on Agent Communication
The complexity of model checking higher order fixpoint logic
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Reasoning about time in a BDI architecture
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
Complexity results on branching-time pushdown model checking
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
Journal of Computer and System Sciences
Achieving fault tolerance by a formally validated interaction policy
Rigorous Development of Complex Fault-Tolerant Systems
Concurrency, Compositionality, and Correctness
Verifiable semantic model for agent interactions using social commitments
LADS'09 Proceedings of the Second international conference on Languages, Methodologies, and Development Tools for Multi-Agent Systems
Terminating tableaux for hybrid logic with eventualities
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
A decision procedure for CTL* based on tableaux and automata
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Verification of gap-order constraint abstractions of counter systems
VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
On the automatic verification of non-standard measures of consistency
IWFM'03 Proceedings of the 6th international conference on Formal Methods
DALT'11 Proceedings of the 9th international conference on Declarative Agent Languages and Technologies
Branching-time logic programming: the language Cactus and its applications
Computer Languages
ACM Transactions on Computational Logic (TOCL)
Formal verification and testing of protocols
Computer Communications
Survey: Linear Temporal Logic Symbolic Model Checking
Computer Science Review
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
Specification and verification of multi-agent systems
ESSLLI'10 Proceedings of the 2010 conference on ESSLLI 2010, and ESSLLI 2011 conference on Lectures on Logic and Computation
Abstraction for model checking modular interpreted systems over ATL
ProMAS'11 Proceedings of the 9th international conference on Programming Multi-Agent Systems
A verified implementation of priority monitors in java
FoVeOOS'11 Proceedings of the 2011 international conference on Formal Verification of Object-Oriented Software
Some Varieties of Finite Tree Automata Related to Restricted Temporal Logics
Fundamenta Informaticae
Expressing and Verifying Temporal and Structural Properties of Mobile Agents
Fundamenta Informaticae - SPECIAL ISSUE ON CONCURRENCY SPECIFICATION AND PROGRAMMING (CS&P 2005) Ruciane-Nide, Poland, 28-30 September 2005
Verifying conformance of multi-agent commitment-based protocols
Expert Systems with Applications: An International Journal
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Fundamenta Informaticae
Defining BDI with Abstract Languages
Fundamenta Informaticae
A propositional probabilistic logic with discrete linear time for reasoning about evidence
Annals of Mathematics and Artificial Intelligence
Quantified CTL: expressiveness and model checking
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
What makes ATL* decidable? a decidable fragment of strategy logic
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Pushdown module checking with imperfect information
Information and Computation
Reasoning about nondeterminism in programs
Proceedings of the 34th ACM SIGPLAN conference on Programming language design and implementation
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
Formalizing and reasoning about quality
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II
A resolution calculus for the branching-time temporal logic CTL
ACM Transactions on Computational Logic (TOCL)
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Branching-time logics with path relativisation
Journal of Computer and System Sciences
Verification of gap-order constraint abstractions of counter systems
Theoretical Computer Science
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
On the Boundary of Behavioral Strategies
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
A Goal-Directed Decision Procedure for Hybrid PDL
Journal of Automated Reasoning
| Hi-index | 0.01 |
The differences between and appropriateness of branching versus linear time temporal logic for reasoning about concurrent programs are studied. These issues have been previously considered by Lamport. To facilitate a careful examination of these issues, a language, CTL*, in which a universal or existential path quantifier can prefix an arbitrary linear time assertion, is defined. The expressive power of a number of sublanguages is then compared. CTL* is also related to the logics MPL of Abrahamson and PL of Harel, Kozen, and Parikh. The paper concludes with a comparison of the utility of branching and linear time temporal logics.