27 search results - page 5 / 6 » Decidability and Complexity Results for Timed Automata and S... |
DEDS
1998
13 years 7 months ago
1998
In this paper, timed Petri nets are used to model and control hybrid systems. Petri nets are used instead of finite automata primarily because of the advantages they offer in de...
DLOG
2007
13 years 9 months ago
2007
In Description Logics (DLs), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problems such as c...
TAPSOFT
1991
Springer
13 years 11 months ago
1991
Springer
Type inference can be phrased as constraint-solving over types. We consider an implicitly typed language equipped with recursive types, multiple inheritance, 1st order parametric ...
JAIR
2006
13 years 7 months ago
2006
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...
ENTCS
2007
13 years 7 months ago
2007
This paper gives an overview of recent advances in Real-Time Maude. Real-Time Maude extends the Maude rewriting logic tool to support formal specification and analysis of object-...