Sciweavers

5525 search results - page 380 / 1105
» Verification of Model Transformations
Sort
View
SPAA
2003
ACM
16 years 4 days ago
The complexity of verifying memory coherence
The general problem of verifying coherence for shared-memory multiprocessor executions is NP-Complete. Verifying memory consistency models is therefore NP-Hard, because memory con...
Jason F. Cantin, Mikko H. Lipasti, James E. Smith
ASPDAC
2007
ACM
79views Hardware» more  ASPDAC 2007»
15 years 11 months ago
Challenges to Accuracy for the Design of Deep-Submicron RF-CMOS Circuits
- Two challenges for the accurate prediction of GHz CMOS analog/RF building blocks are presented. Challenging the usage of new compact MOSFET models enhances the simulation accurac...
S. Yoshitomi
ESOP
2008
Springer
15 years 8 months ago
A Hybrid Denotational Semantics for Hybrid Systems
Abstract. In this article, we present a model and a denotational semantics for hybrid systems. Our model is designed to be used for the verification of large, existing embedded app...
Olivier Bouissou, Matthieu Martel
JSW
2007
126views more  JSW 2007»
15 years 6 months ago
Supporting UML Sequence Diagrams with a Processor Net Approach
— UML sequence diagrams focus on the interaction between different classes. For distributed real time transaction processing it is possible to end up with complex sequence diagra...
Tony Spiteri Staines
ICFEM
2009
Springer
15 years 4 months ago
An Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the descri...
Joakim Byg, Kenneth Yrke Jørgensen, Jir&iac...