Sciweavers

34 search results - page 2 / 7
» Local Testing of Message Sequence Charts Is Difficult
Sort
View
APN
2006
Springer
13 years 9 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
I3E
2001
196views Business» more  I3E 2001»
13 years 6 months ago
Security Modelling for Electronic Commerce: The Common Electronic Purse Specifications
: Designing security-critical systems correctly is very difficult. We present work on software engineering of security critical systems, supported by the CASE tool AUTOFOCUS. Secur...
Jan Jürjens, Guido Wimmel
SEFM
2009
IEEE
14 years 7 days 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
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
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