Sciweavers

115 search results - page 15 / 23
» Meta-Reasoning in Executable Temporal Logic
Sort
View
FUIN
2007
116views more  FUIN 2007»
13 years 10 months ago
Path Compression in Timed Automata
The paper presents a method of abstraction for timed systems. To extract an abstract model of a timed system we propose to use static analysis, namely a technique called path compr...
Agata Janowska, Wojciech Penczek
ASE
2010
129views more  ASE 2010»
13 years 11 months ago
Efficient monitoring of parametric context-free patterns
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
Patrick O'Neil Meredith, Dongyun Jin, Feng Chen, G...
FATES
2006
Springer
14 years 2 months ago
A Test Calculus Framework Applied to Network Security Policies
Abstract. We propose a syntax-driven test generation technique to auly derive abstract test cases from a set of requirements expressed in a linear temporal logic. Assuming that an ...
Yliès Falcone, Jean-Claude Fernandez, Laure...
BPM
2006
Springer
149views Business» more  BPM 2006»
14 years 26 days ago
Verifying BPEL Workflows Under Authorisation Constraints
Abstract. Business Process Execution Language (BPEL), or Web Services BPEL (WS-BPEL), is the standard for specifying workflow process definition using web services. Research on for...
Zhao Xiangpeng, Antonio Cerone, Padmanabhan Krishn...
ATAL
2010
Springer
14 years 1 hour ago
Reasoning about strategies of multi-agent programs
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
Mehdi Dastani, Wojciech Jamroga