Sciweavers

644 search results - page 115 / 129
» Precedence Automata and Languages
Sort
View
APLAS
2003
ACM
14 years 3 days ago
Resource Usage Verification
We investigate how to automatically verify that resources such as files are not used improperly or unsafely by a program. We employ a mixture of compile-time analysis and run-time ...
Kim Marriott, Peter J. Stuckey, Martin Sulzmann
DLT
2006
13 years 10 months ago
Finding Lower Bounds for Nondeterministic State Complexity Is Hard
We investigate the following lower bound methods for regular languages: The fooling set technique, the extended fooling set technique, and the biclique edge cover technique. It is ...
Hermann Gruber, Markus Holzer
FORTE
1996
13 years 9 months ago
Combined Application of SDL-92, OMT, MSC and TTCN
The paper describes the application of SDL-92[1] and OMT[2] to the design of a V5.x Access Network interface. While OMT is used to model the management aspects of the system, typi...
Eurico Inocêncio, Manuel Ricardo, Hitoshi Sa...
ACTA
2010
109views more  ACTA 2010»
13 years 8 months ago
On regular temporal logics with past
The IEEE standardized Property Specification Language, PSL for short, extends the well-known linear-time temporal logic LTL with so-called semi-extended regular expressions. PSL an...
Christian Dax, Felix Klaedtke, Martin Lange
JAIR
2006
110views more  JAIR 2006»
13 years 8 months ago
Modelling Mixed Discrete-Continuous Domains for Planning
In this paper we present pddl+, a planning domain description language for modelling mixed discrete-continuous planning domains. We describe the syntax and modelling style of pddl...
Maria Fox, Derek Long