Sciweavers

29 search results - page 1 / 6
» Decomposing port automata
Sort
View
SAC
2009
ACM
13 years 11 months ago
Decomposing port automata
Port automata are an operational model for component connectors in a coordination language such as Reo. They describe which sets of ports can synchronize in each state of the conn...
Christian Koehler, Dave Clarke
FORMATS
2004
Springer
13 years 8 months ago
Decomposing Verification of Timed I/O Automata
This paper presents assume-guarantee style substitutivity results for the recently published timed I/O automaton modeling framework. These results are useful for decomposing verifi...
Dilsun Kirli Kaynar, Nancy A. Lynch
FORMATS
2003
Springer
13 years 10 months ago
On Timing Analysis of Combinational Circuits
In this paper we report some progress in applying timed automata technology to large-scale problems. We focus on the problem of finding maximal stabilization time for combinationa...
Ramzi Ben Salah, Marius Bozga, Oded Maler
ICCAD
2007
IEEE
137views Hardware» more  ICCAD 2007»
14 years 1 months ago
Analysis of large clock meshes via harmonic-weighted model order reduction and port sliding
— Clock meshes posses inherent low clock skews and excellent immunity to PVT variations, and have increasingly found their way to high-performance IC designs. However, analysis o...
Xiaoji Ye, Peng Li, Min Zhao, Rajendran Panda, Jia...
PTS
2007
99views Hardware» more  PTS 2007»
13 years 6 months ago
Testing Input/Output Partial Order Automata
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
Stefan Haar, Claude Jard, Guy-Vincent Jourdan