528 search results - page 82 / 106 » Transition Logic Revisited |
106
click to vote
CORR
2007
Springer
15 years 1 months ago
2007
Springer
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
108
click to vote
TCS
2002
15 years 1 months ago
2002
We consider the timed automata model of [3], which allows the analysis of realtime systems expressed in terms of quantitative timing constraints. Traditional approaches to real-ti...
107
click to vote
IANDC
2010
15 years 13 days ago
2010
Broadcast semantics poses significant challenges over point-to-point communication when it comes to formal modelling and analysis. Current approaches to analysing broadcast netwo...
196
click to vote
ARC
2011
Springer
14 years 9 months ago
2011
Springer
In this paper, we propose a regular expression matching circuit based on a decomposed automaton. To implement a regular expression matching circuit, first, we convert regular expr...
ER
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Definitions of the concepts derived from the goal concept (including functional and nonfunctional goal, hardgoal, and softgoal) used in requirements engineering are discu...