Reasoning about networks with many identical finite state processes
From MaRDI portal
(Redirected from Publication:921983)
Cites work
- scientific article; zbMATH DE number 3852428 (Why is no real title available?)
- scientific article; zbMATH DE number 3913662 (Why is no real title available?)
- scientific article; zbMATH DE number 3913664 (Why is no real title available?)
- scientific article; zbMATH DE number 3688686 (Why is no real title available?)
- scientific article; zbMATH DE number 3757688 (Why is no real title available?)
- A calculus of communicating systems
- A multiprocess network logic with temporal and spatial modalities
- Automatic Verification of Sequential Circuits Using Temporal Logic
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Characterizing finite Kripke structures in propositional temporal logic
- Invariance and non-determinacy
- The complexity of propositional linear temporal logics
- “Sometimes” and “not never” revisited
Cited in
(29)- Structural Invariants for the Verification of Systems with Parameterized Architectures
- On Reasoning About Rings
- Parameterized model checking of rendezvous systems
- The Birth of Model Checking
- Parametrized invariance for infinite state processes
- On temporal logics with data variable quantifications: decidability and complexity
- Proving Ptolemy Right: The Environment Abstraction Framework for Model Checking Concurrent Systems
- Deadlock analysis in networks of communicating processes
- Model checking parameterized systems
- An automatic abstraction technique for verifying featured, parameterised systems
- Automatic verification of a class of systolic circuits
- Efficient SAT-based bounded model checking for software verification
- Deciding bisimulation and trace equivalences for systems with many identical processes
- Computing Parameterized Invariants of Parameterized Petri Nets
- Synthesis of large dynamic concurrent programs from dynamic specifications
- Model checking transactional memories
- Computing parameterized invariants of parameterized Petri nets
- Tutorial on parameterized model checking of fault-tolerant distributed algorithms
- Parameterised verification for multi-agent systems
- Automatic verification for a class of distributed systems
- Networks of processes with parameterized state space
- Symbolic model checking with rich assertional languages
- Model checking parameterised multi-token systems via the composition method
- Parameterized model checking on the TSO weak memory model
- Checking extended CTL properties using guarded quotient structures
- Verification of component-based systems with recursive architectures
- Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems
- Checking deadlock-freedom of parametric component-based systems
- Priority systems with many identical processes
This page was built for publication: Reasoning about networks with many identical finite state processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q921983)
