5863 search results - page 377 / 1173 » On Model-Checking of P Systems |
239
click to vote
FORMATS
2006
Springer
15 years 11 months ago
2006
Springer
Recently, a new approach to the symbolic model checking of timed automata based on a partial order semantics was introduced, which relies on event zones that use vectors of event o...
198
click to vote
IIWAS
2008
15 years 9 months ago
2008
In a service-oriented architecture, systems communicate by exchanging messages. In this work, we propose a formal model based on OCL-constrained UML Class diagrams and a methodolo...
194
click to vote
IJCAI
2007
15 years 9 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
186
click to vote
FORTE
2004
15 years 9 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...
212
click to vote
PDSE
1998
15 years 9 months ago
1998
The development of correct OO distributed software is a daunting task as soon as the distributed interactions are not trivial. This is due to the inherent complexity of distribute...