Sciweavers

2465 search results - page 22 / 493
» Automata on Linear Orderings
Sort
View
LPAR
2007
Springer
14 years 1 months ago
The Complexity of Temporal Logic with Until and Since over Ordinals
Abstract. We consider the temporal logic with since and until modalities. This temporal logic is expressively equivalent over the class of ordinals to first-order logic thanks to ...
Stéphane Demri, Alexander Rabinovich
FOSSACS
2000
Springer
13 years 11 months 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
EUROMICRO
2007
IEEE
13 years 9 months ago
Analysis of BPEL Data Dependencies
BPEL is a de-facto standard language for web service orchestration. It is a challenge to test BPEL processes automatically because of the complex features of the language. The cur...
Yongyan Zheng, Jiong Zhou, Paul Krause
CAV
2004
Springer
93views Hardware» more  CAV 2004»
14 years 1 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
FM
1999
Springer
161views Formal Methods» more  FM 1999»
13 years 12 months ago
Formal Modeling and Analysis of Hybrid Systems: A Case Study in Multi-robot Coordination
Abstract. The design of controllers for hybridsystemsi.e. mixeddiscretecontinuous systems in a systematic manner remains a challenging task. In this case study, we apply formal m...
Rajeev Alur, Joel M. Esposito, M. Kim, Vijay Kumar...