Well-abstracted transition systems: Application to FIFO automata.

DOI10.1016/S0890-5401(02)00027-5MaRDI QIDQ1401924zbMATH OpenFDO

Authors Alain Finkel, S. Purushothaman Iyer, Grégoire Sutre

Publication date 19 August 2003

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0890-5401(02)00027-5

zbMATH Keywords

AbstractionAccelerationFIFO automataFlatnessInfinite state systemsProtocolsRegular expressionsSymbolic representation

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• scientific article; zbMATH DE number 1759636
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• Systematic Acceleration in Regular Model Checking
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• Iterating transducers in the large (extended abstract)

Cites work

• A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters
• An introduction to FIFO nets - monogeneous nets: a subclass of FIFO nets
• Derivatives of Regular Expressions
• scientific article; zbMATH DE number 1577991 (Why is no real title available?)
• scientific article; zbMATH DE number 1670482 (Why is no real title available?)
• scientific article; zbMATH DE number 1670791 (Why is no real title available?)
• scientific article; zbMATH DE number 4043216 (Why is no real title available?)
• scientific article; zbMATH DE number 3560737 (Why is no real title available?)
• scientific article; zbMATH DE number 1361127 (Why is no real title available?)
• scientific article; zbMATH DE number 1500504 (Why is no real title available?)
• scientific article; zbMATH DE number 1500528 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 4115984 (Why is no real title available?)
• scientific article; zbMATH DE number 1392309 (Why is no real title available?)
• scientific article; zbMATH DE number 3293666 (Why is no real title available?)
• On Communicating Finite-State Machines
• On the equivalence, containment, and covering problems for the regular and context-free languages
• Parallel program schemata
• Proving safety properties of infinite state systems by compilation into Presburger arithmetic
• Reduction and covering of infinite reachability trees
• Symbolic model checking: \(10^{20}\) states and beyond
• Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
• Testing for unboundedness of fifo channels
• The complexity of logical theories
• Well-structured transition systems everywhere!

Cited in

(8)

• Abstractions for transition systems with applications to stubborn sets
• Verification of programs with half-duplex communication
• Bounded Parikh automata
• scientific article; zbMATH DE number 1759636 (Why is no real title available?)
• Verification of flat FIFO systems
• Acceleration in Convex Data-Flow Analysis
• Verification of Flat FIFO Systems
• Reasoning about reversal-bounded counter machines

This page was built for publication: Well-abstracted transition systems: Application to FIFO automata.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1401924)