Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A branching-time logic to verify synchronously coupled concurrent systems and its relevance to web-based systems

A branching-time logic to verify synchronously coupled concurrent systems and its relevance to... This paper is a sequel to our previous work wherein we proposed a state-based partial-order concurrency model from a given specification of communicating finite state machines (CFSMs), constituting a cooperative system specification. We unfold the CFSMs by simulating them in global environment to generate what we proposed as communicating minimal prefix machines (CMPMs). In this present work, we proceed from the unfolded CMPMs and go on to show that they form a distributed set of concurrent Kripke tree structures, over which we propose the logic computational distributed tree logic (CDTL) for model-checking. We show that CDTL provides an interesting set of expressive and nested formulae to verify safety, liveness and fairness properties. The component Kripke structures keep track of their respective local identities and at the same time maintain a global view through the environment vectors annotating every local CMPM state of the component Kripke structure. As a result, we achieve modularity as well as alleviation of state-explosion in our model-checking. Application of model-checking on web-systems is discussed. Keywords: communicating finite state machines; CFSMs; communicating minimal prefix machines; CMPMs; product automaton; interleaving semantics; partial-order semantics; state-space explosion; computational distributed tree logic; CDTL; model-checking; MC; safety; progress properties; multi-display http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Web Engineering and Technology Inderscience Publishers

A branching-time logic to verify synchronously coupled concurrent systems and its relevance to web-based systems

Download PDF
23 pages

Loading next page...
 
/lp/inderscience-publishers/a-branching-time-logic-to-verify-synchronously-coupled-concurrent-TLyDUeZUzo

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © 2015 Inderscience Enterprises Ltd.
ISSN
1476-1289
eISSN
1741-9212
DOI
10.1504/IJWET.2015.073950
Publisher site
See Article on Publisher Site

Abstract

This paper is a sequel to our previous work wherein we proposed a state-based partial-order concurrency model from a given specification of communicating finite state machines (CFSMs), constituting a cooperative system specification. We unfold the CFSMs by simulating them in global environment to generate what we proposed as communicating minimal prefix machines (CMPMs). In this present work, we proceed from the unfolded CMPMs and go on to show that they form a distributed set of concurrent Kripke tree structures, over which we propose the logic computational distributed tree logic (CDTL) for model-checking. We show that CDTL provides an interesting set of expressive and nested formulae to verify safety, liveness and fairness properties. The component Kripke structures keep track of their respective local identities and at the same time maintain a global view through the environment vectors annotating every local CMPM state of the component Kripke structure. As a result, we achieve modularity as well as alleviation of state-explosion in our model-checking. Application of model-checking on web-systems is discussed. Keywords: communicating finite state machines; CFSMs; communicating minimal prefix machines; CMPMs; product automaton; interleaving semantics; partial-order semantics; state-space explosion; computational distributed tree logic; CDTL; model-checking; MC; safety; progress properties; multi-display

Journal

International Journal of Web Engineering and Technology – Inderscience Publishers

Published: Jan 1, 2015

There are no references for this article.