{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:05:16Z","timestamp":1760015116485},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2009,10]]},"abstract":"<jats:p> We introduce the simple and efficient method of monotonic abstraction to prove safety properties for parameterized systems with linear topologies. A process in the system is a finite-state automaton, where the transitions are guarded by both local and global conditions. Processes may communicate via broadcast, rendez-vous and shared variables over finite domains. The method of monotonic abstraction derives an over-approximation of the induced transition system that allows the use of a simple class of regular expressions as a symbolic representation. Compared to traditional regular model checking methods, the analysis does not require the manipulation of transducers, and hence its simplicity and efficiency. We have implemented a prototype that works well on several mutual exclusion algorithms and cache coherence protocols. <\/jats:p>","DOI":"10.1142\/s0129054109006887","type":"journal-article","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T11:33:52Z","timestamp":1253705632000},"page":"779-801","source":"Crossref","is-referenced-by-count":12,"title":["MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS"],"prefix":"10.1142","volume":"20","author":[{"given":"PAROSH AZIZ","family":"ABDULLA","sequence":"first","affiliation":[{"name":"Uppsala University, Sweden"}]},{"given":"GIORGIO","family":"DELZANNO","sequence":"additional","affiliation":[{"name":"Universit\u00e0 di Genova, Italy"}]},{"given":"NOOMENE BEN","family":"HENDA","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}]},{"given":"AHMED","family":"REZINE","sequence":"additional","affiliation":[{"name":"LIAFA, Paris 7, France"}]}],"member":"219","published-online":{"date-parts":[[2012,4,30]]},"reference":[{"key":"rf13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-44585-4_27","volume-title":"Computer Aided verification","volume":"2102","author":"Dams D.","year":"2001"},{"key":"rf20","doi-asserted-by":"publisher","DOI":"10.1145\/146637.146681"},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01383879"},{"key":"rf22","first-page":"326","volume":"2","author":"Higman G.","journal-title":"Proc. London Math. Soc. (3)"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00103-1"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108006066"},{"key":"rf28","first-page":"347","volume":"297","author":"Mayr R.","journal-title":"Theoretical Computer Science"},{"key":"rf29","volume-title":"Computation: finite and infinite machines","author":"Minsky M. L.","year":"1967"},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2008.12.042"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054109006887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:31:43Z","timestamp":1565137903000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054109006887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10]]},"references-count":9,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2012,4,30]]},"published-print":{"date-parts":[[2009,10]]}},"alternative-id":["10.1142\/S0129054109006887"],"URL":"https:\/\/doi.org\/10.1142\/s0129054109006887","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10]]}}}