Sciweavers

63 search results - page 9 / 13
» The Complexity of Model Checking in Modal Event Calculi
Sort
View
ATAL
2005
Springer
15 years 3 months ago
On the dynamics of delegation, cooperation, and control: a logical account
We present dcl-pc: a dynamic logic of delegation and cooperation. The logical foundation of dcl-pc is cl-pc, a logic for reasoning about cooperation in which the powers of agents ...
Wiebe van der Hoek, Michael Wooldridge
POPL
2009
ACM
15 years 10 months ago
Types and higher-order recursion schemes for verification of higher-order programs
We propose a new verification method for temporal properties of higher-order functional programs, which takes advantage of Ong's recent result on the decidability of the mode...
Naoki Kobayashi
ER
2010
Springer
154views Database» more  ER 2010»
14 years 8 months ago
Modelling Functional Requirements in Spatial Design
Abstract. We demonstrate the manner in which high-level design requirements, e.g., as they correspond to the commonsensical conceptualisation of expert designers, may be formally s...
Mehul Bhatt, Joana Hois, Oliver Kutz, Frank Dylla
ACTA
2007
96views more  ACTA 2007»
14 years 9 months ago
Recursive Petri nets
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
Serge Haddad, Denis Poitrenaud
ICCD
1995
IEEE
109views Hardware» more  ICCD 1995»
15 years 1 months ago
Verifying the performance of the PCI local bus using symbolic techniques
Symbolic model checking is a successful technique for checking properties of large finite-state systems. This method has been used to verify a number of real-world hardware desig...
Sérgio Vale Aguiar Campos, Edmund M. Clarke...