A modal characterization of observational congruence on finite terms of CCS
Information and Control
An automata theoretic decision procedure for the propositional mu-calculus
Information and Computation
On simultaneously determinizing and complementing &ohgr;-automata
Proceedings of the Fourth Annual Symposium on Logic in computer science
Specifying real-time properties with metric temporal logic
Real-Time Systems
Local model checking in the modal mu-calculus
TAPSOFT '89 2nd international joint conference on Theory and practice of software development
Techniques for automatic verification of real-time systems
Techniques for automatic verification of real-time systems
Journal of the ACM (JACM)
Model-checking in dense real-time
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Real-time logics: complexity and expressiveness
Information and Computation - Special issue: selections from 1990 IEEE symposium on logic in computer science
Theoretical Computer Science
Characteristic formulae for processes with divergence
Information and Computation
Symbolic model checking for real-time systems
Information and Computation
Symbolic approximations for verifying real-time systems
Symbolic approximations for verifying real-time systems
The benefits of relaxing punctuality
Journal of the ACM (JACM)
Theoretical Computer Science
Event-clock automata: a determinizable class of timed automata
Theoretical Computer Science
The logic of event clocks: decidability, complexity and expressiveness
Automatica (Journal of IFAC)
From Timed Automata to Logic - and Back
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
Model Checking of Real-Time Reachability Properties Using Abstractions
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
A Logical Characterisation of Event Recording Automata
FTRTFT '00 Proceedings of the 6th International Symposium on Formal Techniques in Real-Time and Fault-Tolerant Systems
Quantitative Temporal Reasoning
CAV '90 Proceedings of the 2nd International Workshop on Computer Aided Verification
Model-Checking for Real-Time Systems
FCT '95 Proceedings of the 10th International Symposium on Fundamentals of Computation Theory
The complexity of tree automata and logics of programs
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
We show decidability of the satisfiability problem for an extension of the modal 碌-calculus with event-recording clocks. Based on techniques for deciding the untimed 碌-calculus, we present a complete set of reduction rules for constructing tableaux for formulas of this eventrecording logic. To keep track of the actual value of the clocks, the premises and conclusions of our tableau rules are augmented with timing contexts, which are sets of timing constraints satisfied by the actual value of the clocks. The decidability problem is shown to be EXPTIME complete. In addition, we address the problem of model synthesis, that is, given a formula 驴, we construct an event-recording automaton that satisfies 驴.