scientific article; zbMATH DE number 7561314
From MaRDI portal
Publication:5090942
DOI10.4230/LIPIcs.FSTTCS.2018.9MaRDI QIDQ5090942
Publication date: 21 July 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finite model theory and its applications.
- Logical aspects of Cayley-graphs: the group case
- Graph minors. III. Planar tree-width
- The structure of the models of decidable monadic theories of graphs
- The theory of ends, pushdown automata, and second-order logic
- The computational complexity of logical theories
- The monoid of queue actions
- Unreliable channels are easier to verify than perfect channels
- Verifying programs with unreliable channels
- From automatic structures to automatic groups.
- On the structure of semigroups
- Automatic structures of bounded degree revisited
- An application of games to the completeness problem for formalized theories
- Formal Languages and Groups as Memory
- On Communicating Finite-State Machines
- The inclusion structure of partially lossy queue monoids and their trace submonoids
- Formal Models of Communicating Systems
- Mathematical Foundations of Computer Science 2003
- LOGICAL ASPECTS OF CAYLEY-GRAPHS: THE MONOID CASE
- The Power of Priority Channel Systems