Timing analysis for synthesis of hardware interface controllers using timed signal transition graphs

2002 ◽  
Author(s):  
M.A. Escalante ◽  
N.J. Dimopoulos ◽  
D. Gyuroff ◽  
H. Muller
Keyword(s):  
Timing Analysis ◽  
Hardware Interface ◽  
Transition Graphs

Aging-aware Timing Analysis of Combinatorial Circuits on Gate Level

2010 ◽  
Vol 52 (4) ◽  
Author(s):  
Dominik Lorenz ◽  
Georg Georgakos ◽  
Ulf Schlichtmann
Keyword(s):  
Timing Analysis ◽  
Combinatorial Circuits

Timing analysis of worst case with direct NM of OSEK NM

2008 ◽  
Author(s):  
Chang-Wan Son ◽  
Jin-Ho Kim ◽  
Tae-Yoon Moon ◽  
Key-Ho Kwon ◽  
Sung-Ho Hwang ◽  
...  
Keyword(s):  
Timing Analysis ◽  
Worst Case

Static worst-case timing analysis of Ada

1994 ◽  
Vol XIV (5) ◽  
pp. 88-91 ◽  
Author(s):  
Roderick Chapman ◽  
Alan Burns ◽  
Andy Wellings
Keyword(s):  
Timing Analysis ◽  
Worst Case

scholarly journals Higher-order Recursion Schemes and Collapsible Pushdown Automata: Logical Properties

2021 ◽  
Vol 22 (2) ◽  
pp. 1-37
Author(s):  
Christopher H. Broadbent ◽  
Arnaud Carayol ◽  
C.-H. Luke Ong ◽  
Olivier Serre
Keyword(s):  
Model Checking ◽  
Free Variable ◽  
Higher Order ◽  
Second Order ◽  
Effective Solution ◽  
Parity Games ◽  
Transition Graphs ◽  
Second Order Logic ◽  
Pushdown Automata ◽  
Monadic Second Order Logic

This article studies the logical properties of a very general class of infinite ranked trees, namely, those generated by higher-order recursion schemes. We consider, for both monadic second-order logic and modal -calculus, three main problems: model-checking, logical reflection (a.k.a. global model-checking, that asks for a finite description of the set of elements for which a formula holds), and selection (that asks, if exists, for some finite description of a set of elements for which an MSO formula with a second-order free variable holds). For each of these problems, we provide an effective solution. This is obtained, thanks to a known connection between higher-order recursion schemes and collapsible pushdown automata and on previous work regarding parity games played on transition graphs of collapsible pushdown automata.

Sign in / Sign up

Export Citation Format

Share Document