528 search results - page 21 / 106 » Transition Logic Revisited |
122
click to vote
ASPDAC
2006
ACM
15 years 9 months ago
2006
ACM
- 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...
147
click to vote
CODES
2002
IEEE
15 years 10 months ago
2002
IEEE
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...
145
click to vote
LICS
1995
IEEE
15 years 9 months ago
1995
IEEE
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...
170
click to vote
PNPM
1987
15 years 9 months ago
1987
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 ...
187
click to vote
FOSSACS
2010
Springer
16 years 21 days ago
2010
Springer
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...