Sciweavers

198 search results - page 22 / 40
» Reachability on prefix-recognizable graphs
Sort
View
APN
2004
Springer
14 years 3 months ago
LTL Model Checking for Modular Petri Nets
We consider the problem of model checking modular Petri nets for the linear time logic LTL-X. An algorithm is presented which can use the synchronisation graph from modular analysi...
Timo Latvala, Marko Mäkelä
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 10 months ago
Strategy Improvement for Concurrent Safety Games
We consider concurrent games played on graphs. At every round of the game, each player simultaneously and independently selects a move; the moves jointly determine the transition ...
Krishnendu Chatterjee, Luca de Alfaro, Thomas A. H...
CIIA
2009
13 years 11 months ago
LCF-style for Secure Verification Platform based on Multiway Decision Graphs
Abstract. Formal verification of digital systems is achieved, today, using one of two main approaches: states exploration (mainly model checking and equivalence checking) or deduct...
Sa'ed Abed, Otmane Aït Mohamed
ISSTA
2012
ACM
12 years 8 days ago
Finding errors in multithreaded GUI applications
To keep a Graphical User Interface (GUI) responsive and active, a GUI application often has a main UI thread (or event dispatching thread) and spawns separate threads to handle le...
Sai Zhang, Hao Lü, Michael D. Ernst
AGTIVE
2003
Springer
14 years 3 months ago
Meta-Modelling, Graph Transformation and Model Checking for the Analysis of Hybrid Systems
Abstract. This paper presents the role of meta-modelling and graph transformation in our approach for the modelling, analysis and simulation of complex systems. These are made of c...
Juan de Lara, Esther Guerra, Hans Vangheluwe