Sciweavers

136
Voted
CONCUR
2000
Springer
15 years 7 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
129
Voted
CONCUR
2000
Springer
15 years 7 months ago
Reachability Analysis for Some Models of Infinite-State Transition Systems
We introduce some new models of infinite-state transition systems. The basic model, called a (reversal-bounded) counter machine (CM), is a nondeterministic finite automaton augment...
Oscar H. Ibarra, Tevfik Bultan, Jianwen Su
117
Voted
DATE
2010
IEEE
126views Hardware» more  DATE 2010»
15 years 7 months ago
Scenario-based analysis and synthesis of real-time systems using uppaal
Abstract. We propose an approach to scenario-based analysis and synthesis of real-time embedded systems. The inter-process behaviors of a system are modeled as a set of driving uni...
Kim Guldstrand Larsen, Shuhao Li, Brian Nielsen, S...
105
Voted
CONCUR
2000
Springer
15 years 7 months ago
On the Reachability Problem in Cryptographic Protocols
Roberto M. Amadio, Denis Lugiez
104
Voted
COMPSAC
2000
IEEE
15 years 7 months ago
Selection of Melody Lines for Music Databases
Michael Tang, Chi Lap Yip, Ben Kao