Sciweavers

665 search results - page 35 / 133
» The Theory of Hybrid Automata
Sort
View
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
CADE
2006
Springer
14 years 12 days ago
A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms
We present a tool for checking the sufficient completeness of linear, order-sorted equational specifications modulo associativity, commutativity, and identity. Our tool treats this...
Joe Hendrix, José Meseguer, Hitoshi Ohsaki
FOSSACS
2000
Springer
14 years 8 days ago
On Recognizable Stable Trace Languages
We relate several models of concurrency introduced in the literature in order to extend classical Mazurkiewicz traces. These are mainly Droste's concurrent automata and Arnold...
Jean-François Husson, Rémi Morin
CAV
2004
Springer
93views Hardware» more  CAV 2004»
14 years 2 months ago
Symbolic Parametric Safety Analysis of Linear Hybrid Systems with BDD-Like Data-Structures
—We introduce a new BDD-like data structure called Hybrid-Restriction Diagrams (HRDs) for the representation and manipulation of linear hybrid automata (LHA) state-spaces and pre...
Farn Wang
ENTCS
2010
82views more  ENTCS 2010»
13 years 8 months ago
A Strict-Observational Interface Theory for Analysing Service Orchestrations
Service oriented computing is an accepted architectural style for developing large, distributed software systems. A particular promise of such architectures is service orchestrati...
Philip Mayer, Andreas Schroeder, Sebastian S. Baue...