A Non-Deterministic Multiset Query Language

DOI10.3233/FI-2021-2095MaRDI QIDQ5862341zbMATH OpenFDO

Authors Bartosz Zieliński

Publication date 9 March 2022

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2111.00218

zbMATH Keywords

business process modellingquery languagesterm rewriting

Mathematics Subject Classification ID

Computer science (68-XX)

Recommendations

• Nondeterministic query algorithms
• scientific article; zbMATH DE number 2080941
• A deductive language for querying inconsistent databases
• Query languages for data exchange: beyond unions of conjunctive queries
• scientific article; zbMATH DE number 1629811

Cites work

• A query language based on term matching and rewriting
• Conditional rewriting logic as a unified model of concurrency
• Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
• Decidability and complexity of Petri nets with unordered data
• Decidability Border for Petri Nets with Data: WQO Dichotomy Conjecture
• Formal verification of complex business processes based on high-level Petri nets
• scientific article; zbMATH DE number 1189278 (Why is no real title available?)
• scientific article; zbMATH DE number 3688776 (Why is no real title available?)
• scientific article; zbMATH DE number 1936671 (Why is no real title available?)
• scientific article; zbMATH DE number 1973125 (Why is no real title available?)
• scientific article; zbMATH DE number 2043522 (Why is no real title available?)
• scientific article; zbMATH DE number 3359806 (Why is no real title available?)
• Matching logic
• Matching logic: an alternative to Hoare/Floyd logic
• Model checking Petri nets with names using data-centric dynamic systems
• Model checking reconfigurable Petri nets with Maude
• Nominal Sets over Algebraic Atoms
• Relational transducers for electronic commerce
• Symbolic reachability analysis using narrowing and its application to verification of cryptographic protocols
• Termination of narrowing revisited
• The rewriting logic semantics project
• Transactions on Petri Nets and Other Models of Concurrency XII

Cited in

(2)

• M3Set -- A language for handling of distributed and persistent sets of objects
• A query language based on term matching and rewriting

Describes a project that uses

Uses Software

• Maude
• VERIFAS
• YAWL

This page was built for publication: A Non-Deterministic Multiset Query Language

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