Handbook of theoretical computer science (vol. B)
The temporal logic of reactive and concurrent systems
The temporal logic of reactive and concurrent systems
ACM Transactions on Computational Logic (TOCL)
On the temporal analysis of fairness
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
The complexity of propositional linear temporal logics in simple cases
Information and Computation
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers
From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata
FORTE '02 Proceedings of the 22nd IFIP WG 6.1 International Conference Houston on Formal Techniques for Networked and Distributed Systems
Decidability and Complexity of Petri Net Problems - An Introduction
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Improved Automata Generation for Linear Temporal Logic
CAV '99 Proceedings of the 11th International Conference on Computer Aided Verification
Petri Nets, Situations, and Automata
ICATPN '02 Proceedings of the 23rd International Conference on Applications and Theory of Petri Nets
A Simplified Clausal Resolution Procedure for Propositional Linear-Time Temporal Logic
TABLEAUX '02 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Is There a Future for Deductive Temporal Verification?
TIME '06 Proceedings of the Thirteenth International Symposium on Temporal Representation and Reasoning
First-Order Temporal Verification in Practice
Journal of Automated Reasoning
Propositional Satisfiability and Constraint Programming: A comparative survey
ACM Computing Surveys (CSUR)
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Symbolic systems, explicit properties: on hybrid approaches for LTL symbolic model checking
CAV'05 Proceedings of the 17th international conference on Computer Aided Verification
Taming past LTL and flat counter systems
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Often when modelling systems, physical constraints on the resources available are needed. For example, we might say that at most Nprocesses can access a particular resource at any moment or exactly Mparticipants are needed for an agreement. Such situations are concisely modelled where propositions are constrained such that at most N, or exactly M, can hold at any moment in time. This paper describes both the logical basis and a verification method for propositional linear time temporal logics which allow such constraints as input. The method incorporates ideas developed earlier for a resolution method for the temporal logic TLX and a tableaux-like procedure for PTL. The complexity of this procedure is discussed and case studies are examined. The logic itself represents a combination of standard temporal logic with classical constraints restricting the numbers of propositions that can be satisfied at any moment in time.