On the public citation graph

The regular viewpoint on PA-processes

https://doi.org/10.1007/bfb0055615
0 signed · 60 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-17945-3_5openalex-snapshot
Decidability of bisimulation equivalence for processes generating context-free languages
inferredcites →https://doi.org/10.1007/3-540-61604-7_56openalex-snapshot
Infinite results
inferredcites →https://doi.org/10.1007/3-540-62034-6_42openalex-snapshot
Regularity is decidable for normed PA processes in polynomial time
inferredcites →https://doi.org/10.1007/3-540-63141-0_10openalex-snapshot
Reachability analysis of pushdown automata: Application to model-checking
inferredcites →https://doi.org/10.1007/3-540-63141-0_21openalex-snapshot
How to Parallelize sequential processes
inferredcites →https://doi.org/10.1007/3-540-63141-0_23openalex-snapshot
Model checking PA-processes
inferredcites →https://doi.org/10.1007/3-540-63371-5_6openalex-snapshot
A formal framework for the analysis of recursive-parallel programs
inferredcites →https://doi.org/10.1007/978-1-4613-8928-6_19openalex-snapshot
Regular Canonical Systems
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_1openalex-snapshot
Tree Languages
inferredcites →https://doi.org/10.1007/bf01969548openalex-snapshot
Regular canonical systems
inferredcites →https://doi.org/10.1007/bfb0014567openalex-snapshot
Combining Petri nets and PA-processes
inferredcites →https://doi.org/10.1007/bfb0055053openalex-snapshot
Deciding bisimulation-like equivalences with finite-state processes
inferredcites →https://doi.org/10.1016/0304-3975(92)90278-nopenalex-snapshot
On the regular structure of prefix rewriting
inferredcites →https://doi.org/10.1016/s0304-3975(00)00027-xopenalex-snapshot
Deciding bisimulation-like equivalences with finite-state processes
inferredcites →https://doi.org/10.1016/s1571-0661(05)01235-1openalex-snapshot
A model for recursive-parallel programs
inferredcites →https://doi.org/10.1016/s1571-0661(05)80426-8openalex-snapshot
A Direct Symbolic Approach to Model Checking Pushdown Systems (extended abstract)
inferredcites →https://doi.org/10.1017/cbo9781139172752openalex-snapshot
Term Rewriting and All That
inferredcites →https://doi.org/10.1093/comjnl/37.4.233openalex-snapshot
Decidable Subsets of CCS
inferredcites →https://doi.org/10.1109/lics.1990.113750openalex-snapshot
The theory of ground rewrite systems is decidable
inferredcites →https://doi.org/10.1145/199448.199470openalex-snapshot
Verifying infinite state processes with sequential and parallel composition
inferredcites →https://doi.org/10.1201/9781482276367-14openalex-snapshot
Tree Languages
inferredcites →https://doi.org/10.3233/fi-1997-3112openalex-snapshot
Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes
inferredcites →https://doi.org/10.36045/bbms/1105730627openalex-snapshot
Rational tree relations

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722167_7openalex-snapshot
An Automata-Theoretic Approach to Reasoning about Infinite-State Systems
inferred← citeshttps://doi.org/10.1007/11805618_11openalex-snapshot
Rewriting Models of Boolean Programs
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_30openalex-snapshot
Decidable First-Order Transition Logics for PA-Processes
inferred← citeshttps://doi.org/10.1007/3-540-45657-0_46openalex-snapshot
Extrapolating Tree Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_16openalex-snapshot
Grammars as Processes
inferred← citeshttps://doi.org/10.1007/3-540-46425-5_23openalex-snapshot
Constraint-Based Inter-Procedural Analysis of Parallel Programs
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_2openalex-snapshot
An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis
inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_19openalex-snapshot
Regular Hedge Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-030-00250-3_4openalex-snapshot
Constrained Dynamic Tree Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-24597-1_7openalex-snapshot
Reachability Analysis of Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_23openalex-snapshot
Extended Process Rewrite Systems: Expressiveness and Reachability
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_35openalex-snapshot
On Computing Reachability Sets of Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-69507-3_2openalex-snapshot
Model-Checking Large Finite-State Systems and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-540-85361-9_29openalex-snapshot
On the Reachability Analysis of Acyclic Networks of Pushdown Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-02979-0_18openalex-snapshot
Verifying Parallel Programs with Dynamic Communication Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_20openalex-snapshot
Constrained Reachability of Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_13openalex-snapshot
Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order
inferred← citeshttps://doi.org/10.1007/s10009-011-0208-8openalex-snapshot
Widening techniques for regular tree model checking
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.053openalex-snapshot
On Symbolic Verification of Weakly Extended PAD
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.029openalex-snapshot
Bounded Communication Reachability Analysis of Process Rewrite Systems with Ordered Parallelism
inferred← citeshttps://doi.org/10.1016/j.ic.2009.01.003openalex-snapshot
Reachability is decidable for weakly extended process rewrite systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.05.028openalex-snapshot
Verifying parallel programs with dynamic communication structures
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00101-8openalex-snapshot
Decidability of model checking with the temporal logic EF
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00011-7openalex-snapshot
Dynamic connectors for concurrency
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00025-5openalex-snapshot
Iterating transducers
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00316-0openalex-snapshot
Cryptographic Analysis in Cubic Time
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80532-2openalex-snapshot
Rewriting in the partial algebra of typed terms modulo AC
inferred← citeshttps://doi.org/10.1051/ita:2007029openalex-snapshot
Efficiency of automata in semi-commutation verification techniques
inferred← citeshttps://doi.org/10.1145/325694.325697openalex-snapshot
Efficient algorithms for pre* and post* on interprocedural parallel flow graphs
inferred← citeshttps://doi.org/10.14236/ewic/vecos2007.7openalex-snapshot
Computing Transitive Closures of Hedge Transformations
inferred← citeshttps://doi.org/10.1504/ijccbs.2012.045079openalex-snapshot
Computing transitive closures of hedge transformations
inferred← citeshttps://doi.org/10.2168/lmcs-7(4:4)2011openalex-snapshot
Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads
inferred← citeshttps://doi.org/10.2168/lmcs-8(3:20)2012openalex-snapshot
Model-Checking of Ordered Multi-Pushdown Automata
inferred← citeshttps://doi.org/10.4204/eptcs.129.24openalex-snapshot
Iterable Forward Reachability Analysis of Monitor-DPNs
inferred← citeshttps://doi.org/10.48550/arxiv.1502.05873openalex-snapshot
Annotated Stack Trees
inferred← citeshttps://doi.org/10.7146/brics.v11i7.21832openalex-snapshot
On the Expressive Power of Extended Process Rewrite 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.