Sciweavers

1246 search results - page 44 / 250
» Recursive Timed Automata
Sort
View
ARTS
1999
Springer
15 years 5 months ago
Verifying Progress in Timed Systems
In this paper we study the issue of progress for distributed timed systems modeled as the parallel composition of timed automata. We clarify the requirements of discrete progress (...
Stavros Tripakis
102
Voted
IANDC
2006
83views more  IANDC 2006»
15 years 21 days ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...
92
Voted
ITICSE
1997
ACM
15 years 4 months ago
Recursion and grammars for CS2
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science conc...
Viera K. Proulx
FSTTCS
2007
Springer
15 years 6 months ago
Automata and Logics for Timed Message Sequence Charts
Abstract. We provide a framework for distributed systems that impose timing constraints on their executions. We propose a timed model of communicating finite-state machines, which...
S. Akshay, Benedikt Bollig, Paul Gastin
ATVA
2005
Springer
111views Hardware» more  ATVA 2005»
15 years 6 months ago
Model Checking Prioritized Timed Automata
Abstract. Priorities are often used to resolve conflicts in timed systems. However, priorities are not directly supported by state-of-art model checkers. Often, a designer has to ...
Shang-Wei Lin, Pao-Ann Hsiung, Chun-Hsian Huang, Y...