Sciweavers

2465 search results - page 13 / 493
» Automata on Linear Orderings
Sort
View
AIIA
2005
Springer
14 years 1 months ago
Automata Slicing for Diagnosing Discrete-Event Systems with Partially Ordered Observations
Abstract. When dealing with real systems, it is unrealistic to suppose that observations can be totally ordered according to their emission dates. The partially ordered observation...
Alban Grastien, Marie-Odile Cordier, Christine Lar...
CORR
2007
Springer
151views Education» more  CORR 2007»
13 years 7 months ago
The Complexity of Games on Higher Order Pushdown Automata
Abstract. We prove an n-exptime lower bound for the problem of deciding the winner in a reachability game on Higher Order Pushdown Automata (HPDA) of level n. This bound matches th...
Thierry Cachat, Igor Walukiewicz
PTS
2007
99views Hardware» more  PTS 2007»
13 years 9 months ago
Testing Input/Output Partial Order Automata
Abstract. We propose an extension of the Finite State Machine framework in distributed systems, using input/output partial order automata (IOPOA). In this model, transitions can be...
Stefan Haar, Claude Jard, Guy-Vincent Jourdan
TACAS
2010
Springer
342views Algorithms» more  TACAS 2010»
14 years 2 months ago
SAT Based Bounded Model Checking with Partial Order Semantics for Timed Automata
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Janusz Malinowski, Peter Niebert
ENTCS
2006
173views more  ENTCS 2006»
13 years 7 months ago
Concurrent LSC Verification: On Decomposition Properties of Partially Ordered Symbolic Automata
Partially Ordered Symbolic Automata (POSAs) are used as the semantical foundation of visual formalisms like the scenario based language of Live Sequence Charts (LSCs). To check whe...
Tobe Toben, Bernd Westphal