322 search results - page 28 / 65 » Symbolic model checking of institutions |
IJCAI
2001
13 years 9 months ago
2001
Recent research has addressed the problem of planning in non-deterministic domains. Classical planning has also been extended to the case of goals that can express temporal proper...
CONCUR
2000
Springer
13 years 11 months ago
2000
Springer
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...
SIGSOFT
2009
ACM
14 years 8 months ago
2009
ACM
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
JALC
2006
13 years 7 months ago
2006
Membrane computing is a branch of molecular computing that aims to develop models and paradigms that are biologically motivated. It identifies an unconventional computing model, n...
FORMATS
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. In this paper, we propose a new framework for the parametric verification of time Petri nets with stopwatches controlled by inhibitor arcs. We first introduce an extensio...