Sciweavers

259 search results - page 17 / 52
» Bounded Model Checking for Timed Automata
Sort
View
CAV
2004
Springer
152views Hardware» more  CAV 2004»
15 years 2 months ago
Abstract Regular Model Checking
Regular Tree Model Checking Ahmed Bouajjani, Peter Habermehl 1 LIAFA, University Paris 7, Case 7014, 2, place Jussieu, F-75251 Paris Cedex 05, France Adam Rogalewicz, Tom´aˇs Voj...
Ahmed Bouajjani, Peter Habermehl, Tomás Voj...
70
Voted
FORMATS
2005
Springer
15 years 3 months ago
Implementation of Timed Automata: An Issue of Semantics or Modeling?
Abstract. We examine to what extent implementation of timed automata can be achieved using the standard semantics and appropriate modeling, instead of introducing new semantics. We...
Karine Altisen, Stavros Tripakis
DEDS
2006
111views more  DEDS 2006»
14 years 9 months ago
Model Checking of Time Petri Nets Using the State Class Timed Automaton
In this paper, we propose a method for building the state class graph of a bounded time Petri net (TPN) as a timed automaton (TA), which we call the state class timed automaton. We...
Didier Lime, Olivier H. Roux
CONCUR
2008
Springer
14 years 11 months ago
Distributed Timed Automata with Independently Evolving Clocks
Abstract. We propose a model of distributed timed systems where each component is a timed automaton with a set of local clocks that evolve at a rate independent of the clocks of th...
S. Akshay, Benedikt Bollig, Paul Gastin, Madhavan ...
111
Voted
SPIN
2001
Springer
15 years 1 months ago
p2b: A Translation Utility for Linking Promela and Symbolic Model Checking (Tool Paper)
p2b is a research tool that translates Promela programs to boolean representations of the automata associated with them. These representations conform to the input syntax of the wi...
Michael Baldamus, Jochen Schröder-Babo