Pages that link to "Item:Q1920224"
From MaRDI portal
The following pages link to Decidability of model checking for infinite-state concurrent systems (Q1920224):
Displaying 43 items.
- Forward analysis and model checking for trace bounded WSTS (Q290914) (← links)
- Undecidability of accordance for open systems with unbounded message queues (Q402353) (← links)
- A decidability result for the model checking of infinite-state systems (Q438572) (← links)
- Specification and encoding of transaction interaction properties (Q453491) (← links)
- Linear temporal logic symbolic model checking (Q465680) (← links)
- Dynamical systems in categories (Q513904) (← links)
- On the complexity of checking semantic equivalences between pushdown processes and finite-state processes (Q988552) (← links)
- Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
- A theory of structural stationarity in the \(\pi\)-calculus (Q1014276) (← links)
- Proving properties of dynamic process networks (Q1383156) (← links)
- Undecidable problems in unreliable computations. (Q1401309) (← links)
- Analysis issues in Petri nets with inhibitor arcs (Q1606123) (← links)
- Counter machines and verification problems. (Q1853523) (← links)
- Process rewrite systems. (Q1854328) (← links)
- Sequent calculi for process verification: Hennessy-Milner logic for an arbitrary GSOS (Q1878715) (← links)
- Rabin's theorem in the concurrency setting: a conjecture (Q2253187) (← links)
- A generic framework for checking semantic equivalences between pushdown automata and finite-state automata (Q2409577) (← links)
- Incompleteness of states w.r.t. traces in model checking (Q2492186) (← links)
- Characterizing EF and EX tree logics (Q2503041) (← links)
- Model checking for process rewrite systems and a class of action-based regular properties (Q2503332) (← links)
- State space analysis of Petri nets with relation-algebraic methods (Q2518607) (← links)
- Decidable first-order transition logics for PA-processes (Q2575856) (← links)
- On symbolic verification of weakly extended PAD (Q2866343) (← links)
- Concurrency makes simple theories hard (Q2904757) (← links)
- Program Specialization for Verifying Infinite State Systems: An Experimental Evaluation (Q3003492) (← links)
- Forward Analysis and Model Checking for Trace Bounded WSTS (Q3011881) (← links)
- VERIFICATION IN QUEUE-CONNECTED MULTICOUNTER MACHINES (Q3021942) (← links)
- Bounded model checking liveness on basic parallel processes (Q3386301) (← links)
- ON COUNTER MACHINES, REACHABILITY PROBLEMS, AND DIOPHANTINE EQUATIONS (Q3526543) (← links)
- REACHABILITY ANALYSIS IN VERIFICATION VIA SUPERCOMPILATION (Q3526545) (← links)
- Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems (Q3608784) (← links)
- Stop-transitions of Petri Nets* (Q4988957) (← links)
- Model Checking a Logic for True Concurrency (Q5034222) (← links)
- ON REACHABILITY AND SAFETY IN INFINITE-STATE SYSTEMS (Q5249293) (← links)
- Generalization strategies for the verification of infinite state systems (Q5299583) (← links)
- Decidability of Weak Bisimilarity for a Subset of BPA (Q5415622) (← links)
- Survey on Parameterized Verification with Threshold Automata and the Byzantine Model Checker (Q5883751) (← links)
- Decidability of model checking with the temporal logic EF (Q5941100) (← links)
- Deciding bisimulation-like equivalences with finite-state processes (Q5941202) (← links)
- Weak bisimilarity between finite-state systems and BPA or normed BPP is decidable in polynomial time (Q5958326) (← links)
- Model checking PA-processes (Q6044127) (← links)
- Constrained properties, semilinear systems, and Petri nets (Q6162100) (← links)
- On the complexity of the linear-time μ-calculus for Petri Nets (Q6487371) (← links)
