Publication:5009453
From MaRDI portal
DOI10.4230/LIPIcs.CONCUR.2018.35MaRDI QIDQ5009453
Sławomir Lasota, Wojciech Czerwiński, Sebastian Muskalla, Roland Meyer, Prakash Saivasan, K. K. Narayan
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1702.05334
68Q85: Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.)
Related Items
Unnamed Item, Unnamed Item, Universality Problem for Unambiguous VASS, Certifying DFA bounds for recognition and separation, Certifying inexpressibility
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Multiset rewriting for the verification of depth-bounded processes with name binding
- Reduction and covering of infinite reachability trees
- Undecidable problems in unreliable computations.
- A note on well quasi-orderings for powersets
- Handling infinitely branching well-structured transition systems
- On the coverability and reachability languages of monotonic extensions of Petri nets
- Expand, enlarge and check: new algorithms for the coverability problem of WSTS
- Well-structured languages
- Separating Regular Languages with First-Order Logic
- Separating Regular Languages by Piecewise Testable and Unambiguous Languages
- What’s Decidable about Weak Memory Models?
- Separating Regular Languages by Locally Testable and Locally Threshold Testable Languages
- Multiply-Recursive Upper Bounds with Higman’s Lemma
- Forward Analysis for WSTS, Part II: Complete WSTS
- On the Verification of Timed Ad Hoc Networks
- Complexity Analysis of the Backward Coverability Algorithm for VASS
- Applying the Graph Minor Theorem to the Verification of Graph Transformation Systems
- Forward Analysis of Depth-Bounded Processes
- Comparing the Expressive Power of Well-Structured Transition Systems
- On Communicating Finite-State Machines
- On the Decidability of Grammar Problems
- Une extension d'un théorème de P. Jullien sur les âges de mots
- Noncanonical Extensions of Bottom-Up Parsing Techniques
- Soundness and Completeness of an Axiom System for Program Verification
- Foundations of BQO Theory
- Demystifying Reachability in Vector Addition Systems
- Invisible Pushdown Languages
- Separability of Reachability Sets of Vector Addition Systems
- Dynamic Networks of Timed Petri Nets
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- On the verification problem for weak memory models
- Nested interpolants
- Efficient Separability of Regular Languages by Subsequences and Suffixes
- Automata, Languages and Programming
- Antichains: A New Algorithm for Checking Universality of Finite Automata
- Verification, Model Checking, and Abstract Interpretation
- The ideal view on Rackoff's coverability technique
- Well-structured transition systems everywhere!
