Cut-off theorems for the \textit{PV}-model

DOI10.1007/s10703-022-00393-9zbMath1522.68150arXiv1807.03144OpenAlexW4289761325WikidataQ113902534 ScholiaQ113902534MaRDI QIDQ6108429

Lisbeth Fajstrup

Publication date: 29 June 2023

Published in: Formal Methods in System Design (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Deadlocks and dihomotopy in mutual exclusion models
• Simplicial models of trace spaces
• An improvement of McMillan's unfolding algorithm
• Parameterized compositional model checking
• Symmetry reduction for the local mu-calculus
• Algebraic topology and concurrency
• Directed algebraic topology and concurrency. With a foreword by Maurice Herlihy and a preface by Samuel Mimram
• Dipaths and dihomotopies in a cubical complex
• Local Symmetry and Compositional Verification
• Trace Spaces: An Efficient New Technique for State-Space Reduction
• The geometry of semaphore programs
• The serializability of concurrent database updates
• A fast algorithm for testing for safety and detecting deadlocks in locked transaction systems
• Reasoning about systems with many processes
• On the classification of dipaths in geometric models for concurrency
• Loops, ditopology and deadlocks
• Higher dimensional automata revisited

This page was built for publication: Cut-off theorems for the \textit{PV}-model