A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters

DOI10.1023/A:1009747629591zbMath0889.68025MaRDI QIDQ1378382

Laurent Fribourg, Hans Olsén

Publication date: 2 June 1998

Published in: Constraints (Search for Journal in Brave)

zbMATH Keywords

Petri netsPresburger arithmeticDatalog programs

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Logic programming (68N17)

Related Items (5)

Analysis and Transformation of Constrained Horn Clauses for Program Verification ⋮ Well-abstracted transition systems: Application to FIFO automata. ⋮ Unnamed Item ⋮ Reachability in Parameterized Systems: All Flavors of Threshold Automata ⋮ Transformations of logic programs on infinite lists

Uses Software

• Datalog

This page was built for publication: A decompositional approach for computing least fixed-points of datalog programs with \(\mathcal Z\)-counters