Results 1  10
of
12
Highlevel Message Sequence Charts
, 1997
"... syntax of HMSC A hierarchical graph is a mathematical structure that represents the information contents of an HMSC. The set HGid represents the set of all HMSC names. Obviously, this includes the names of BMSCs. Since we did not provide a formal graphical syntax for HMSC we cannot provide a forma ..."
Abstract

Cited by 52 (4 self)
 Add to MetaCart
(Show Context)
syntax of HMSC A hierarchical graph is a mathematical structure that represents the information contents of an HMSC. The set HGid represents the set of all HMSC names. Obviously, this includes the names of BMSCs. Since we did not provide a formal graphical syntax for HMSC we cannot provide a formal mapping from HMSC to hierarchical graphs. However, the intuition is clear. A node in an HMSC contains a reference to another HMSC via its name. Definition 3.3.1 (Hierarchical graphs) A hierarchical graph is either a BMSC or a tuple #id, Nodes, Starts, Ends, Edges, l#, where . id # HGid is the name of the hierarchical graph; . Nodes, Starts, and Ends are pairwise disjoint sets of HMSC reference nodes, start nodes and end nodes respectively with Starts #= ?; . Edges # (Nodes # Starts) × (Nodes # Ends) is a set of edges. An edge (n, n # ) is denoted by n # n # ; . l : Nodes # HGid is a labeling function which associates to a node a reference to an HMSC by means of a...
An Algebraic Semantics for Message Sequence Chart Documents
 Proceedings of FORTE/PSTV '98
, 1998
"... Message Sequence Charts (MSCs) are a graphical and textual language for the speci cation of message passing systems, in particular telecommunication systems. MSCs are standardised by the Internal Telecommunication Union in standard Z.120. Included in the standard is a formal semantics for MSCs by me ..."
Abstract

Cited by 15 (4 self)
 Add to MetaCart
(Show Context)
Message Sequence Charts (MSCs) are a graphical and textual language for the speci cation of message passing systems, in particular telecommunication systems. MSCs are standardised by the Internal Telecommunication Union in standard Z.120. Included in the standard is a formal semantics for MSCs by means of a process algebra. This semantics covers the complete language of single MSCs but lacks an interpretation for conditions which are used as continuation points of MSCs within an MSC document (a collection of MSCs). In this paper, we give a process algebraic semantics for basic MSCs including conditions, enabling the formal interpretation of entire MSC documents. 1
Operational Semantics for MSC'96
 Computer Networks and ISDN Systems
, 1998
"... Introduction Recently, the ITU 1 standardised specification language Message Sequence Chart (MSC) [IT96] has been extended with constructs for more complete and structured specifications. The new version of the language is called MSC'96. Currently, research is performed on the extension of ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
Introduction Recently, the ITU 1 standardised specification language Message Sequence Chart (MSC) [IT96] has been extended with constructs for more complete and structured specifications. The new version of the language is called MSC'96. Currently, research is performed on the extension of the old formal semantics towards a semantics for MSC'96. Ideally, the development of a language and its semantics should go hand in hand. There is little use in defining a fancy syntactic construction without a precise understanding of its meaning. As was the case for the old version of the MSC language, first the syntax and an incomplete and informal semantics were developed, while the construction of a formal semantics was deferred until after the acceptance of the language by the ITU bodies. It is obvious that the aposteriori construction of a formal semantics will reveal many places in which the informal language description is ambiguous, underspecified, inconsistent
Transactions in ObjectOriented Specifications
 Recent Trends in Data Types Specification, Proc. 10th Workshop on Specification of Abstract Data Types joint with the 5th COMPASS Workshop, S.Margherita, Italy, May/June 1994, Selected papers
, 1995
"... The formal step by step development of implementations from specifications is necessary to allow the incremental description of large software systems and hence split the software development process in manageable portions. Due to the complex notion of objects as units of structure and behavior, ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
(Show Context)
The formal step by step development of implementations from specifications is necessary to allow the incremental description of large software systems and hence split the software development process in manageable portions. Due to the complex notion of objects as units of structure and behavior, the refinement process has to be reconsidered in the objectoriented framework. Apart from refining structure the behavioral part gives rise to refine actions by transactions. Referring to information systems as application domain, concurrency control aspects come into play because of shared resources. We present an approach to incorporate transactions into objectoriented specification and illustrate the main problems of synchronizing them on commonly used resources.
Refinement in Interworkings
 7th International Conference on Concurrency Theory (CONCUR96), volume 1119 of Lect
, 1996
"... . Interworkings is a graphical language for displaying the interaction between system components. In this paper we give a formal semantics for Interworkings based on process algebra. A notion of refinement on Interworkings will be defined. 1 Introduction The Interworking language (IW) is a graphica ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
. Interworkings is a graphical language for displaying the interaction between system components. In this paper we give a formal semantics for Interworkings based on process algebra. A notion of refinement on Interworkings will be defined. 1 Introduction The Interworking language (IW) is a graphical formalism for displaying the communication behaviour of system components. It was developed in order to support the informal diagrams used at Philips Kommunikations Industrie (Nurnberg) which were used for requirements specification and design. One of the reasons for developing an explicit language was that it showed very hard to maintain a large collection of diagrams by hand. Several problems were encountered. First of all, manually drawing and updating large diagrams is an expensive activity. Secondly, diagrams that are linked to each other must be updated consistently. Therefore, consistency checks are needed. Thirdly, the relation between the diagrams in a collection is only implicit....
From MSC2000 to UML 2.0  the future of sequence diagrams
 In Proc. STL 2001
