Designing safe, reliable systems using scade
PA Abdulla, J Deneux, G Stålmarck, H Ågren… - … Applications of Formal …, 2006 - Springer
As safety critical systems increase in size and complexity, the need for efficient tools to verify
their reliability grows. In this paper we present a tool that helps engineers design safe and …
their reliability grows. In this paper we present a tool that helps engineers design safe and …
Multi-clock timed networks
PA Abdulla, J Deneux, P Mahata - Proceedings of the 19th …, 2004 - ieeexplore.ieee.org
We consider verification of safety properties for parameterized systems of timed processes,
so called timed networks. A timed network consists of a finite state process, called a controller…
so called timed networks. A timed network consists of a finite state process, called a controller…
Decidability and complexity results for timed automata via channel machines
This paper is concerned with the language inclusion problem for timed automata: given
timed automata ${\mathcal A}$ and ${\mathcal B}$ , is every word accepted by ${\mathcal B}$ …
timed automata ${\mathcal A}$ and ${\mathcal B}$ , is every word accepted by ${\mathcal B}$ …
Universality analysis for one-clock timed automata
PA Abdulla, J Deneux, J Ouaknine… - Fundamenta …, 2008 - content.iospress.com
This paper is concerned with the universality problem for timed automata: given a timed
automaton A, does A accept all timed words? Alur and Dill have shown that the universality …
automaton A, does A accept all timed words? Alur and Dill have shown that the universality …
Forward reachability analysis of timed Petri nets
We consider verification of safety properties for concurrent real-timed systems modelled as
timed Petri nets, by performing symbolic forward reachability analysis. We introduce a …
timed Petri nets, by performing symbolic forward reachability analysis. We introduce a …
Minimization of non-deterministic automata with large alphabets
There has been several attempts over the years to solve the bisimulation minimization problem
for finite automata. One of the most famous algorithms is the one suggested by Paige and …
for finite automata. One of the most famous algorithms is the one suggested by Paige and …
[PDF][PDF] Using Forward Reachability Analysis for Verification of Timed Petri Nets.
We consider verification of safety properties for concurrent real-timed systems modelled as
timed Petri nets, by performing symbolic forward reachability analysis. We introduce a …
timed Petri nets, by performing symbolic forward reachability analysis. We introduce a …
A common framework for design and safety analyses using formal methods
J Deneux, O Åkerlund - … Safety Assessment and Management: PSAM 7 …, 2004 - Springer
We consider safety assessment of complex systems including software components. This
paper describes a methodology for managing design, verification and impact of failures in an …
paper describes a methodology for managing design, verification and impact of failures in an …
[PS][PS] A formal semantics for UML statecharts
A David, J Deneux, J d'Orso - Dept. of Computer Systems, 2003 - it.uu.se
Ь ЭХФ а в й з з б Й гжб а з ж ди гв а в й гди з зи в ж н и в йзЙ ижнК Сиз з ж ди гв з гжб а о
л и Ч Ф ДЧ и гвзиж ви Ф в й Е йи из з б ви з ж а и бдж з К Чйж бги к и гв гж и з лгж з иг а иг …
л и Ч Ф ДЧ и гвзиж ви Ф в й Е йи из з б ви з ж а и бдж з К Чйж бги к и гв гж и з лгж з иг а иг …
Closed, open, and robust timed networks
PA Abdulla, J Deneux, P Mahata - Electronic Notes in Theoretical …, 2005 - Elsevier
We consider verification of safety properties for parameterized systems of timed processes,
so called timed networks. A timed network consists of a finite state process, called a controller…
so called timed networks. A timed network consists of a finite state process, called a controller…