Sciweavers

99 search results - page 10 / 20
» Triggered message sequence charts
Sort
View
FORTE
2007
13 years 10 months ago
Recovering Repetitive Sub-functions from Observations
This paper proposes an algorithm which, given a set of observations of an existing concurrent system that has repetitive subfunctions, constructs a Message Sequence Charts (MSC) gr...
Guy-Vincent Jourdan, Hasan Ural, Shen Wang, Hü...
PADL
2004
Springer
14 years 1 months ago
Symbolic Execution of Behavioral Requirements
Message Sequence Charts (MSC) have traditionally been used as a weak form of behavioral requirements in software design; they denote scenarios which may happen. Live Sequence Chart...
Tao Wang, Abhik Roychoudhury, Roland H. C. Yap, S....
ICALP
2000
Springer
14 years 5 days ago
On Message Sequence Graphs and Finitely Generated Regular MSC Languages
Message Sequence Charts (MSCs) are an attractive visual formalism widely used to capture system requirements during the early design stages in domains such as telecommunication sof...
Jesper G. Henriksen, Madhavan Mukund, K. Narayan K...
ENTCS
2008
123views more  ENTCS 2008»
13 years 8 months ago
A Chart Semantics for the Pi-Calculus
We present a graphical semantics for the pi-calculus, that is easier to visualize and better suited to expressing causality and temporal properties than conventional relational se...
Johannes Borgström, Andrew D. Gordon, Andrew ...
SEFM
2009
IEEE
14 years 3 months ago
Specifying Interacting Components with Coordinated Concurrent Scenarios
Abstract. We introduce a visual notation for local specification of concurrent components based on message sequence charts (MSCs). Each component is a finite-state machine whose ...
Prakash Chandrasekaran, Madhavan Mukund