Parameterized verification of systems with global synchronization and guards

DOI10.1007/978-3-030-53288-8_15MaRDI QIDQ2225108zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 4 February 2021

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/2004.04896

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Abstract: Inspired by distributed applications that use consensus or other agreement protocols for global coordination, we define a new computational model for parameterized systems that is based on a general global synchronization primitive and allows for global transition guards. Our model generalizes many existing models in the literature, including broadcast protocols and guarded protocols. We show that reachability properties are decidable for systems without guards, and give sufficient conditions under which they remain decidable in the presence of guards. Furthermore, we investigate cutoffs for reachability properties and provide sufficient conditions for small cutoffs in a number of cases that are inspired by our target applications.

Recommendations

• Parameterized model checking of networks of timed automata with Boolean guards
• scientific article; zbMATH DE number 2102701
• Handling Parameterized Systems with Non-atomic Global Conditions
• Parameterized Verification of Infinite-State Processes with Global Conditions
• Analyzing guarded protocols: better cutoffs, more systems, more expressivity

Cited in

(9)

• Approximated parameterized verification of infinite-state processes with global conditions
• Parameterized model checking of networks of timed automata with Boolean guards
• Tight cutoffs for guarded protocols with fairness
• Analyzing guarded protocols: better cutoffs, more systems, more expressivity
• scientific article; zbMATH DE number 5175527 (Why is no real title available?)
• Parameterized Verification of Infinite-State Processes with Global Conditions
• Synthesis of distributed agreement-based systems with efficiently-decidable verification
• Symbolic reachability analysis and maximally permissive entrance control for globally synchronized templates
• Automatic WSTS-based repair and deadlock detection of parameterized systems

This page was built for publication: Parameterized verification of systems with global synchronization and guards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2225108)