Designing the Parlay Call-Control Using ASMs

Recently different standardization bodies have joined to create a new standard to open network API between the telecom service level, which gives connectivity to different networks, and the application level, which is built by enterprises outside the telecom network domain. This OSA (Open Service Access) API is a standard interface for applications to use the capabilities of a network without knowing technology details. Parlay/OSA specification covers different aspects: messaging, location, conferencing, security, call-control, etc. Our work focuses on the Call Control API specification whose main goal is both to allow applications creating whichever kind of call between voice terminals connected to different networks, and also react to call requests coming from various networks, according to the service-logic implemented by the applications. The Parlay documentation provides a specification of the Call Control Service Capability Feature (SCF) aspects of the interface by means of UML class, state, and sequence diagrams. However, although UML emerges as the best practice modeling notation for object-oriented software development, in its current setting it still lacks of a formal semantics. As a consequence its usage and, correspondingly, the interpretation of developed models may differ considerably. For this reason several of semantics models for UML diagrams have been provided. We present a methodology to produce an ASM specification of the Parlay call control from the UML diagrams provided in the documentation

Computer Aided Verification

This open access two-volume set LNCS 10980 and 10981 constitutes the refereed proceedings of the 30th International Conference on Computer Aided Verification, CAV 2018, held in Oxford, UK, in July 2018. The 52 full and 13 tool papers presented together with 3 invited papers and 2 tutorials were carefully reviewed and selected from 215 submissions. The papers cover a wide range of topics and techniques, from algorithmic and logical foundations of verification to practical applications in distributed, networked, cyber-physical, and autonomous systems. They are organized in topical sections on model checking, program analysis using polyhedra, synthesis, learning, runtime verification, hybrid and timed systems, tools, probabilistic systems, static analysis, theory and security, SAT, SMT and decisions procedures, concurrency, and CPS, hardware, industrial applications

Bowdoin Orient v.124, no.1-23 (1993-1994)

https://digitalcommons.bowdoin.edu/bowdoinorient-1990s/1005/thumbnail.jp