Sciweavers

99 search results - page 11 / 20
» Triggered message sequence charts
Sort
View
CONCUR
2007
Springer
14 years 15 days 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 8 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
IANDC
2010
115views more  IANDC 2010»
13 years 6 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
TACAS
2007
Springer
117views Algorithms» more  TACAS 2007»
14 years 2 months ago
Replaying Play In and Play Out: Synthesis of Design Models from Scenarios by Learning
This paper is concerned with bridging the gap between requirements, provided as a set of scenarios, and conforming design models. The novel aspect of our approach is to exploit lea...
Benedikt Bollig, Joost-Pieter Katoen, Carsten Kern...
ICALP
2000
Springer
14 years 5 days ago
Formalizing the Development of Agent-Based Systems Using Graph Processes
Graph processes are used in order to formalize the relation between global requirement specifications of multi-agent systems by means of message sequence charts, and implementatio...
Ralph Depke, Reiko Heckel