Results 41 to 50 of about 24,416 (155)

Ariadne: Dominance checking of nonlinear hybrid automata using reachability analysis

, 2012
When designing embedded systems, often the need arises to model systems having a mixed discrete and continuous behavior. Such hybrid systems commonly consist of a discrete control part that operates in a continuous environment and may be represented by ...
T. Villa, BENVENUTI, Luca, A. Ferrari, Alberto Ferrari, Davide Bresolin, GERETTI, Luca, BRESOLIN, DAVIDE, Tiziano Villa, L. Benvenuti, L. Geretti, VILLA, Tiziano, P. Collins, Luca Benvenuti, Luca Geretti, Pieter Collins   +14 more
core   +1 more source

A Method Converting Multi-Properties Objective Reachability Problems to Multi-Objective Sets Reachability Problems over FKS

, 2022
In this paper, we focus on the symmetrical relationship between multi-properties objective reachability problems and multi-objective sets reachability problems over FKS based on Zadeh logic.
Xia Li, Zhaokai Li, Yingnan Gao, Zhanyou Ma   +3 more
core   +1 more source

Getting rid of store-buffers in TSO analysis

We propose an approach for reducing the TSO reachability analysis of concurrent programs to their SC reachability analysis, under some conditions on the explored behaviors.
Parlato, Gennaro, Bouajjani, Ahmed, Atig, Mohamed Faouzi   +2 more
core   +1 more source

Modular Decomposition-Based Graph Compression for Fast Reachability Detection

, 2019
Fast reachability detection is one of the key problems in graph applications. Most of the existing works focus on creating an index and answering reachability based on that index.
Wang, J, Anirban, S, Islam, MS
core   +1 more source

Properties of Distributed Time Arc Petri Nets

, 2001
In recent work we started a research on a distributed-timed extension of Petri nets where time parameters are associated with tokens and arcs carry constraints that qualify the age of tokens required for enabling.
Srba, J., Nielsen, M., Sassone, V.
core   +1 more source

A Decision Diagram Operation for Reachability

, 2023
Saturation is considered the state-of-the-art method for computing fixpoints with decision diagrams. We present a relatively simple decision diagram operation called REACH that also computes fixpoints. In contrast to saturation, it does not require a partitioning of the transition relation.
Brand, Sebastiaan, Bäck, Thomas, Laarman, Alfons   +2 more
openaire   +5 more sources

Reachability in pushdown register automata [PDF]

, 2017
We investigate reachability in pushdown automata over infinite alphabets. We show that, in terms of reachability/emptiness, these machines can be faithfully represented using only 3r elements of the alphabet, where r is the number of registers.
Tzevelekos, Nikos, Ramsay, S, Tzevelekos, N, Tzevelekos, N., A.S. Murawski, Murawski, Andrzrej, Murawski, AS, Ramsay , S. J., Ramsay, Steven, Murawski, Andrzej S., S.J. Ramsay, Ramsay, SJ, N. Tzevelekos   +12 more
core   +1 more source

\omega²-well Quasi-Orderings In Reachability Analysis

, 1999
The usefulness of well quasi-orderings for some aspects of verification of infinitestate systems was already recognized by some researchers. This note shows that a finer notion, namely that of !
Reachability Analysis, Petr Jancar
core  

Linear Ranking with Reachability [PDF]

, 2005
We present a complete method for synthesizing lexicographic linear ranking functions supported by inductive linear invariants for loops with linear guards and transitions. Proving termination via linear ranking functions often requires invariants; yet invariant generation is expensive.
Aaron R. Bradley, Zohar Manna, Henny B. Sipma   +2 more
openaire   +1 more source

Compositional Detection of Zeno Behaviour in Timed Automata [PDF]

, 2006
The formal specification and verification of real-time systems are difficult tasks, given the complexity of these systems and the safety-critical role they usually play. Timed Automata, and real-time model-checking, have emerged as powerful tools to deal
Howard Bowman, Gomez, Rodolfo, Bowman, Howard   +2 more
core