Abstract
An approach to modelling and verification for networks of processes that communicate solely via shared variables is presented. A process or a network is defined by its set of possible behaviours. Each behaviour is an abstraction of an infinite execution sequence of the process. A linear-time temporal logic formalism is introduced for the specification and verification of safety and liveness properties. The specification of a network can be obtained naturally from the specifications of its component processes.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
