Stubborn sets for reduced state space generation

No abstract is available for this paper.

• Publication year

  1991

• Venue

  Applications and Theory of Petri Nets

• Publication date

  1991-06-01

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/3-540-53863-1_36
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Stubborn Sets for Reduced State Space Generation, Proc. 11th Internat. Conf. on Application and Theory of Petri Nets

  1990cited by this paper
• Baby TORAS Eats Philosophers But Thinks About Solitaire

  1990cited by this paper
• A stubborn attack on state explosion

  1990cited by this paper
• Eliminating Redundant Interleavings During Concurrent Program Verification

  1989cited by this paper
• Distributed cooperation with action systems

  1988cited by this paper
• Petri Nets: Central Models and Their Properties

  1986cited by this paper
• Predicate/Transition Nets

  1986cited by this paper
• Elementary Net Systems

  1986cited by this paper
• Applications of Temporal Logic to the Specification and Verification of Reactive Systems: A Survey of Current Trends

  1986cited by this paper
• Petri Nets: Basic Notions, Structure, Behaviour

  1986cited by this paper
• Place/Transition Systems

  1986cited by this paper
• Petri Nets

  1985cited by this paper
• A Theory of Communicating Sequential Processes

  1984cited by this paper
• The Correctness Problem in Computer Science

  1982cited by this paper
• Verification of Concurrent Systems: Function and Timing

  1982cited by this paper
• Aho, A. V. / Hopcroft, J. E. / Ullman, J. D., The Design and Analysis of Computer Algorithms. London‐Amsterdam‐Don Mills‐Sydney. Addison‐Wesley Publ. Comp. 1974 X, 470 S., $ 24,–

  1979cited by this paper
• The Design and Analysis of Computer Algorithms

  1974cited by this paper

• Symbolic Model Checking Using Intervals of Vectors

  2026cites this paper
• Checking Consistency of Event-driven Traces

  2025cites this paper
• Partial-Order Reduction Is Hard

  2025cites this paper
• Mining Diamonds in labeled Transition Systems

  2025cites this paper
• Enforcing Correctness of Collaborative Business Processes Using Plans

  2024cites this paper
• Revisiting Stateful Partial-Order Reduction

  2024cites this paper
• Modular rewritable Petri nets: An efficient model for dynamic distributed systems

  2024cites this paper
• Correctness Analysis of Cross-Organization Emergency Response Processes Based on Petri Nets

  2024cites this paper
• K∗ and Partial Order Reduction for Top-Quality Planning

  2023cites this paper
• Go2Pins: a framework for the LTL verification of Go programs (extended version)

  2023cites this paper
• Lifted Stackelberg Planning

  2023cites this paper
• QualSec: An Automated Quality-Driven Approach for Security Risk Identification in Cyber-Physical Production Systems

  2023cites this paper
• Dynamic Partial Order Reduction for Checking Correctness against Transaction Isolation Levels

  2023influential citation
• Verification of Multi-Agent Properties in Electronic Voting: A Case Study

  2023cites this paper
• Cycle and Commute: Rare-Event Probability Verification for Chemical Reaction Networks

  2023cites this paper
• Optimal dynamic partial order reduction with context-sensitive independence and observers

  2023cites this paper
• Partial-order reduction in reachability-based response-time analyses of limited-preemptive DAG tasks

  2023cites this paper
• Master research Internship Bibliographic report Bounded Unfolding-based Dynamic Partial Order Reduction

  2022cites this paper
• Checking Timed Büchi Automata Emptiness Using the Local-Time Semantics

  2022cites this paper
• Probabilistic Testing for Weak Memory Concurrency

  2022cites this paper
• Language-Preserving Reduction Rules for Block-Structured Workflow Nets

  2022cites this paper
• NetStack: A Game Approach to Synthesizing Consistent Network Updates

  2022cites this paper
• Automata-Driven Partial Order Reduction and Guided Search for LTL Model Checking

  2022cites this paper
• Towards Practical Partial Order Reduction for High-Level Formalisms

  2022cites this paper
• Development of Collaborative Business Processes: A Correctness Enforcement Approach

  2022cites this paper
• Abstractions for the local-time semantics of timed automata: a foundation for partial-order methods

  2022cites this paper
• Intent-based System Design with Efficient Search Using Partial-Order Reduction

  2022cites this paper
• A Pragmatic Approach to Stateful Partial Order Reduction

  2022cites this paper
• Partial Order Reduction for Planning

  2022cites this paper
• Stateful Dynamic Partial Order Reduction for Model Checking Event-Driven Applications that Do Not Terminate

  2021cites this paper
• On Weak Stubborn Sets in Classical Planning

  2021influential citation
• An Atom-Centric Perspective on Stubborn Sets

  2021cites this paper
• On Solving String Constraints

  2021cites this paper
• Symbolic Protocol Veri(cid:12)cation with Queue BDDs

  2021cites this paper
• Sleep Sets Meet Duplicate Elimination

  2021cites this paper
• Stubborn Set Reduction for Timed Reachability and Safety Games

  2021cites this paper
• Planning and SAT

  2021cites this paper
• Stubborn Sets Pruning for Privacy Preserving Planning

  2021cites this paper
• Revisiting Dominance Pruning in Decoupled Search

  2021cites this paper
• Stubborn Sets, Frozen Actions, and Fair Testing

  2021influential citation
• Automated Synthesis of Social Laws in STRIPS

  2020cites this paper
• Symbolic Execution Game Semantics

  2020cites this paper