, 2001
"... Abstract. This paper discusses how MSC2000 could influence the Sequence Diagrams within UML 2.0, and whythe UML 1.x semantics is partlyinadequate for what is needed in the area of sequence charts. Extracts of a possible UML metamodel is shown and this can be understood as a conceptual model for MS ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
Abstract. This paper discusses how MSC2000 could influence the Sequence Diagrams within UML 2.0, and whythe UML 1.x semantics is partlyinadequate for what is needed in the area of sequence charts. Extracts of a possible UML metamodel is shown and this can be understood as a conceptual model for MSC2000 as well and an indication of an approach to the future MSC2000 semantics. UML Collaboration Diagrams have no direct counterpart in SDL/MSC and the difference between sequence diagrams and collaboration diagrams is analyzed.
A process algebra for Interworkings
 Smolka (Eds.), Handbook of Process Algebra, Elsevier
, 2000
"... The Interworking language (IW) is a graphical formalism for displaying the communication behaviour of system components. In this chapter, we develop a formal semantics for the Interworking language. This semantics must support the analysis of (collections of) Interworking diagrams and allow to expre ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
The Interworking language (IW) is a graphical formalism for displaying the communication behaviour of system components. In this chapter, we develop a formal semantics for the Interworking language. This semantics must support the analysis of (collections of) Interworking diagrams and allow to express the relation between diagrams. We will explain how techniques from process algebra can be successfully applied to this problem. Thereto, we introduce process operators for expressing the relationship between Interworking diagrams. We define a number of process algebras with increasing complexity. For each of these we prove completeness with respect to an operational semantics.
A Domain for Concurrent Termination: A Generalization of Mazurkiewicz traces
 Proceedings of the 22nd International Colloquium on Automata, Languages and Programming (ICALP'95), Szeged (Hungary) 1995, number 944 in Lecture Notes in Computer Science
, 1994
"... This paper generalizes the concept of Mazurkiewicz traces to a fuzzy description of a concurrent process, where a known prefix is given in a first component and a second alphabetic component yields necessary information about future actions. This allows to define a good semantic domain where the ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
This paper generalizes the concept of Mazurkiewicz traces to a fuzzy description of a concurrent process, where a known prefix is given in a first component and a second alphabetic component yields necessary information about future actions. This allows to define a good semantic domain where the concatenation is continuous with respect to the Scott and to the Lawson topology. For this we define the notion of ff\Gamma and of ffi trace. We show various mathematical results proving thereby the soundness of our approach. Our theory is a proper generalization of the theory of finite and infinite words (with explicit termination) and of the theory of finite and infinite (real and complex) traces. We make use of trace theory, domain theory, and topology. 1 Introduction The theory of Mazurkiewicz traces has been recognized as an important tool for investigating concurrent systems, overviews are in [Maz87, AR88, Per89, Die90, DR95]. The underlying idea is that for a given alphabet...
Dependencybased action refinement
 Proceedings 22nd International Symposium on Mathematical Foundations of Computer Science (MFCS'97
, 1997
"... Abstract. Action refinement in process algebras has been widely studied in the last few years as a means to support topdown design of systems. A specific notion of refinement arises when a dependency relation on the actions (in the Mazurkiewicz sense) is used to control the inheritance of orderi ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Action refinement in process algebras has been widely studied in the last few years as a means to support topdown design of systems. A specific notion of refinement arises when a dependency relation on the actions (in the Mazurkiewicz sense) is used to control the inheritance of orderings from the abstract level. In this paper we present a rather simple operational semantics for dependencybased action refinement. We show the consistency of the operational with a (previously published) denotational semantics. We moreover show that bisimulation is a congruence for dependencybased refinement. Finally, we give an illustrative example. 1
A Process Algebra Semantics for Message Sequence Charts Including Conditions
"... Message Sequence Charts (MSCs) are a graphical and textual language for the specification of message passing systems, in particular telecommunication systems. MSCs are standardised by the Internal Telecommunication Union in standard Z.120. Included in the standard is a formal semantics for MSCs b ..."
Abstract
 Add to MetaCart
(Show Context)
Message Sequence Charts (MSCs) are a graphical and textual language for the specification of message passing systems, in particular telecommunication systems. MSCs are standardised by the Internal Telecommunication Union in standard Z.120. Included in the standard is a formal semantics for MSCs by means of a process algebra. This semantics covers the complete language of single MSCs but lacks an interpretation for conditions which are used as continuation points of MSCs within an MSC document (a collection of MSCs). In this paper, we give a process algebraic semantics for basic MSCs including conditions, enabling the formal interpretation of entire MSC documents. 1 Introduction Message Sequence Charts (MSCs) are a widely used formalism for the specification of the communication behaviour of reactive systems. It allows for the graphical and textual representation of the communication structure of systems. MSCs focus on the temporal ordering of interaction among system component...