Reasoning about systems with many processes
From MaRDI portal
Publication:4302808
DOI10.1145/146637.146681zbMath0799.68078OpenAlexW2036526834MaRDI QIDQ4302808
No author found.
Publication date: 21 August 1994
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/146637.146681
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
Structural Invariants for the Verification of Systems with Parameterized Architectures, Stubborn set reduction for timed reachability and safety games, Computing Parameterized Invariants of Parameterized Petri Nets, Model checking and abstraction to the aid of parameterized systems (a survey), Liveness of Parameterized Timed Networks, Parameterized model checking of rendezvous systems, Fair Petri nets and structural induction for rings of processes, Model Checking Parameterized Systems, Verification of agent navigation in partially-known environments, Compositional verification of smart contracts through communication abstraction, Context-free commutative grammars with integer counters and resets, Feature interaction detection by pairwise analysis of LTL properties -- A case study, Well-structured languages, On temporal logics with data variable quantifications: decidability and complexity, Synthesis of large dynamic concurrent programs from dynamic specifications, Unnamed Item, An invariant-based approach to the verification of asynchronous parameterized networks, Unnamed Item, Unnamed Item, Finding Cut-Offs in Leaderless Rendez-Vous Protocols is Easy, Model and program repair via group actions, Cut-off theorems for the \textit{PV}-model, Parameterized verification of time-sensitive models of ad hoc network protocols, Separators in Continuous Petri Nets, On the Efficient Computation of the Minimal Coverability Set for Petri Nets, Coefficient synthesis for threshold automata, Separators in continuous Petri nets, Controlling a random population, The polynomial complexity of vector addition systems with states, Parameterized model checking on the TSO weak memory model, Verification of component-based systems with recursive architectures, Unnamed Item, Parameterized model checking of weighted networks, Model checking parameterized asynchronous shared-memory systems, Unnamed Item, Automatic verification for a class of distributed systems, Finding cut-offs in leaderless rendez-vous protocols is easy, Directed reachability for infinite-state systems, Parametrized invariance for infinite state processes, Deciding bisimulation and trace equivalences for systems with many identical processes, An automatic abstraction technique for verifying featured, parameterised systems, Parameterized model checking of networks of timed automata with Boolean guards, Checking deadlock-freedom of parametric component-based systems, Unnamed Item, Nash equilibria in symmetric graph games with partial observation, Verification of parametric concurrent systems with prioritised FIFO resource management, An Assertional Language for the Verification of Systems Parametric in Several Dimensions, Networks of Processes with Parameterized State Space, Tutorial on Parameterized Model Checking of Fault-Tolerant Distributed Algorithms, On the \(\omega\)-language expressive power of extended Petri nets, Symbolic model checking with rich assertional languages, Ensuring completeness of symbolic verification methods for infinite-state systems, Unnamed Item, Unnamed Item, View abstraction for systems with component identities, Occam's razor applied to the Petri net coverability problem, Parameterized verification of coverability in infinite state broadcast networks, Verifying Parameterized taDOM+ Lock Managers, Lost in abstraction: monotonicity in multi-threaded programs, The Spotlight Principle, A novel approach to verifying context free properties of programs, Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems, Unnamed Item, Counter Abstraction in the CSP/FDR setting, Model Checking Parameterised Multi-token Systems via the Composition Method, Unbounded-Thread Program Verification using Thread-State Equations, MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS, Approximated parameterized verification of infinite-state processes with global conditions, Monotonic Abstraction in Action, Unnamed Item, Model checking of systems with many identical timed processes, Automated formal analysis and verification: an overview, Undecidable verification problems for programs with unreliable channels, Parameterised verification for multi-agent systems, Computing parameterized invariants of parameterized Petri nets
