Sciweavers

528 search results - page 21 / 106
» Transition Logic Revisited
Sort
View
ASPDAC
2006
ACM
109views Hardware» more  ASPDAC 2006»
15 years 5 months ago
Hardware debugging method based on signal transitions and transactions
- This paper proposes a hardware design debugging method, Transition and Transaction Tracer (TTT), which probes and records the signals of interest for a long time, hours, days, or...
Nobuyuki Ohba, Kohji Takano
103
Voted
CODES
2002
IEEE
15 years 6 months ago
Symbolic model checking of Dual Transition Petri Nets
This paper describes the formal verification of the recently introduced Dual Transition Petri Net (DTPN) models [12], using model checking techniques. The methodology presented a...
Mauricio Varea, Bashir M. Al-Hashimi, Luis Alejand...
LICS
1995
IEEE
15 years 5 months ago
Tree Canonization and Transitive Closure
We prove that tree isomorphism is not expressible in the language (FO + TC + COUNT). This is surprising since in the presence of ordering the language captures NL, whereas tree is...
Kousha Etessami, Neil Immerman
125
Voted
PNPM
1987
15 years 5 months ago
Toward a Definition of Modeling Power for Stochastic Petri Net Models
Some insight on the meaning of "modeling power" for Stochastic Petri Net models is given. Extensions characterizing a Stochastic Petri Net are categorized as logical or ...
Gianfranco Ciardo
FOSSACS
2010
Springer
15 years 8 months ago
Coalgebraic Correspondence Theory
Abstract. We lay the foundations of a first-order correspondence theory for coalgebraic logics that makes the transition structure explicit in the first-order modelling. In parti...
Lutz Schröder, Dirk Pattinson