We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Power integrity simulation for system-on-package (SoP) based modules is a crucial bottleneck in the SoP design flow. In this paper, the multi-layer finite difference method (M-FDM...
Krishna Bharath, Ege Engin, Madhavan Swaminathan, ...
In this paper we study the fault codiagnosis problem for discrete event systems given by finite automata (FA) and timed systems given by timed automata (TA). We provide a uniform c...
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
Robert Meolic, Alessandro Fantechi, Stefania Gnesi
Timed and hybrid automata are extensions of finite-state machines for formal modeling of embedded systems with both discrete and continuous components. Reachability problems for t...
Rajeev Alur, Robert P. Kurshan, Mahesh Viswanathan