Abstracting and Counting Synchronizing Processes

DOI10.1007/978-3-662-46081-8_13zbMath1432.68305OpenAlexW1604731269MaRDI QIDQ5172645

Petru Eles, Zebo Peng, Zeinab Ganjei, Ahmed Rezine

Publication date: 4 February 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-111739

zbMATH Keywords

predicate abstractionmultithreaded programsdeadlock freedomparameterized verificationbarrier synchronizationconstrained monotonic abstractioncounter abstractioncounting logic

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) 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)

Reachability in Parameterized Systems: All Flavors of Threshold Automata

This page was built for publication: Abstracting and Counting Synchronizing Processes