On the public citation graph

A stubborn attack on state explosion

https://doi.org/10.1007/bfb0023729
0 signed · 126 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-51285-3_35openalex-snapshot
Eliminating redundant interleavings during concurrent program verification
inferredcites →https://doi.org/10.1007/bfb0027047openalex-snapshot
Applications of temporal logic to the specification and verification of reactive systems: A survey of current trends
inferredcites →https://doi.org/10.1145/318593.318622openalex-snapshot
Checking that finite state concurrent programs satisfy their linear specification
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/828.833openalex-snapshot
A Theory of Communicating Sequential Processes

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470611012.ch3openalex-snapshot
An Introduction to Model Checking
inferred← citeshttps://doi.org/10.1002/stvr.280openalex-snapshot
Improved verification of linear‐time properties within fairness: weakly continuation‐closed behaviour abstractions computed from trace reductions
inferred← citeshttps://doi.org/10.1007/11537328_10openalex-snapshot
Improving Spin’s Partial-Order Reduction for Breadth-First Search
inferred← citeshttps://doi.org/10.1007/11537328_11openalex-snapshot
Sound Transaction-Based Reduction Without Cycle Detection
inferred← citeshttps://doi.org/10.1007/11539452_38openalex-snapshot
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/11560548_25openalex-snapshot
Symbolic Partial Order Reduction for Rule Based Transition Systems
inferred← citeshttps://doi.org/10.1007/11591962_3openalex-snapshot
A Model-Based Approach to Formal Specification and Verification of Embedded Systems Using Colored Petri Nets
inferred← citeshttps://doi.org/10.1007/11691617_15openalex-snapshot
Exploiting Symmetry and Transactions for Partial Order Reduction of Rule Based Specifications
inferred← citeshttps://doi.org/10.1007/11691617_16openalex-snapshot
Partial-Order Reduction for General State Exploring Algorithms
inferred← citeshttps://doi.org/10.1007/11784180_13openalex-snapshot
State Space Reduction of Rewrite Theories Using Invisible Transitions
inferred← citeshttps://doi.org/10.1007/3-540-44988-4_17openalex-snapshot
Improved Question-Guided Stubborn Set Methods for State Properties
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_1openalex-snapshot
Model Checking: A Tutorial Overview
inferred← citeshttps://doi.org/10.1007/3-540-46017-9_10openalex-snapshot
Partial Order Reduction in Directed Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-47849-3_35openalex-snapshot
A persistent-Set Approach to Abstract State-Space Construction in Verification
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_30openalex-snapshot
Partial Order Reduction for Model Checking of Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_36openalex-snapshot
Refining dependencies improves partial-order verification methods (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-62034-6_54openalex-snapshot
Trace consistency and inevitability
inferred← citeshttps://doi.org/10.1007/3-540-62503-8_17openalex-snapshot
A non-standard semantics for generating reduced transition systems
inferred← citeshttps://doi.org/10.1007/3-540-63875-x_43openalex-snapshot
Rules for trace consistent reasoning
inferred← citeshttps://doi.org/10.1007/978-3-030-45231-5_25openalex-snapshot
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-030-62822-2_5openalex-snapshot
Randomized Refinement Checking of Timed I/O Automata
inferred← citeshttps://doi.org/10.1007/978-3-030-94583-1_20openalex-snapshot
Stateful Dynamic Partial Order Reduction for Model Checking Event-Driven Applications that Do Not Terminate
inferred← citeshttps://doi.org/10.1007/978-3-031-08679-3_11openalex-snapshot
LTL under reductions with weaker conditions than stutter-invariance
inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_19openalex-snapshot
Experimenting with Stubborn Sets on Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_24openalex-snapshot
MightyPPL: Model Checking MITL with Past and Pnueli Modalities
inferred← citeshttps://doi.org/10.1007/978-3-319-32582-8_4openalex-snapshot
Using SPIN for the Optimized Scheduling of Discrete Event Systems in Manufacturing
inferred← citeshttps://doi.org/10.1007/978-3-319-46520-3_23openalex-snapshot
Partial-Order Reduction for GPU Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-319-47677-3_16openalex-snapshot
Exploiting Symmetry for Efficient Verification of Infinite-State Component-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-51046-0_6openalex-snapshot
Abstractions for Transition Systems with Applications to Stubborn Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-53354-4_2openalex-snapshot
Two Model Checking Approaches to Branch-and-Bound Optimization of a Flow Production System
inferred← citeshttps://doi.org/10.1007/978-3-319-57708-1_8openalex-snapshot
A Proof System for MSVL Programs in Coq
inferred← citeshttps://doi.org/10.1007/978-3-319-77935-5_20openalex-snapshot
Stubborn Transaction Reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-95582-7_31openalex-snapshot
Compositional Reasoning for Shared-Variable Concurrent Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-98938-9_16openalex-snapshot
State-of-the-Art Model Checking for B and Event-B Using ProB and LTSmin
inferred← citeshttps://doi.org/10.1007/978-3-540-24721-0_24openalex-snapshot
Translating Software Designs for Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_18openalex-snapshot
Application of Coloured Petri Nets in System Development
inferred← citeshttps://doi.org/10.1007/978-3-540-27860-3_17openalex-snapshot
Detecting Temporal Logic Predicates in Distributed Programs Using Computation Slicing
inferred← citeshttps://doi.org/10.1007/978-3-540-30182-0_58openalex-snapshot
Stubborn Sets for Priority Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_19openalex-snapshot
Efficient Path Finding with the Sweep-Line Method Using External Storage
inferred← citeshttps://doi.org/10.1007/978-3-540-45069-6_32openalex-snapshot
Model Checking Conformance with Scenario-Based Specifications
inferred← citeshttps://doi.org/10.1007/978-3-540-45236-2_33openalex-snapshot
Watchdog Transformations for Property-Oriented Model-Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-70952-7_6openalex-snapshot
On Combining Partial Order Reduction with Fairness Assumptions
inferred← citeshttps://doi.org/10.1007/978-3-540-73370-6_7openalex-snapshot
Some Solutions to the Ignoring Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-74792-5_5openalex-snapshot
Rebeca: Theory, Applications, and Tools
inferred← citeshttps://doi.org/10.1007/978-3-540-75142-7_32openalex-snapshot
Detecting Temporal Logic Predicates on Distributed Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-75416-9_45openalex-snapshot
Correctness Debugging of Message Passing Programs Using Model Verification Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-88194-0_12openalex-snapshot
A Unified Model Checking Approach with Projection Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-00255-7_21openalex-snapshot
Partial Order Reduction for State/Event LTL
inferred← citeshttps://doi.org/10.1007/978-3-642-00431-5_7openalex-snapshot
Towards Partial Order Reduction for Model Checking Temporal Epistemic Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-00899-3_9openalex-snapshot
Does My Service Have Partners?
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_1openalex-snapshot
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
inferred← citeshttps://doi.org/10.1007/978-3-642-13675-7_10openalex-snapshot
The NEO Protocol for Large-Scale Distributed Database Systems: Modelling and Initial Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-21461-5_4openalex-snapshot
Partial Order Methods for Statistical Model Checking and Simulation
inferred← citeshttps://doi.org/10.1007/978-3-642-24933-4_3openalex-snapshot
Ten Years of Analyzing Actors: Rebeca Experience
inferred← citeshttps://doi.org/10.1007/978-3-642-25271-6_20openalex-snapshot
Model-Checking and Simulation for Stochastic Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-28869-2_14openalex-snapshot
Trace Spaces: An Efficient New Technique for State-Space Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-30729-4_12openalex-snapshot
Mechanized Extraction of Topology Anti-patterns in Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-38143-0_3openalex-snapshot
Applications of Coloured Petri Nets for Functional Validation of Protocol Designs
inferred← citeshttps://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferred← citeshttps://doi.org/10.1007/bf00871802openalex-snapshot
A specification-based approach to concurrency analysis
inferred← citeshttps://doi.org/10.1007/bf01383879openalex-snapshot
Using partial orders for the efficient verification of deadlock freedom and safety properties
inferred← citeshttps://doi.org/10.1007/s00165-008-0074-7openalex-snapshot
FDR Explorer
inferred← citeshttps://doi.org/10.1007/s00165-012-0223-xopenalex-snapshot
Automatic verification of reduction techniques in Higher Order Logic
inferred← citeshttps://doi.org/10.1007/s00165-015-0351-1openalex-snapshot
Optimising the ProB model checker for B using partial order reduction
inferred← citeshttps://doi.org/10.1007/s00236-009-0111-xopenalex-snapshot
Symmetry and partial order reduction techniques in model checking Rebeca
inferred← citeshttps://doi.org/10.1007/s00236-012-0161-3openalex-snapshot
Abstract reduction in directed model checking CCS processes
inferred← citeshttps://doi.org/10.1007/s10009-004-0151-zopenalex-snapshot
Partial-order reduction and trail improvement in directed model checking
inferred← citeshttps://doi.org/10.1007/s10009-005-0188-7openalex-snapshot
The saturation algorithm for symbolic state-space exploration
inferred← citeshttps://doi.org/10.1007/s10009-007-0050-1openalex-snapshot
Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method
inferred← citeshttps://doi.org/10.1007/s10009-008-0093-yopenalex-snapshot
Partial-order reduction for general state exploring algorithms
inferred← citeshttps://doi.org/10.1007/s10009-010-0155-9openalex-snapshot
Model checking software: on some new waves and some evergreens
inferred← citeshttps://doi.org/10.1007/s10009-014-0349-7openalex-snapshot
Sound statistical model checking for MDP using partial order and confluence reduction
inferred← citeshttps://doi.org/10.1007/s10009-014-0363-9openalex-snapshot
Guard-based partial-order reduction
inferred← citeshttps://doi.org/10.1007/s10009-021-00615-1openalex-snapshot
Study of the efficiency of model checking techniques using results of the MCC from 2015 To 2019
inferred← citeshttps://doi.org/10.1007/s10619-010-7060-9openalex-snapshot
Beyond soundness: on the verification of semantic business process models
inferred← citeshttps://doi.org/10.1007/s10703-005-1634-6openalex-snapshot
Reduced Models for Efficient CCS Verification
inferred← citeshttps://doi.org/10.1007/s10703-005-4592-0openalex-snapshot
Deciding Global Partial-Order Properties
inferred← citeshttps://doi.org/10.1007/s10703-006-0006-1openalex-snapshot
Question-guided stubborn set methods for state properties
inferred← citeshttps://doi.org/10.1007/s11334-006-0021-9openalex-snapshot
State-rich model checking
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1453-5.50020-9openalex-snapshot
Common Knowledge and Update in Finite Environments. I (Extended Abstract)
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.06.008openalex-snapshot
Partial Order Reduction for Rewriting Semantics of Programming Languages
inferred← citeshttps://doi.org/10.1016/j.ic.2005.07.004openalex-snapshot
Using heuristic search for finding deadlocks in concurrent systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.07.023openalex-snapshot
A partial order semantics approach to the clock explosion problem of timed automata
inferred← citeshttps://doi.org/10.1016/s0169-023x(02)00136-2openalex-snapshot
Deciding LTL over Mazurkiewicz traces
inferred← citeshttps://doi.org/10.1016/s1389-1286(99)00125-5openalex-snapshot
Using binary decision diagrams for representation and analysis of communication protocols
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)81041-7openalex-snapshot
Partial Order Trace Analyzer (POTA) for Distributed Programs
inferred← citeshttps://doi.org/10.1023/a:1008129319165openalex-snapshot
Application of Partial-Order Methods to Reactive Programs with Event Memorization
inferred← citeshttps://doi.org/10.1023/a:1008629725384openalex-snapshot
Stubborn Sets for Real-Time Petri Nets
inferred← citeshttps://doi.org/10.1023/a:1008697817793openalex-snapshot
Model Checking Complete Requirements Specifications Using Abstraction
inferred← citeshttps://doi.org/10.1023/a:1011235419951openalex-snapshot
Automatic Real-Time Analysis of Reactive Systems with the PARTS Toolset
inferred← citeshttps://doi.org/10.1023/a:1020887910943openalex-snapshot
Model Checking Techniqes for the Analysis of Reactive Systems
inferred← citeshttps://doi.org/10.1023/b:lisp.0000029445.29210.caopenalex-snapshot
Implementing Coloured Petri Nets Using a Functional Programming Language
inferred← citeshttps://doi.org/10.1098/rsif.2008.0546openalex-snapshot
Intelligently deciphering unintelligible designs: algorithmic algebraic model checking in systems biology
inferred← citeshttps://doi.org/10.1109/32.106975openalex-snapshot
Automated analysis of concurrent systems with the constrained expression toolset
inferred← citeshttps://doi.org/10.1109/32.489078openalex-snapshot
Evaluating deadlock detection methods for concurrent software
inferred← citeshttps://doi.org/10.1109/aspec.2007.39openalex-snapshot
Checking Distributed Programs with Partially Ordered Atoms
inferred← citeshttps://doi.org/10.1109/caia.1994.323658openalex-snapshot
Optimization of rule-based expert systems via state transition system construction
inferred← citeshttps://doi.org/10.1109/cmpsac.2002.1045086openalex-snapshot
Toward efficient algorithms for generating compact Petri nets from labeled transition systems
inferred← citeshttps://doi.org/10.1109/emwrts.1995.514305openalex-snapshot
Property decomposition to speed up analysis
inferred← citeshttps://doi.org/10.1109/icdsn.2000.857555openalex-snapshot
Deadlock detection of EFSMs using simultaneous reachability analysis
inferred← citeshttps://doi.org/10.1109/interact.2010.5706214openalex-snapshot
Formal verification of robotic and automation tasks
inferred← citeshttps://doi.org/10.1109/ismvl.2010.12openalex-snapshot
MDGs Reduction Technique Based on the HOL Theorem Prover
inferred← citeshttps://doi.org/10.1109/issre.2001.989476openalex-snapshot
Efficient deadlock analysis of clients/server systems with two-way communication
inferred← citeshttps://doi.org/10.1109/istcs.1995.377038openalex-snapshot
A partial order approach to branching time logic model checking
inferred← citeshttps://doi.org/10.1109/iwssd.1993.315508openalex-snapshot
Identical tasks and counter variables in an integer programming-based approach to verification
inferred← citeshttps://doi.org/10.1109/qest.2004.1348037openalex-snapshot
Partial order reduction for probabilistic systems
inferred← citeshttps://doi.org/10.1109/sies.2012.6356583openalex-snapshot
Embedded systems: Many cores — Many problems
inferred← citeshttps://doi.org/10.1109/test.2004.1387344openalex-snapshot
Formal verification of a system-on-chip using computation slicing
inferred← citeshttps://doi.org/10.1109/tsmc.2014.2311757openalex-snapshot
Ordinary Differential Equation-Based Deadlock Detection
inferred← citeshttps://doi.org/10.1109/tsmca.2003.820582openalex-snapshot
Exploiting Equivalence Reduction and the Sweep-Line Method for Detecting Terminal States
inferred← citeshttps://doi.org/10.1145/3477355.3477365openalex-snapshot
CSP: A Practical Process Algebra
inferred← citeshttps://doi.org/10.1145/383962.384027openalex-snapshot
Computing property-preserving behaviour abstractions from trace reductions
inferred← citeshttps://doi.org/10.12720/lnit.1.3.128-131openalex-snapshot
A Model-checking Algorithm for Formal-verification of Peer-to-peer Fault-tolerant Networks
inferred← citeshttps://doi.org/10.26226/morressier.604907f51a80aac83ca25d72openalex-snapshot
The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction
inferred← citeshttps://doi.org/10.70675/40e21541za82dz4933z9d60zf6d91f0b5801openalex-snapshot
Abstraction techniques for verification of concurrent systems
inferred← citeshttps://doi.org/10.70675/6247196cz334dz4770z9367z31b97b1b2293openalex-snapshot
Formal verification of the Pastry protocol
inferred← citeshttps://doi.org/10.70675/7ca322e4z77d0z4c75z858bzc694e9306941openalex-snapshot
Property driven verification framework : application to real time property for UML MARTE software design
inferred← citeshttps://doi.org/10.70675/c91669c4zb1a6z454dza794z90289f80f53bopenalex-snapshot
Vérification parallèle de systémes concurrents en utilisant le Graphe d’Observation Symbolique
inferred← citeshttps://doi.org/10.70675/e2f846eezbcafz4543za309z6a60439b9888openalex-snapshot
Abstraction and modular verification of inter-enterprise business processes
inferred← citeshttps://doi.org/10.70675/eab868faz45d9z4b39zbf0czec19d367f3a2openalex-snapshot
Méthode de conception de logiciel système critique couplée à une démarche de vérification formelle
inferred← citeshttps://doi.org/10.70675/f5fc5032zc27dz4fffza3cbzd9a01566f10dopenalex-snapshot
Partial order reduction for timed systems
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.