Sciweavers

941 search results - page 66 / 189
» History-Dependent Petri Nets
Sort
View
MSE
2002
IEEE
122views Hardware» more  MSE 2002»
15 years 4 months ago
Modeling and Analyzing SMIL Documents in SAM
A composite multimedia object has specific timing relationships among the different types of component media. Coordinating the real-time presentation of information and maintaini...
Huiqun Yu, Xudong He, Shu Gao, Yi Deng
ASP
2001
Springer
15 years 4 months ago
Answer Set Programming and Bounded Model Checking
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. This is an extension of earlier w...
Keijo Heljanko, Ilkka Niemelä
APN
2009
Springer
15 years 3 months ago
P-Semiflow Computation with Decision Diagrams
We present a symbolic method for p-semiflow computation, based on zero-suppressed decision diagrams. Both the traditional explicit methods and our new symbolic method rely on Farka...
Gianfranco Ciardo, Galen Mecham, Emmanuel Paviot-A...
APN
2000
Springer
15 years 3 months ago
Efficient Symbolic State-Space Construction for Asynchronous Systems
Many techniques for the verification of reactive systems rely on the analysis of their reachable state spaces. In this paper, a new algorithm for the symbolic generation of the sta...
Gianfranco Ciardo, Gerald Lüttgen, Radu Simin...
CONCUR
2000
Springer
15 years 3 months 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