Sciweavers

411 search results - page 74 / 83
» Timed Alternating-Time Temporal Logic
Sort
View
FAC
2000
94views more  FAC 2000»
13 years 9 months ago
Maximally Concurrent Programs
Typically, program design involves constructing a program P that implements a given specification S; that is, the set P of executions of P is a subset of the set S of executions s...
Rajeev Joshi, Jayadev Misra
FORTE
2009
13 years 7 months ago
A Model-Checking Approach for Service Component Architectures
We present a strategy for model-checking the correctness of service composition. We do so in the context of SRML, a formal modelling framework for service-oriented computing being ...
João Abreu, Franco Mazzanti, José Lu...
ICALP
2009
Springer
14 years 10 months ago
LTL Path Checking Is Efficiently Parallelizable
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
Lars Kuhtz, Bernd Finkbeiner
VMCAI
2009
Springer
14 years 4 months ago
LTL Generalized Model Checking Revisited
Given a 3-valued abstraction of a program (possibly generated using rogram analysis and predicate abstraction) and a temporal logic formula, generalized model checking (GMC) checks...
Patrice Godefroid, Nir Piterman
TIME
2008
IEEE
14 years 4 months ago
Representing Public Transport Schedules as Repeating Trips
The movement in public transport networks is organized according to schedules. The real-world schedules are specified by a set of periodic rules and a number of irregularities fr...
Romans Kasperovics, Michael H. Böhlen, Johann...