Sciweavers

231 search results - page 20 / 47
» Concurrent Reachability Games
Sort
View
CONCUR
2000
Springer
14 years 7 days ago
Model Checking with Finite Complete Prefixes Is PSPACE-Complete
Unfoldings are a technique for verification of concurrent and distributed systems introduced by McMillan. The method constructs a finite complete prefix, which can be seen as a sym...
Keijo Heljanko
CAV
2007
Springer
98views Hardware» more  CAV 2007»
14 years 2 months ago
UPPAAL-Tiga: Time for Playing Games!
In 2005 we proposed the first efficient on-the-fly algorithm for solving games based on timed game automata with respect to reachability and safety properties. The first prototy...
Gerd Behrmann, Agnès Cougnard, Alexandre Da...
IWMM
2010
Springer
211views Hardware» more  IWMM 2010»
13 years 10 months ago
Concurrent, parallel, real-time garbage-collection
With the current developments in CPU implementations, it becomes obvious that ever more parallel multicore systems will be used even in embedded controllers that require real-time...
Fridtjof Siebert
AAAI
2008
13 years 9 months ago
Querying Sequential and Concurrent Horn Transaction Logic Programs Using Tabling Techniques
In this poster we describe the tabling techniques for Sequential and Concurrent Horn Transaction Logic. Horn Transaction Logic is an extension of classical logic programming with ...
Paul Fodor
ASE
1999
126views more  ASE 1999»
13 years 8 months ago
Behaviour Analysis of Distributed Systems Using the Tracta Approach
Behaviour analysis should form an integral part of the software development process. This is particularly important in the design of concurrent and distributed systems, where comp...
Dimitra Giannakopoulou, Jeff Kramer, Shing-Chi Che...