Abstract
The paper shows, how the true concurrency model for concurrent systems, so-called directed, acyclic, arc-labelled graphs, and propositional Concurrent Temporal Logic, that have been developed for the specification and verification of elementary net systems, can be adapted to give a true concurrency semantics to shared variables programs, and to write first-order specifications of the programs, so that also concurrency can be specified.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
