Sciweavers

353 search results - page 23 / 71
» From graph states to two-graph states
Sort
View
WIOPT
2010
IEEE
13 years 6 months ago
Effect of limited topology knowledge on opportunistic forwarding in ad hoc wireless networks
—Opportunistic forwarding is a simple scheme for packet routing in ad hoc wireless networks such as duty cycling sensor networks in which reducing energy consumption is a princip...
Prithwish Basu, Saikat Guha
ISCIS
2009
Springer
14 years 2 months ago
Using a SAT solver to generate checking sequences
—Methods for software testing based on Finite State Machines (FSMs) have been researched since the early 60’s. Many of these methods are about generating a checking sequence fr...
Guy-Vincent Jourdan, Hasan Ural, Hüsnü Y...
APN
2006
Springer
13 years 11 months ago
Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets
Abstract. Time Petri nets have proved their interest in modeling realtime concurrent systems. Their usual semantics is defined in term of firing sequences, which can be coded in a ...
Thomas Chatain, Claude Jard
EWHCI
1995
13 years 11 months ago
Generating Editors for Direct Manipulation of Diagrams
Diagrams (e.g., trees for hierarchical structures, or graphs for finite state machines) are often needed as part of advanced user interfaces, and are frequently specific to a use...
Gerhard Viehstaedt, Mark Minas
JSA
2008
131views more  JSA 2008»
13 years 7 months ago
Formal verification of ASMs using MDGs
We present a framework for the formal verification of abstract state machine (ASM) designs using the multiway decision graphs (MDG) tool. ASM is a state based language for describ...
Amjad Gawanmeh, Sofiène Tahar, Kirsten Wint...