Parametric temporal logic for “model measuring”
ACM Transactions on Computational Logic (TOCL)
Decidable verification for reducible timed automata specified in a first order logic with time
Theoretical Computer Science
Decidable First-Order Transition Logics for PA-Processes
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Durations, Parametric Model-Checking in Timed Automata with Presburger Arithmetic
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
On Model Checking Durational Kripke Structures
FoSSaCS '02 Proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures
Parametric Optimization of Open Real-Time Systems
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
On the expressivity and complexity of quantitative branching-time temporal logics
Theoretical Computer Science - Latin American theoretical informatics
Reachability solution characterization of parametric real-time systems
Theoretical Computer Science - Implementation and application of automata
The open family of temporal logics: Annotating temporal operators with input constraints
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Decidable first-order transition logics for PA-processes
Information and Computation
Efficient timed model checking for discrete-time systems
Theoretical Computer Science
Robust parametric reachability for timed automata
Information Processing Letters
Durations and parametric model-checking in timed automata
ACM Transactions on Computational Logic (TOCL)
Simulation-based verification using Temporally Attributed Boolean Logic
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Decision problems for lower/upper bound parametric timed automata
Formal Methods in System Design
Finding Extremal Models of Discrete Duration Calculus formulae using Symbolic Search
Electronic Notes in Theoretical Computer Science (ENTCS)
Decidable first-order transition logics for PA-processes
Information and Computation
Timing parameter characterization of real-time systems
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Bounded Parametric Verification for Distributed Time Petri Nets with Discrete-Time Semantics
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Bounded parametric model checking for elementary net systems
Transactions on Petri nets and other models of concurrency IV
SAT-based (parametric) reachability for a class of distributed time Petri nets
Transactions on Petri nets and other models of concurrency IV
Parametric model checking with verICS
Transactions on Petri nets and other models of concurrency IV
Parametric metric interval temporal logic
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Decision problems for lower/upper bound parametric timed automata
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Temporal Logics for Phylogenetic Analysis via Model Checking
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
| Hi-index | 0.00 |
We define Parameterized Real-Time Computation Tree Logic (PRTCTL), which allows quantitative temporal specifications to be parameterized over the natural numbers. Parameterized quantitative specifications are quantitative specifications in which concrete timing information has been abstracted away. Such abstraction allows designers to specify quantitative restrictions on the temporal ordering of events without having to use specific timing information from the model. A model checking algorithm for the logic is given which is polynomial for any fixed number of parameters. A subclass of formulae are identified for which the model checking problem is linear in the length of the formula and size of the structure. PRTCTL is generalized to allow quantitative reasoning about the number of occurrences of atomic events.