On the public citation graph

On-the-fly verification of finite transition systems

0 signed · 80 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.1002/j.1538-7305.1985.tb00010.xopenalex-snapshot
Tracing Protocols
inferredcites →https://doi.org/10.1006/inco.1994.1035openalex-snapshot
A Partial Approach to Model Checking
inferredcites →https://doi.org/10.1007/3-540-52148-8_16openalex-snapshot
On-line model-checking for finite linear temporal logic specifications
inferredcites →https://doi.org/10.1007/3-540-54430-5_107openalex-snapshot
Efficient verification of determinate processes
inferredcites →https://doi.org/10.1007/3-540-55179-4_18openalex-snapshot
“On the fly” verification of behavioural equivalences and preorders
inferredcites →https://doi.org/10.1007/3-540-55179-4_19openalex-snapshot
Bounded-memory algorithms for verification on-the-fly
inferredcites →https://doi.org/10.1007/bf00121128openalex-snapshot
Memory-efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1007/bf00709154openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1007/bfb0020809openalex-snapshot
Testing for unboundedness of Fifo channels
inferredcites →https://doi.org/10.1007/bfb0023733openalex-snapshot
Minimal model generation
inferredcites →https://doi.org/10.1016/0167-6423(90)90071-kopenalex-snapshot
An implementation of an efficient algorithm for bisimulation equivalence
inferredcites →https://doi.org/10.1016/0304-3975(85)90014-3openalex-snapshot
An introduction to FIFO nets— monogeneous nets: A subclass of FIFO nets
inferredcites →https://doi.org/10.1016/0304-3975(93)90212-copenalex-snapshot
Testing for unboundedness of fifo channels
inferredcites →https://doi.org/10.1016/0376-5075(78)90015-6openalex-snapshot
Finite state description of communication protocols
inferredcites →https://doi.org/10.1016/0890-5401(90)90025-dopenalex-snapshot
CCS expressions, finite state processes, and three problems of equivalence
inferredcites →https://doi.org/10.1090/dimacs/003/04openalex-snapshot
A stubborn attack on state explosion
inferredcites →https://doi.org/10.1090/dimacs/003/08openalex-snapshot
Minimal model generation
inferredcites →https://doi.org/10.1090/dimacs/003/15openalex-snapshot
Memory efficient algorithms for the verification of temporal properties
inferredcites →https://doi.org/10.1109/32.4654openalex-snapshot
Development of Veda, a prototyping tool for distributed algorithms
inferredcites →https://doi.org/10.1109/lics.1991.151664openalex-snapshot
A partial approach to model checking
inferredcites →https://doi.org/10.1109/tse.1987.233206openalex-snapshot
Automated Protocol Validation in Argos: Assertion Proving and Scatter Searching
inferredcites →https://doi.org/10.1137/0216062openalex-snapshot
Three Partition Refinement Algorithms
inferredcites →https://doi.org/10.1137/sicompopenalex-snapshot
SIAM Journal on Computing
inferredcites →https://doi.org/10.1145/322374.322380openalex-snapshot
On Communicating Finite-State Machines
inferredcites →https://doi.org/10.1145/41840.41865openalex-snapshot
Avoiding the state explosion problem in temporal logic model checking
inferredcites →https://doi.org/10.1147/rd.224.0393openalex-snapshot
General Technique for Communications Protocol Validation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11589976_6openalex-snapshot
Exp.Open 2.0: A Flexible Tool Integrating Partial Order, Compositional, and On-The-Fly Verification Methods
inferred← citeshttps://doi.org/10.1007/3-540-48119-2_13openalex-snapshot
Error Detection with Directed Symbolic Model Checking
inferred← citeshttps://doi.org/10.1007/3-540-48294-6_11openalex-snapshot
State Space Reduction Based on Live Variables Analysis
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_69openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_102openalex-snapshot
Marrella: A tool for simulation and verification
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_82openalex-snapshot
Using on-the-fly verification techniques for the generation of test suites
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_73openalex-snapshot
A space-efficient on-the-fly algorithm for real-time model checking
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_21openalex-snapshot
A method to build symbolic representations of LOTOS specifications
inferred← citeshttps://doi.org/10.1007/978-1-4615-5549-0_6openalex-snapshot
Protocol Verification
inferred← citeshttps://doi.org/10.1007/978-3-032-22723-2_14openalex-snapshot
Outrunning Big KATs: Efficient Decision Procedures for Variants of GKAT
inferred← citeshttps://doi.org/10.1007/978-3-540-24664-0_8openalex-snapshot
Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-24732-6_3openalex-snapshot
State Caching Reconsidered
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_8openalex-snapshot
Compositional Specification of Web Services Via Behavioural Equivalence of Nets: A Case Study
inferred← citeshttps://doi.org/10.1007/978-3-642-05089-3_11openalex-snapshot
Partial Order Reductions Using Compositional Confluence Detection
inferred← citeshttps://doi.org/10.1007/bf00121262openalex-snapshot
Combining partial order reductions with on-the-fly model-checking
inferred← citeshttps://doi.org/10.1007/bf03004068openalex-snapshot
Protocol engineering using UML
inferred← citeshttps://doi.org/10.1007/s11663-009-9326-zopenalex-snapshot
Erratum to: Results Demonstrating Techniques for Enhancing Electrochemical Reactions Involving Iron Oxide in Slags and C in Liquid Iron
inferred← citeshttps://doi.org/10.1007/s12544-010-0030-5openalex-snapshot
European railway traffic management system validation using UML/Petri nets modelling strategy
inferred← citeshttps://doi.org/10.1016/0165-6074(93)90198-topenalex-snapshot
Introducing structure into behavioural descriptions obtained from timing diagram specifications
inferred← citeshttps://doi.org/10.1016/j.artint.2026.104628openalex-snapshot
Capacity alternating-time temporal epistemic logic
inferred← citeshttps://doi.org/10.1016/j.cosrev.2010.06.002openalex-snapshot
Linear Temporal Logic Symbolic Model Checking
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.10.060openalex-snapshot
Mathematical programming approach to the Petri nets reachability problem
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.09.003openalex-snapshot
Concise Graphs and Functional Bisimulations
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.07.008openalex-snapshot
Describing Secure Interfaces with Interface Automata
inferred← citeshttps://doi.org/10.1016/s0140-3664(99)00223-6openalex-snapshot
Test generation for interworking systems
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00133-8openalex-snapshot
State space reduction based on live variables analysis
inferred← citeshttps://doi.org/10.1016/s0950-5849(99)00061-0openalex-snapshot
Path-based protocol verification approach
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.1023/a:1008645800955openalex-snapshot
Behaviour Analysis of Distributed Systems Using the Tracta Approach
inferred← citeshttps://doi.org/10.1023/a:1008926807523openalex-snapshot
A Machine State Transition Approach to Instruction Retargeting for Embedded Microprocessors
inferred← citeshttps://doi.org/10.1080/00207540412331312679openalex-snapshot
A method for the verification of a distributed and synchronized algorithm
inferred← citeshttps://doi.org/10.1109/cise.2010.5676886openalex-snapshot
Research on Safe Behavior Adaptation of Software Component
inferred← citeshttps://doi.org/10.1109/cmpass.1995.521903openalex-snapshot
An Estelle-NPN based system for protocol verification
inferred← citeshttps://doi.org/10.1109/iceee.2010.5661347openalex-snapshot
Safety Verification of Software Component Behavior Adaptation
inferred← citeshttps://doi.org/10.1109/icsmc.2004.1399939openalex-snapshot
Efficient reachability analysis of bounded petri nets using constraint programming
inferred← citeshttps://doi.org/10.1109/ndt.2009.5272184openalex-snapshot
Test purpose-based test generation for web applications
inferred← citeshttps://doi.org/10.1109/paap.2010.27openalex-snapshot
Specification and Verification of Safe Web Service Behavior Adaptation
inferred← citeshttps://doi.org/10.1109/paap.2010.29openalex-snapshot
Research on Behavior Adaptation of Software Component
inferred← citeshttps://doi.org/10.1109/pdse.1998.668156openalex-snapshot
Validation and test generation for object-oriented distributed software
inferred← citeshttps://doi.org/10.1109/qest.2012.30openalex-snapshot
On-the-Fly Algorithms for Bisimulation Metrics
inferred← citeshttps://doi.org/10.1109/systol.2016.7739768openalex-snapshot
On-the-fly diagnosability analysis of LPN using verifier nets
inferred← citeshttps://doi.org/10.1145/195058.195194openalex-snapshot
The complexity of verification
inferred← citeshttps://doi.org/10.1145/2429069.2429124openalex-snapshot
Checking NFA equivalence with bisimulations up to congruence
inferred← citeshttps://doi.org/10.1145/2480359.2429124openalex-snapshot
Checking NFA equivalence with bisimulations up to congruence
inferred← citeshttps://doi.org/10.1145/267895.267913openalex-snapshot
Verification of liveness properties using compositional reachability analysis
inferred← citeshttps://doi.org/10.1145/267896.267913openalex-snapshot
Verification of liveness properties using compositional reachability analysis
inferred← citeshttps://doi.org/10.1145/2713167openalex-snapshot
Hacking nondeterminism with induction and coinduction
inferred← citeshttps://doi.org/10.1145/3632747openalex-snapshot
Products, Polynomials and Differential Equations in the Stream Calculus
inferred← citeshttps://doi.org/10.11606/t.45.2011.tde-10042012-100539openalex-snapshot
Verification of behaviourist multi-agent systems by means of formally guided simulations
inferred← citeshttps://doi.org/10.1177/0037549713490439openalex-snapshot
On-the-fly verification of discrete event simulations by means of simulation purposes: Extended version
inferred← citeshttps://doi.org/10.17877/de290r-3335openalex-snapshot
Large scale parallel state space search utilizing graphics processing units and solid state disks
inferred← citeshttps://doi.org/10.3233/fi-2009-133openalex-snapshot
A Net-based Approach to Web Services Publication and Replaceability
inferred← citeshttps://doi.org/10.5772/5327openalex-snapshot
Incremental Integer Linear Programming Models for Petri Nets Reachability Problems
inferred← citeshttps://doi.org/10.70675/884692a9zbcc8z4e78za6a2zd0b3f6c6710dopenalex-snapshot
Vérification des systèmes multi-agents comportementalistes par le moyen des simulations formellement guidées
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.