On the public citation graph

Fundamental structures in Well-Structured infinite Transition Systems

https://doi.org/10.1007/bfb0054314
0 signed · 50 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.1006/inco.1996.0003openalex-snapshot
Unreliable Channels Are Easier to Verify Than Perfect Channels
inferredcites →https://doi.org/10.1006/inco.1996.0053openalex-snapshot
Verifying Programs with Unreliable Channels
inferredcites →https://doi.org/10.1007/3-540-08860-1_35openalex-snapshot
Self-modifying nets, a natural extension of Petri nets
inferredcites →https://doi.org/10.1007/3-540-17945-3_5openalex-snapshot
Decidability of bisimulation equivalence for processes generating context-free languages
inferredcites →https://doi.org/10.1007/3-540-18088-5_43openalex-snapshot
A generalization of the procedure of karp and miller to well structured transition systems
inferredcites →https://doi.org/10.1007/3-540-56689-9_45openalex-snapshot
The minimal coverability graph for Petri nets
inferredcites →https://doi.org/10.1007/3-540-58152-9_11openalex-snapshot
Petri nets with marking-dependent arc cardinality: Properties and analysis
inferredcites →https://doi.org/10.1007/3-540-58152-9_19openalex-snapshot
A general systematic approach to arc extensions for coloured Petri Nets
inferredcites →https://doi.org/10.1007/3-540-58201-0_56openalex-snapshot
Deciding properties of integral relational automata
inferredcites →https://doi.org/10.1007/3-540-61604-7_56openalex-snapshot
Infinite results
inferredcites →https://doi.org/10.1007/bf00268843openalex-snapshot
Fifo nets without order deadlock
inferredcites →https://doi.org/10.1007/bf00289715openalex-snapshot
The residue of vector sets with applications to decidability problems in Petri nets
inferredcites →https://doi.org/10.1007/bf01936139openalex-snapshot
On permutative grammars generating context-free languages
inferredcites →https://doi.org/10.1007/bf02277857openalex-snapshot
Decidability of the termination problem for completely specified protocols
inferredcites →https://doi.org/10.1016/0304-3975(88)90098-9openalex-snapshot
Characterizing finite Kripke structures in propositional temporal logic
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)90009-7openalex-snapshot
Reduction and covering of infinite reachability trees
inferredcites →https://doi.org/10.1016/0890-5401(92)90017-aopenalex-snapshot
Symbolic model checking: 1020 States and beyond
inferredcites →https://doi.org/10.1016/s1571-0661(05)01235-1openalex-snapshot
A model for recursive-parallel programs
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/lics.1993.287591openalex-snapshot
Verifying programs with unreliable channels
inferredcites →https://doi.org/10.1109/lics.1996.561359openalex-snapshot
General decidability theorems for infinite-state systems
inferredcites →https://doi.org/10.1137/0214042openalex-snapshot
Priority Networks of Communicating Finite State Machines
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470611647.ch4openalex-snapshot
Decidability and Complexity of Petri Net Problems
inferred← citeshttps://doi.org/10.1007/11494744_24openalex-snapshot
Achieving a General, Formal and Decidable Approach to the OR-Join in Workflow Using Reset Nets
inferred← citeshttps://doi.org/10.1007/3-540-36377-7_17openalex-snapshot
Homeomorphic Embedding for Online Termination of Symbolic Methods
inferred← citeshttps://doi.org/10.1007/3-540-44585-4_47openalex-snapshot
As Cheap as Possible: Effcient Cost-Optimal Reachability for Priced Timed Automata
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_7openalex-snapshot
Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction
inferred← citeshttps://doi.org/10.1007/3-540-44988-4_12openalex-snapshot
Decidability of Properties of Timed-Arc Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-46562-6_18openalex-snapshot
Some Decidability Results for Nested Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-48523-6_27openalex-snapshot
Boundedness of Reset P/T Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-25938-1_1openalex-snapshot
Inductive Theorem Proving by Program Specialisation: Generating Proofs for Isabelle Using Ecce
inferred← citeshttps://doi.org/10.1007/978-3-540-33461-3_14openalex-snapshot
Hsu-Chun Yen
inferred← citeshttps://doi.org/10.1007/978-3-540-40903-8_20openalex-snapshot
Using Zone Graph Method for Computing the State Space of a Time Petri Net
inferred← citeshttps://doi.org/10.1007/978-3-642-13675-7_12openalex-snapshot
Forward Analysis for Petri Nets with Name Creation
inferred← citeshttps://doi.org/10.1007/978-3-642-31069-0_39openalex-snapshot
Modelling and Verification of Interorganizational Workflows with Security Constraints: A Petri Nets-Based Approach
inferred← citeshttps://doi.org/10.1007/bfb0055044openalex-snapshot
Reset nets between decidability and undecidability
inferred← citeshttps://doi.org/10.1016/j.ic.2004.01.005openalex-snapshot
A well-structured framework for analysing petri net extensions
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00149-0openalex-snapshot
A note on well quasi-orderings for powersets
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80751-0openalex-snapshot
Real-Time Verification Techniques for Untimed Systems
inferred← citeshttps://doi.org/10.1017/s147106840600264xopenalex-snapshot
State space computation and analysis of Time Petri Nets
inferred← citeshttps://doi.org/10.1023/a:1010914603293openalex-snapshot
Recursive Nested Petri Nets: Analysis of Semantic Properties and Expessibility
inferred← citeshttps://doi.org/10.1109/pnpm.2003.1231549openalex-snapshot
State class timed automaton of a time Petri net
inferred← citeshttps://doi.org/10.1109/tit.2019.2937335openalex-snapshot
Statistical Mechanics of MAP Estimation: General Replica Ansatz
inferred← citeshttps://doi.org/10.1142/s0218843009002002openalex-snapshot
SYNCHRONIZATION AND CANCELATION IN WORKFLOWS BASED ON RESET NETS
inferred← citeshttps://doi.org/10.1145/351268.351298openalex-snapshot
Solving coverability problems of petri nets by partial deduction
inferred← citeshttps://doi.org/10.3233/fi-2011-611openalex-snapshot
Accelerations for the Coverability Set of Petri Nets with Names
inferred← citeshttps://doi.org/10.4204/eptcs.320.3openalex-snapshot
From Well Structured Transition Systems to Program Verification
inferred← citeshttps://doi.org/10.70675/dff88fdbzc0eaz48ccz9382ze65ec8b9d635openalex-snapshot
Finite-memory strategies in concurrent two-player games
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.