1895 search results - page 302 / 379 » Using ATL for Checking Models |
147
click to vote
FDL
2004
IEEE
15 years 6 months ago
2004
IEEE
This paper proposes a formal verification methodology which is smoothly integrated with component-based system-level design, using a divide and conquer approach. The methodology a...
125
Voted
ICLP
1995
Springer
15 years 6 months ago
1995
Springer
The semantics of constraint logic programming languages with coroutining facilities (\freeze," suspension, residuation, etc.) cannot be fully declarative; thus, an operationa...
130
click to vote
CAV
2008
Springer
15 years 4 months ago
2008
Springer
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
103
click to vote
CDC
2009
IEEE
15 years 3 months ago
2009
IEEE
In this paper, we study the reachability problem for the class of (strictly) monotone Petri nets that we define based on algebraic conditions. More specifically, given a (strictly)...
108
click to vote
AAMAS
2008
Springer
15 years 2 months ago
2008
Springer
We present the MOdel of Organisational Change using Agents (MOCHA) as a means to formally specify, check and simulate organisations and their changes using agents. We define the s...