1895 search results - page 23 / 379 » Using ATL for Checking Models |
123
click to vote
POLICY
2005
Springer
15 years 10 months ago
2005
Springer
Policy refinement is meant to derive lower-level policies from higher-level ones so that these more specific policies are better suited for use in different execution environments...
143
click to vote
TSE
2010
15 years 2 months ago
2010
— Web script crashes and malformed dynamically-generated web pages are common errors, and they seriously impact the usability of web applications. Current tools for web-page vali...
141
click to vote
ATVA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
139
click to vote
RISE
2004
Springer
15 years 9 months ago
2004
Springer
In this paper, we develop a symbolic representation for timed concurrent constraint (tccp) programs, which can be used for defining a lightweight model–checking algorithm for re...
125
click to vote
DEDS
2006
15 years 4 months ago
2006
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...