Sciweavers

373 search results - page 58 / 75
» Analysis of Recursive State Machines
Sort
View
ENTCS
2007
85views more  ENTCS 2007»
14 years 9 months ago
Stochastic Modelling of Communication Protocols from Source Code
A major development in qualitative model checking was the jump to verifying properties of source code directly, rather than requiring a separately specified model. We describe an...
Michael J. A. Smith
TPDS
2008
76views more  TPDS 2008»
14 years 9 months ago
How to Choose a Timing Model
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
Idit Keidar, Alexander Shraer
COMCOM
1998
117views more  COMCOM 1998»
14 years 9 months ago
Specification, validation, and verification of time-critical systems
In this paper, we propose a new formalism, named the Timed Communicating Finite State Machine (Timed CFSM), for specifying and verifying time-critical systems. Timed CFSM preserve...
Shiuh-Pyng Shieh, Jun-Nan Chen
TCAD
1998
82views more  TCAD 1998»
14 years 9 months ago
Structural methods for the synthesis of speed-independent circuits
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...
Enric Pastor, Jordi Cortadella, Alex Kondratyev, O...
SEUS
2010
IEEE
14 years 8 months ago
Code Generation for Embedded Java with Ptolemy
Abstract. Code generation from models is the ultimate goal of model-based design. For real-time systems the generated code must be analyzable for the worstcase execution time (WCET...
Martin Schoeberl, Christopher Brooks, Edward A. Le...