scientific article; zbMATH DE number 813252
From MaRDI portal
Publication:4854001
zbMath0841.68084MaRDI QIDQ4854001
Publication date: 7 November 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
reachability analysiscompiler constructiontransition networksrecursive database queriesparsing automata
Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (9)
Abstract derivation of transitive closure algorithms ⋮ Modular materialisation of Datalog programs ⋮ Maximal and Maximum Transitive Relation Contained in a Given Binary Relation ⋮ Conflict-preserving abstraction of discrete event systems using annotated automata ⋮ Similarity analysis in Bayesian random partition models ⋮ Analysis of distributed consensus protocols with multi-equilibria under time-delays ⋮ Minimal ordering constraints for some families of variable symmetries ⋮ Covering arrays avoiding forbidden edges ⋮ Absorption for ABoxes
This page was built for publication:
