Approximate Symbolic Reachability of Networks of Transition Systems
From MaRDI portal
Publication:3564025
DOI10.1007/978-1-4020-6254-4_10zbMATH Open1214.68038OpenAlexW2101260249MaRDI QIDQ3564025FDOQ3564025
Authors: Sudeep Juvekar, Ankur Taly, Varun Kanade, Supratik Chakraborty 
Publication date: 2 June 2010
Published in: Next Generation Design and Verification Methodologies for Distributed Embedded Control Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-1-4020-6254-4_10
Recommendations
- scientific article; zbMATH DE number 1629965
- Symbolic reachability graph and partial symmetries
- Symbolic and compositional reachability for timed automata
- scientific article; zbMATH DE number 1864589
- CONCUR 2005 – Concurrency Theory
- scientific article; zbMATH DE number 1670517
- Symbolic Reachability Analysis of Integer Timed Petri Nets
- Symbolic optimal reachability in weighted timed automata
- scientific article; zbMATH DE number 1956633
- Symbolic Unfoldings for Networks of Timed Automata
Cited In (15)
- Enhancing approximations for regular reachability analysis
- Under-approximation of reachability in multivalued asynchronous networks
- A new algorithm for partitioned symbolic reachability analysis
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
- Complexity results for reachability in cooperating systems and approximated reachability by abstract over-approximations
- A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis
- Correct Hardware Design and Verification Methods
- Checking static properties using conservative SAT approximations for reachability
- A new approach to upward-closed set backward reachability analysis
- Efficient computation and representation of large reachability sets for composed automata
- Title not available (Why is that?)
- Tools and Algorithms for the Construction and Analysis of Systems
- Symbolic Unfoldings for Networks of Timed Automata
- Title not available (Why is that?)
- Anonymized reachability of hybrid automata networks
Uses Software
This page was built for publication: Approximate Symbolic Reachability of Networks of Transition Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3564025)
