Approximate Symbolic Reachability of Networks of Transition Systems

DOI10.1007/978-1-4020-6254-4_10MaRDI QIDQ3564025zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

state transition systems

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

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)

• Efficient computation and representation of large reachability sets for composed automata
• Under-approximation of reachability in multivalued asynchronous networks
• Complexity results for reachability in cooperating systems and approximated reachability by abstract over-approximations
• A new approach to upward-closed set backward reachability analysis
• scientific article; zbMATH DE number 2134685 (Why is no real title available?)
• scientific article; zbMATH DE number 4215383 (Why is no real title available?)
• A Fine-Grained Fullness-Guided Chaining Heuristic for Symbolic Reachability Analysis
• Symbolic Unfoldings for Networks of Timed Automata
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• A new algorithm for partitioned symbolic reachability analysis
• Checking static properties using conservative SAT approximations for reachability
• Enhancing approximations for regular reachability analysis
• Correct Hardware Design and Verification Methods
• Anonymized reachability of hybrid automata networks
• Tools and Algorithms for the Construction and Analysis of Systems

Describes a project that uses

Uses Software

• NuSMV

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)