7209 search results - page 483 / 1442 » Software Engineering for Multi-Agent Systems |
131
Voted
FSTTCS
2006
Springer
15 years 7 months ago
2006
Springer
We establish a decidability boundary of the model checking problem for infinite-state systems defined by Process Rewrite Systems (PRS) or weakly extended Process Rewrite Systems (w...
137
Voted
ISSTA
1998
ACM
15 years 7 months ago
1998
ACM
We present various techniques for improving the time and space efficiency of symbolic model checking for system requirements specified as synchronous finite state machines. We use...
136
Voted
FSTTCS
2010
Springer
15 years 1 months ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
120
Voted
ICSE
2003
IEEE-ACM
16 years 3 months ago
2003
IEEE-ACM
The paper introduces a system model called the probabilistic asynchronous model which characterises the context in which many practical and the Internet-based applications are bui...
112
Voted
CISIS
2010
IEEE
15 years 10 months ago
2010
IEEE
Context has been applied to a broad range of domains and systems ranging from location-based tourist applications to motion capture. An area relatively under-represented in the li...