Pages that link to "Item:Q1960526"
From MaRDI portal
The following pages link to Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q1960526):
Displaying 20 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Automated analysis of fault-tolerance in distributed systems (Q816197) (← links)
- Reachability problems on reliable and lossy queue automata (Q825976) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Well-abstracted transition systems: Application to FIFO automata. (Q1401924) (← links)
- On iterating linear transformations over recognizable sets of integers (Q1884908) (← links)
- Flat Petri nets (invited talk) (Q2117150) (← links)
- A Kleene theorem and model checking algorithms for existentially bounded communicating automata (Q2496297) (← links)
- LTL over integer periodicity constraints (Q2503321) (← links)
- Verification of programs with half-duplex communication (Q2573635) (← links)
- Bounded Parikh automata (Q2841977) (← links)
- Model-checking CTL* over flat Presburger counter systems (Q2901199) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES (Q3021942) (← links)
- Abstract Interpretation of FIFO Replacement (Q3392924) (← links)
- Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations (Q4571986) (← links)
- Verifying quantitative temporal properties of procedural programs (Q5009429) (← links)
- (Q5129947) (← links)
- UNAMBIGUOUS CONSTRAINED AUTOMATA (Q5495422) (← links)
- Verification of Flat FIFO Systems (Q5875373) (← links)
