259 search results - page 15 / 52 » Bounded Model Checking for Timed Automata |
ASWEC
2007
IEEE
15 years 3 months ago
2007
IEEE
Behavior Trees (BTs) are a graphical notation used for formalising functional requirements and have been successfully applied to several case studies. However, the notation curren...
HYBRID
1995
Springer
15 years 1 months ago
1995
Springer
Uppaal is a new tool suit for automatic veri cation of networks of timed automata. In this paper we describe the diagnostic model-checking feature of Uppaal and illustrates its use...
DLT
2008
14 years 11 months ago
2008
We consider multi-pushdown automata, a multi-stack extension of pushdown automata that comes with a constraint on stack operations: a pop can only be performed on the first non-emp...
ACSD
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
ENTCS
2006
14 years 9 months ago
2006
In previous work we have developed a syntactic reduction of repeated reachability to reachability for finite state systems. This may lead to simpler and more uniform proofs for mo...