A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Asynchronously Communicating Visibly Pushdown Systems
[chapter]
2013
Lecture Notes in Computer Science
We introduce an automata-based formal model suitable for specifying, modeling, analyzing, and verifying asynchronous task-based and message-passing programs. Our model consists of visibly pushdown automata communicating over unbounded reliable point-to-point firstin-first-out queues. Such a combination unifies two branches of research, one focused on task-based models, and the other on models of messagepassing programs. Our model generalizes previously proposed models that have decidable
doi:10.1007/978-3-642-38592-6_16
fatcat:7dyumv5k6fhbtbbwkawlbpx5ci