# Parameterized Model-Checking of Timed Systems with Conjunctive Guards

@inproceedings{Spalazzi2014ParameterizedMO,
title={Parameterized Model-Checking of Timed Systems with Conjunctive Guards},
author={Luca Spalazzi and Francesco Spegni},
booktitle={VSTTE},
year={2014}
}
• Published in VSTTE 17 July 2014
• Computer Science
In this work we extend the Emerson and Kahlon's cutoff theorems for process skeletons with conjunctive guards to Parameterized Networks of Timed Automata, i.e. systems obtained by an \emph{apriori} unknown number of Timed Automata instantiated from a finite set $U_1, \dots, U_n$ of Timed Automata templates. In this way we aim at giving a tool to universally verify software systems where an unknown number of software components (i.e. processes) interact with continuous time temporal constraints…
10 Citations
On the Existence of Cutoffs for Model Checking Disjunctive Timed Networks
• Computer Science
ICTCS/CILC
• 2017
This work studies the possibility of finding an upper bound to the size of the system, known as cutoff, ensuring that adding more participants does not change the set of satisfiable formulae, implying that the parameterized model checking problem is decidable.
Liveness of Parameterized Timed Networks
• Computer Science
ICALP
• 2015
The decidability proof makes use of automata theory, rational linear programming, and geometric reasoning for solving certain reachability questions in vector addition systems; it is believed these proof techniques will be useful in solving related problems.
Parameterized model checking of rendezvous systems
• Computer Science
Distributed Computing
• 2017
This work considers the theoretical power and limitations of the parameterized model checking technique on concurrent systems in which processes communicate via pairwise rendezvous, as well as the special cases of disjunctive guards and token passing.
Promptness and Bounded Fairness in Concurrent and Parameterized Systems
• Computer Science, Mathematics
VMCAI
• 2020
It is proved the first cutoff results for different classes of systems with a parametric number of components and quantitative specifications, thereby identifying previously unknown decidable fragments of the parameterized model checking problem.
Accuracy of Message Counting Abstraction in Fault-Tolerant Distributed Algorithms
• Computer Science
VMCAI
• 2017
This paper considers abstractions suitable for many fault-tolerant distributed algorithms that count messages for comparison against thresholds, e.g., the size of a majority of processes, and proves this abstraction useful for model checking: it preserves ATCTL properties, as the abstract and the concrete models simulate each other.
High-Performance Computing for Formal Security Assessment
• Computer Science
2019 International Conference on High Performance Computing & Simulation (HPCS)
• 2019
This work introduces the tool SecMC which drives the user in the task of modeling the system under analysis and the required security policies, together with the parameters that affect them, and shows how the tool can be used in order to formally assess security of probabilistic systems known from the literature.
Quantitative Evaluation of Systems
• Computer Science, Mathematics
Lecture Notes in Computer Science
• 2017
It is shown that every unary stochastic context-free grammar with polynomially-bounded ambiguity has an equivalent Stochastic rightlinear context- free grammar.
Parametric and probabilistic model checking of confidentiality in data dispersal algorithms
• Computer Science
2016 International Conference on High Performance Computing & Simulation (HPCS)
• 2016
This work presents a unified framework for verifying confidentiality of dispersal algorithms against probabilistic models of intruders, and suggests that disperseal algorithms ensure a high degree of confidentiality against the slice intruder, no matter the number of storage providers in the system.
A Probabilistic Small Model Theorem to Assess Confidentiality of Dispersed Cloud Storage
• Computer Science
QEST
• 2017
Recent developments in cloud architectures have originated new models of online storage clouds based on data dispersal algorithms. According to these algorithms the data is divided into several

## References

SHOWING 1-10 OF 40 REFERENCES
Verifying Networks of Timed Processes (Extended Abstract)
• Computer Science
TACAS
• 1998
This work presents the first decidability result concerning verification of systems that are infinite-state in “two dimensions”: they contain an arbitrary set of (identical) processes, and they use infinite data-structures, viz. real-valued clocks.
MCMT in the Land of Parameterized Timed Automata
This paper explains how to deal with fully parametric reachability problems for timed networks by translation into the declarative input language of MCMT, a model checker for infinite state systems based on Satisfiability Modulo Theories techniques.
MCMT in the Land of Parametrized Timed Automata
• Computer Science, Mathematics
VERIFY@IJCAR
• 2010
This paper explains how to deal with fully parametric reachability problems for timed networks by translation into the declarative input language of MCMT, a model checker for infinite state systems based on Satisfiability Modulo Theories techniques.
Reducing Model Checking of the Many to the Few
• Computer Science
• 2000
Decidability of PMCP is established as it is only necessary to model check a finite number of relatively small systems, and efficient decidability can be obtained in some cases.
Parameterized Model Checking of Token-Passing Systems
• Mathematics
VMCAI
• 2014
The parameterized model checking problem for token-passing systems and specifications in indexed CTL i?ź\X is revisited and it is shown that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.
On model checking for non-deterministic infinite-state systems
• Computer Science, Mathematics
Proceedings. Thirteenth Annual IEEE Symposium on Logic in Computer Science (Cat. No.98CB36226)
• 1998
It is demonstrated that many known algorithms for model checking infinite-state systems can be derived uniformly from a reachability procedure that generates a "covering graph", a generalization of the Karp-Miller graph for Petri Nets, indicating that the covering graph construction is appropriate for the analysis of infinite state systems.
A Small Model Theorem for Rectangular Hybrid Automata Networks
• Computer Science, Mathematics
FMOODS/FORTE
• 2012
A small model result is presented for networks with arbitrarily many interacting RHAs that reduces the verification problem for a system with arbitrarily number of processes to a systems with finitely many processes.
Reasoning about systems with many processes
• Computer Science
JACM
• 1992
Methods are given for automatically verifying temporal properties of concurrent systems containing an arbitrary number of finite-state processes that communicate using CCS actions and how these decision procedures can be used to reason about certain systems with a communication network.