Reasoning about systems with many processes
From MaRDI portal
Recommendations
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Model checking of systems with many identical timed processes
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
- Automatic verification for a class of distributed systems
Cited in
(98)- Approximated parameterized verification of infinite-state processes with global conditions
- A model and temporal proof system for networks of processes
- Automatic verification methods for finite state systems. International workshop, Grenoble, France, June 12-14, 1989. Proceedings
- Automatizing parametric reasoning on distributed concurrent systems
- Fair Petri nets and structural induction for rings of processes
- Parameterized model checking of rendezvous systems
- On verification of parallel message-passing processes
- Model checking of systems with many identical timed processes
- Model checking and abstraction to the aid of parameterized systems (a survey)
- Parameterized model checking of networks of timed automata with Boolean guards
- Checking deadlock-freedom of parametric component-based systems
- View abstraction for systems with component identities
- Parameterized verification of coverability in infinite state broadcast networks
- Computing parameterized invariants of parameterized Petri nets
- Verification of agent navigation in partially-known environments
- Compositional verification of smart contracts through communication abstraction
- Controlling a random population
- The polynomial complexity of vector addition systems with states
- Parameterized model checking on the TSO weak memory model
- Finding cut-offs in leaderless rendez-vous protocols is easy
- Directed reachability for infinite-state systems
- A novel approach to verifying context free properties of programs
- Parameterized model checking of weighted networks
- Verification of parametric concurrent systems with prioritised FIFO resource management
- On the \(\omega\)-language expressive power of extended Petri nets
- Parameterised verification for multi-agent systems
- Context-free commutative grammars with integer counters and resets
- Well-structured languages
- Verification of component-based systems with recursive architectures
- 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 extensions of Petri nets: forward and backward search revisited
- Automated formal analysis and verification: an overview
- Model checking parameterized systems
- Parameterized verification of coverability in well-structured broadcast networks
- On temporal logics with data variable quantifications: decidability and complexity
- Liveness of parameterized timed networks
- Synthesis of large dynamic concurrent programs from dynamic specifications
- On the Efficient Computation of the Minimal Coverability Set for Petri Nets
- Temporal Verification of Fault-Tolerant Protocols
- MONOTONIC ABSTRACTION: ON EFFICIENT VERIFICATION OF PARAMETERIZED SYSTEMS
- Undecidable verification problems for programs with unreliable channels
- An assertional language for the verification of systems parametric in several dimensions (preliminary results)
- Networks of processes with parameterized state space
- Parametrized invariance for infinite state processes
- Controlling a random population
- Structural Invariants for the Verification of Systems with Parameterized Architectures
- Computing Parameterized Invariants of Parameterized Petri Nets
- scientific article; zbMATH DE number 7559502 (Why is no real title available?)
- scientific article; zbMATH DE number 7559504 (Why is no real title available?)
- Controlling a population
- Automatic verification for a class of distributed systems
- scientific article; zbMATH DE number 7407775 (Why is no real title available?)
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- scientific article; zbMATH DE number 7089067 (Why is no real title available?)
- View abstraction -- a tutorial (invited paper)
- Nash equilibria in symmetric graph games with partial observation
- Verifying Parameterized taDOM+ Lock Managers
- The Spotlight Principle
- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
- Monotonic Abstraction in Action
- Reconfiguration and message losses in parameterized broadcast networks
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Symbolic model checking with rich assertional languages
- Ensuring completeness of symbolic verification methods for infinite-state systems
- An invariant-based approach to the verification of asynchronous parameterized networks
- 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
- Separators in Continuous Petri Nets
- Coefficient synthesis for threshold automata
- Separators in continuous Petri nets
- Deciding bisimulation and trace equivalences for systems with many identical processes
- Parameterized verification under TSO with data types
- Fast termination and workflow nets
- Automated temporal reasoning about reactive systems
- Abduction of trap invariants in parameterized systems
- Counter abstraction for regular open teams
- Deciding bisimulation and trace equivalences for systems with many identical processes
- Parameterized complexity of safety of threshold automata
- Phase-bounded broadcast networks over topologies of communication
- The complexity of linear temporal verification for continuous counter systems
- Coverability in VASS revisited: improving Rackoff's bounds to obtain conditional optimality
- Automatic WSTS-based repair and deadlock detection of parameterized systems
- Parameterized model-checking of discrete-timed networks and symmetric-broadcast systems
- Model-checking parametric lock-sharing systems against regular constraints
- Monus semantics in vector addition systems with states
- Safety analysis of parameterised networks with non-blocking rendez-vous
- Decidability and complexity of decision problems for affine continuous vass
- Model and program repair via group actions and structure unwinding
- Improved lower bounds for reachability in vector addition systems
- Lost in abstraction: monotonicity in multi-threaded programs
- Wait-only broadcast protocols are easier to verify
- Stubborn set reduction for timed reachability and safety games
- Feature interaction detection by pairwise analysis of LTL properties -- A case study
- Parameterized verification of time-sensitive models of ad hoc network protocols
- An automatic abstraction technique for verifying featured, parameterised systems
This page was built for publication: Reasoning about systems with many processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4302808)
