Sciweavers

2062 search results - page 247 / 413
» Derivatives of Logical Formulas
Sort
View
171
Voted
ATVA
2006
Springer
133views Hardware» more  ATVA 2006»
15 years 10 months ago
Branching-Time Property Preservation Between Real-Time Systems
In the past decades, many formal frameworks (e.g. timed automata and temporal logics) and techniques (e.g. model checking and theorem proving) have been proposed to model a real-ti...
Jinfeng Huang, Marc Geilen, Jeroen Voeten, Henk Co...
168
Voted
CCIA
2006
Springer
15 years 10 months ago
Extending the BDI architecture with commitments
Abstract. In this paper, we describe a novel agent architecture for normative multiagent systems which is based on multi-context systems. It models the three modalities of Rao and ...
Dorian Gaertner, Pablo Noriega, Carles Sierra
185
Voted
ECBS
2006
IEEE
135views Hardware» more  ECBS 2006»
15 years 10 months ago
Model Checking Procedures for Infinite State Systems
The paper depicts experiments and results with preditraction based verification applied to infinite state Predicate abstraction is a method for automatic tion of abstract state sp...
Nikola Bogunovi, Edgar Pek
165
Voted
FSTTCS
2006
Springer
15 years 10 months ago
On Decidability of LTL Model Checking for Process Rewrite Systems
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...
Laura Bozzelli, Mojmír Kretínsk&yacu...
179
Voted
CONCUR
2000
Springer
15 years 10 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