Sciweavers

29 search results - page 3 / 6
» Deciding Properties of Message Sequence Charts
Sort
View
TASE
2007
IEEE
14 years 7 days ago
Realizing Live Sequence Charts in SystemVerilog
The design of an embedded control system starts with an investigation of properties and behaviors of the process evolving within its environment, and an analysis of the requiremen...
Hai H. Wang, Shengchao Qin, Jun Sun 0001, Jin Song...
ENTCS
2008
123views more  ENTCS 2008»
13 years 6 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
2008
IEEE
14 years 11 days ago
Tagging Make Local Testing of Message-Passing Systems Feasible
The only practical way to test distributed messagepassing systems is to use local testing. In this approach, used in formalisms such as concurrent TTCN-3, some components are repl...
Puneet Bhateja, Madhavan Mukund
CSFW
2009
IEEE
14 years 22 days ago
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists
Cryptographic protocols are crucial for securing electronic transactions. The confidence in these protocols can be increased by the formal analysis of their security properties. ...
Najah Chridi, Mathieu Turuani, Michaël Rusino...
FORTE
1994
13 years 7 months ago
Four issues concerning the semantics of Message Flow Graphs
We discuss four issues concerning the semantics of Message Flow Graphs (MFGs). MFGs are extensively used as pictures of message-passing behavior. One type of MFG, Message Sequence...
Peter B. Ladkin, Stefan Leue