Sciweavers

IANDC
2010
115views more  IANDC 2010»
13 years 2 months ago
18th International Conference on Concurrency Theory
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
Luís Caires, Vasco Thudichum Vasconcelos
FSTTCS
2010
Springer
13 years 3 months ago
Model checking time-constrained scenario-based specifications
We consider the problem of model checking message-passing systems with real-time requirements. As behavioural specifications, we use message sequence charts (MSCs) annotated with ...
S. Akshay, Paul Gastin, Madhavan Mukund, K. Naraya...
JCP
2008
142views more  JCP 2008»
13 years 5 months ago
Design and Verification of Loosely Coupled Inter-Organizational Workflows with Multi-Level Security
Inter-Organizational Workflows (IOWF) become important as they provide solution for data sharing, heterogeneity in resources and work coordination at global level. However, a secur...
Boleslaw Mikolajczak, Nirmal Gami
FORTE
2001
13 years 6 months ago
Stepwise Design with Message Sequence Charts
Use cases are useful in various stages of the software process. They are very often described using text that has to be interpreted by system designers. This could lead to implemen...
Ferhat Khendek, Stephan Bourduas, Daniel Vincent
DAGSTUHL
2003
13 years 6 months ago
Deciding Properties of Message Sequence Charts
Message Sequence Charts (MSCs) is a notation used in practice by protocol designers and system engineers. It is defined within an international standard (ITU Z120), and is also i...
Anca Muscholl, Doron Peled
FORTE
2007
13 years 6 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ü...
APN
2006
Springer
13 years 8 months ago
The BRITNeY Suite Animation Tool
Abstract. This paper describes the BRITNeY suite, a tool which enables users to create visualizations of formal models. BRITNeY suite is integrated with CPN Tools, and we give an e...
Michael Westergaard, Kristian Bisgaard Lassen
APN
2006
Springer
13 years 8 months ago
The Synthesis Problem of Netcharts
A netchart is basically a Petri net whose places are located at some process and whose transitions are labeled by message sequence charts (MSCs). Two recent papers showed independe...
Nicolas Baudru, Rémi Morin
FCT
2007
Springer
13 years 9 months ago
Local Testing of Message Sequence Charts Is Difficult
Abstract. Message sequence charts are an attractive formalism for specifying communicating systems. One way to test such a system is to substitute a component by a test process and...
Puneet Bhateja, Paul Gastin, Madhavan Mukund, K. N...
CONCUR
2007
Springer
13 years 9 months ago
Checking Coverage for Infinite Collections of Timed Scenarios
We consider message sequence charts enriched with timing constraints between pairs of events. As in the untimed setting, an infinite family of time-constrained message sequence cha...
S. Akshay, Madhavan Mukund, K. Narayan Kumar