A timed network is a parallel composition of timed automata synchronizing on common
actions. We develop a methodology that allows to use partial-order methods when solving …

We investigate a zone based approach for the reachability problem in timed automata. The
challenge is to alleviate the size explosion of the search space when considering networks …

Partial order reductions have been successfully applied to model checking of concurrent
systems and practical applications of the technique show nontrivial reduction in the size of …

The time Petri net (TPN) is a powerful tool for modeling, simulating, and verifying real-time
systems. Unfortunately, the state spaces of the time Petri net grow exponentially due to the …

We present a new language semantics for real-time concurrency. Its operational models are
higher-dimensional timed automata (HDTAs), a generalization of both higher-dimensional …

Partial order reductions have been successfully applied to model checking of concurrent
systems and practical applications of the technique show nontrivial reduction in the size of …

In LTL model checking, a system model is synchronized using the product construction with
Büchi automaton representing all runs that invalidate a given LTL formula. An existence of a …

We propose a partial order reduction method for reachability analysis of networks of timed
automata interacting via synchronous channel communication and via shared variables. Our …

Timed games are an essential formalism for modeling time-sensitive reactive systems that
must respond to uncontrollable events triggered by the (hostile) environment. However, the …

Timed games are an essential formalism for modeling timesensitive reactive systems that
must respond to uncontrollable events triggered by the (hostile) environment. However, the …