• Reducing (to) the Ranks: Efficient Rank-based Büchi Automata Complementation (Technical Report)

  2020cites this paper
• A Correctness Checking Approach for Collaborative Business Processes in the Cloud

  2020cites this paper
• Recent Developments in the Design and Implementation of Programming Languages, Gabbrielli's Festschrift, Bologna, Italy, November 27, 2020

  2020cites this paper
• Reachability Graph of IOPT Petri Net Models Using CUDA C++ Parallel Application

  2020cites this paper
• A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

  2020cites this paper
• Improving swarming using genetic algorithms

  2020influential citation
• An Analysis of Dominance Pruning in Decoupled Search

  2020cites this paper
• Action-Based Model Checking: Logic, Automata, and Reduction

  2020cites this paper
• Determinism in Cyber-Physical Systems Specified by Interpreted Petri Nets

  2020cites this paper
• Inseguendo Fagiani Selvatici: Partial Order Reduction for Guarded Command Languages

  2020cites this paper
• Verification of Token-Scaling Models using an Under-Approximation

  2020cites this paper
• Portfolio Management in Explicit Model Checking

  2020cites this paper
• Local State Space Analysis to Assist Partial Order Reduction

  2020cites this paper
• Faster Enabledness-Updates for the Reachability Graph Computation

  2020cites this paper
• Technological Innovation for Life Improvement: 11th IFIP WG 5.5/SOCOLNET Advanced Doctoral Conference on Computing, Electrical and Industrial Systems, DoCEIS 2020, Costa de Caparica, Portugal, July 1–3, 2020, Proceedings

  2020cites this paper
• Reducing (to) the Ranks. Efficient Rank-based B¨uchi Automata Complementation (Technical Report)

  2020cites this paper
• Stateless software model checking parameterized with memory consistency models

  2020influential citation
• Büchi-Automata guided Partial Order Reduction for LTL

  2020cites this paper
• Transactions on Petri Nets and Other Models of Concurrency XIV

  2019cites this paper
• Development Methodology of Reconfigurable Robotic Systems. Application to BROS Project

  2019cites this paper
• Efficient state-space exploration for asynchronous distributed programs: Adapting unfolding-based dynamic partial order reduction to MPI programs. (Exploration efficace de l'espace d'état pour les programmes distribués asynchrones: Adaptation de l'UDPOR aux programes MPI)

  2019cites this paper
• GPGPU applied to support the construction of the state-space graphs of IOPT Petri net models

  2019cites this paper
• How Petri Net Theory Serves Petri Net Model Checking: A Survey

  2019cites this paper
• Verifying SystemC Using Intermediate Verification Language and Stateful Symbolic Simulation

  2019cites this paper
• Chapter Seven - Event-Based Concurrency: Applications, Abstractions, and Analyses

  2019cites this paper
• Language Inclusion for Finite Prime Event Structures

  2019cites this paper
• Verification of concurrent systems in a model-driven engineering workflow

  2019influential citation
• Formally designing and implementing cyber security mechanisms in industrial control networks.

  2019cites this paper
• The Winnability of Klondike Solitaire and Many Other Patience Games

  2019cites this paper
• Stubborn Set Reduction for Two-Player Reachability Games

  2019cites this paper
• Combining sequentialization-based verification of multi-threaded C programs with symbolic Partial Order Reduction

  2019cites this paper
• Optimal stateless model checking for reads-from equivalence under sequential consistency

  2019cites this paper
• Value-centric dynamic partial order reduction

  2019cites this paper
• Partially Bounded Context-Aware Verification

  2019cites this paper
• Dynamic Partial Order Reduction Under the Release-Acquire Semantics (Tutorial)

  2019cites this paper
• Squeezing State Spaces of (Attack-Defence) Trees

  2019cites this paper
• On the Relation between Star-Topology Decoupling and Petri Net Unfolding

  2019cites this paper
• Towards a Safe Development of Reconfigurable Robotic Systems

  2019cites this paper
• Strong Stubborn Set Pruning for Star-Topology Decoupled State Space Search

  2019cites this paper
• The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

  2019cites this paper
• Optimal context-sensitive dynamic partial order reduction with observers

  2019cites this paper
• Combining Parallel Emptiness Checks with Partial Order Reductions

  2019cites this paper
• Goal Recognition Design in Deterministic Environments

  2019cites this paper
• Taking Some Burden Off an Explicit CTL Model Checker

  2019cites this paper
• From Box Algebra to Interval Temporal Logic

  2019cites this paper
• Syntactic Partial Order Compression for Probabilistic Reachability

  2019cites this paper
• Deadlock prevention for service orchestration via controlled Petri nets

  2019cites this paper
• Stubborn versus structural reductions for Petri nets

  2019cites this paper
• Certifying planning systems : witnesses for unsolvability

  2019cites this paper
• Stateless model checking of the Linux kernel’s read–copy update (RCU)

  2019cites this paper
• Symmetry reduction in CSP model checking

  2019cites this paper
• POWVER Technical Report 2019-01 Title : Syntactic Partial Order Compression for Probabilistic Reachability

  2019influential citation
• Conditional dynamic partial order reduction and optimality results

  2019cites this paper
• Vérification formelle de systèmes d'information

  2018cites this paper
• Star-topology decoupled state space search

  2018cites this paper
• Advanced automata-based algorithms for program termination checking

  2018influential citation
• Petri Net Model Checking with LoLA 2

  2018cites this paper
• Simplification of CTL Formulae for Efficient Model Checking of Petri Nets

  2018cites this paper