Solving Coverability Problem for Monotonic Counter Systems by Supercompilation

DOI10.1007/978-3-642-29709-0_18zbMath1336.68036OpenAlexW119944932MaRDI QIDQ3457979

A. V. Klimov

Publication date: 7 December 2015

Published in: Perspectives of Systems Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29709-0_18

zbMATH Keywords

verificationreachabilitysupercompilationwell-structured transition systemscoverabilitycounter systems

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)

Related Items (1)

Ping-pong protocols as prefix grammars: modelling and verification via program transformation

This page was built for publication: Solving Coverability Problem for Monotonic Counter Systems by Supercompilation