A Toolset for Modelling and Verification of GALS Systems

Ramesh, S.; Sonalkar, Sampada; D’Silva, Vijay; Chandra, Rohit; Vijayalakshmi, B.

doi:10.1007/978-3-540-27813-9_47

Cited by 18 publications

(13 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…[1,9,12,19]), we have not encountered any similar technique for asynchronous systems. Our technique shares many commonalities with its synchronous counterpart; an observer state observes the significant events and run-time states related to the properties.…”

Section: Property Specificationmentioning

confidence: 89%

An Adaptable Formal Model for Web Services Protocols

Ramsokul

Sowmya

2007

Second International Conference on Internet and Web Applications and Services (ICIW'07)

View full text Add to dashboard Cite

Agents require standard and reliable protocols to interact with service providers in order to provide high quality customer service over the web. Many useful web services protocols are coming on the market, but are often ambiguously specified by protocol designers and not fully verified. This can lead to interoperability problems among implementations of the same protocol as well as high software maintenance costs. We have recently proposed a formal hierarchical automata-based framework that aims to address these issues. In this paper, we extend our framework to overcome the two identified limitations, re-usability and adaptability, and describe how they are useful for conformance checking and for our observer-based technique for property specification. We also apply the extended framework on the WS-BusinessActivity's AtomicOutcome protocol suite and discuss our experience using the model.

show abstract

Section: Property Specificationmentioning

confidence: 89%

An Adaptable Formal Model for Web Services Protocols

Ramsokul

Sowmya

2007

Second International Conference on Internet and Web Applications and Services (ICIW'07)

View full text Add to dashboard Cite

show abstract

“…We have described a simulator and model checker for our distributed reactive systems model in [14,15]. We have added an abstraction-refinement algorithm to the tool based on the ideas in this paper.…”

Section: Experiencementioning

confidence: 99%

“…memory. Much research has recently been devoted to extending the synchronous languages to encompass a special class of distributed reactive systems called Globally Asynchronous Locally Synchronous (GALS) systems [6,15].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Existential abstractions for distributed reactive systems via syntactic transformations

D’Silva

Sonalkar

Ramesh

2007

Proceedings of the 7th ACM &Amp; IEEE International Conference on Embedded Software - EMSOFT '07

Self Cite

View full text Add to dashboard Cite

Synchronous languages are well suited to implementation and verification of reactive systems. Large reactive systems tend to be distributed to cope with scalability and application specific demands. We propose abstractions for distributed reactive systems modelled as a set of synchronous nodes with asynchronous communication between them. The special features of synchronous programs allow us to obtain abstractions that are also valid synchronous programs only by syntactic transformations. For a given program, the set of all such abstractions forms a semi-lattice with the original program as the bottom and the most abstract program as the top element. The transformation we define is a natural basis for constructing an abstraction-refinement framework for verification. Given a program and a safety property, the abstraction-refinement process is a search in a lattice of programs obtained via syntactic transformations. We have implemented this abstraction refinement framework in a prototype tool and report our case studies.

show abstract

“…As regards related work, we can mention [29], which translates Crsm [28] into Promela and then uses the Spin model checker to verify properties expressed as a set of distributed observers; our approach is different in the sense that it can use synchronous languages just as they are, instead of introducing a new synchronous/asynchronous language such as Crsm.…”

Section: Introductionmentioning

confidence: 99%

Verification of GALS Systems by Combining Synchronous Languages and Process Calculi

Garavel

Thivolle

2009

Model Checking Software

View full text Add to dashboard Cite

Abstract. A Gals (Globally Asynchronous Locally Synchronous) system typically consists of a collection of sequential, deterministic components that execute concurrently and communicate using slow or unreliable channels. This paper proposes a general approach for modelling and verifying Gals systems using a combination of synchronous languages (for the sequential components) and process calculi (for communication channels and asynchronous concurrency). This approach is illustrated with an industrial case-study provided by Airbus: a Tftp/Udp communication protocol between a plane and the ground, which is modelled using the Eclipse/TopCased workbench for model-driven engineering and then analysed formally using the Cadp verification and performance evaluation toolbox.

show abstract

A Toolset for Modelling and Verification of GALS Systems

Cited by 18 publications

References 7 publications

An Adaptable Formal Model for Web Services Protocols

An Adaptable Formal Model for Web Services Protocols

Existential abstractions for distributed reactive systems via syntactic transformations

Verification of GALS Systems by Combining Synchronous Languages and Process Calculi

Contact Info

Product

Resources

About