158 search results - page 27 / 32 » Model Checking Vs. Generalized Model Checking: Semantic Mini... |
LPNMR
2005
Springer
14 years 1 months ago
2005
Springer
Open answer set programming (OASP) is an extension of answer set programming where one may ground a program with an arbitrary superset of the program’s constants. We define a ...
FASE
2004
Springer
13 years 11 months ago
2004
Springer
Real-Time Maude is a language and tool supporting the formal specification and analysis of real-time and hybrid systems. The specification formalism is based on rewriting logic, em...
FORMATS
2003
Springer
14 years 25 days ago
2003
Springer
Probabilistic timed automata, a variant of timed automata extended with discrete probability distributions, is a specification formalism suitable for describing both nondeterminis...
HYBRID
2010
Springer
14 years 2 months ago
2010
Springer
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
SAGA
2005
Springer
14 years 1 months ago
2005
Springer
We consider temporal aspects of self-replication and evolvability – in particular, the massively asynchronous parallel and distributed nature of living systems. Formal views of s...