Search

Your search keyword '"reachability problem"' showing total 1,499 results

Search Constraints

Start Over You searched for: Descriptor "reachability problem" Remove constraint Descriptor: "reachability problem"
1,499 results on '"reachability problem"'

Search Results

101. Bounded Memory Protocols and Progressing Collaborative Systems

102. Well-Structured Pushdown Systems

103. Lazy Abstractions for Timed Automata

104. Enhancing Approximations for Regular Reachability Analysis

105. Component Reconfiguration in the Presence of Conflicts

106. ω-Petri Nets

107. Complexity Analysis of Continuous Petri Nets

108. Asynchronously Communicating Visibly Pushdown Systems

109. Analysis of Communicating Authorization Policies

110. The Parametric Ordinal-Recursive Complexity of Post Embedding Problems

111. History-Register Automata

112. Verifying Concurrent Programs against Sequential Specifications

113. Mobile Membranes with Objects on Surface as Colored Petri Nets

114. A Petri Net Based Analysis of Deadlocks for Active Objects and Futures

117. IIS-Guided DFS for Efficient Bounded Reachability Analysis of Linear Hybrid Automata

118. Unidirectional Channel Systems Can Be Tested

119. Reachability Problem for Weak Multi-Pushdown Automata

120. Decidability Problems for Actor Systems

121. Verification of Petri Nets with Read Arcs

122. Automatic Information Flow Analysis of Business Process Models

123. Space and Energy Efficient Computation with DNA Strand Displacement Systems

124. A Solver for Reachability Modulo Theories

125. P- and T-Systems in the Nets-within-Nets-Formalism

126. Beyond Lassos: Complete SMT-Based Bounded Model Checking for Timed Automata

127. Cutting through Regular Post Embedding Problems

128. Automated Analysis of Infinite State Workflows with Access Control Policies

129. Reachability in One-Dimensional Controlled Polynomial Dynamical Systems

130. Model Checking: One Can Do Much More Than You Think!

131. Counter-Example Guided Fence Insertion under TSO

132. Reachability under Contextual Locking

135. Undecidability of the speed positiveness problem in reversible and complete Turing machines

136. Reachability problem considering running cost

139. Antichain-Based QBF Solving

140. The Complexity of Reversal-Bounded Model-Checking

141. Decidability of LTL for Vector Addition Systems with One Zero-Test

142. Vector Addition System Reversible Reachability Problem

143. The Reachability Problem for Vector Addition System with One Zero-Test

144. ReachFewL = ReachUL

145. Construction and SAT-Based Verification of Contextual Unfoldings

146. Automated Symbolic Analysis of ARBAC-Policies

147. Efficient Scenario Verification for Hybrid Automata

148. On Reachability for Hybrid Automata over Bounded Time

149. Dynamic Soundness in Resource-Constrained Workflow Nets

150. Vector Addition System Reachability Problem: A Short Self-contained Proof

Catalog

Books, media, physical & digital resources