On the public citation graph

On the decidability of model checking for several μ-calculi and Petri nets

https://doi.org/10.1007/bfb0017477
0 signed · 72 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-57208-2_11openalex-snapshot
Bisimulation equivalence is decidable for basic parallel processes
inferredcites →https://doi.org/10.1007/978-1-4684-6819-9openalex-snapshot
Verifying Temporal Properties of Systems
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.1016/0022-0000(86)90026-7openalex-snapshot
Automata-theoretic techniques for modal logics of programs
inferredcites →https://doi.org/10.1016/0304-3975(89)90053-4openalex-snapshot
Problems concerning fairness and temporal logic for conflict-free petri nets
inferredcites →https://doi.org/10.1016/0304-3975(90)90006-4openalex-snapshot
Decidability of a temporal logic problem for Petri nets
inferredcites →https://doi.org/10.1016/0304-3975(91)90228-topenalex-snapshot
A taxonomy of fairness and temporal logic problems for Petri nets
inferredcites →https://doi.org/10.1016/0890-5401(92)90059-oopenalex-snapshot
A unified approach for deciding the existence of certain petri net paths
inferredcites →https://doi.org/10.1016/s0022-0000(69)80011-5openalex-snapshot
Parallel program schemata
inferredcites →https://doi.org/10.1093/oso/9780198537618.003.0005openalex-snapshot
Modal and Temporal Logics
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.1145/800070.802201openalex-snapshot
Decidability of reachability in vector addition systems (Preliminary Version)
inferredcites →https://doi.org/10.2307/2313471openalex-snapshot
Computation: Finite and Infinite Machines.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11560586_9openalex-snapshot
Checking Risky Events Is Enough for Local Policies
inferred← citeshttps://doi.org/10.1007/11590156_17openalex-snapshot
Reachability of Hennessy-Milner Properties for Weakly Extended PRS
inferred← citeshttps://doi.org/10.1007/11768869_1openalex-snapshot
Security Issues in Service Composition
inferred← citeshttps://doi.org/10.1007/11874683_23openalex-snapshot
Infinite State Model-Checking of Propositional Dynamic Logics
inferred← citeshttps://doi.org/10.1007/11944836_24openalex-snapshot
On Decidability of LTL Model Checking for Process Rewrite Systems
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_51openalex-snapshot
Decidability Results for the Propositional Fluent Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45510-8_5openalex-snapshot
HMSCs as Partial Specifications...with PNs as Completions
inferred← citeshttps://doi.org/10.1007/3-540-60045-0_62openalex-snapshot
On the model checking problem for branching time logics and basic parallel processes
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_39openalex-snapshot
On the expressivity of the modal mu-calculus
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_71openalex-snapshot
Constrained properties, semilinear systems, and Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-63139-9_32openalex-snapshot
On the complexity of the linear-time μ-calculus for Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-319-33612-1_3openalex-snapshot
Formal Verification of Petri Nets with Names
inferred← citeshttps://doi.org/10.1007/978-3-319-33612-1_9openalex-snapshot
On the Decidability of Honesty and of Its Variants
inferred← citeshttps://doi.org/10.1007/978-3-319-45994-3_3openalex-snapshot
On the Complexity of Resource-Bounded Logics
inferred← citeshttps://doi.org/10.1007/978-3-540-30477-7_8openalex-snapshot
History Effects and Verification
inferred← citeshttps://doi.org/10.1007/978-3-540-30554-5_8openalex-snapshot
Formal Techniques for Java-Like Programs (FTfJP)
inferred← citeshttps://doi.org/10.1007/978-3-540-30579-8_19openalex-snapshot
Model Checking for Process Rewrite Systems and a Class of Action-Based Regular Properties
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_20openalex-snapshot
History-Based Access Control with Local Policies
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_8openalex-snapshot
Verifying Dynamic Pointer-Manipulating Threads
inferred← citeshttps://doi.org/10.1007/978-3-540-71389-0_4openalex-snapshot
Types and Effects for Resource Usage Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-72734-7_13openalex-snapshot
A Decidable Temporal Logic of Repeating Values
inferred← citeshttps://doi.org/10.1007/978-3-540-74810-6_2openalex-snapshot
Secure Service Orchestration
inferred← citeshttps://doi.org/10.1007/978-3-642-00945-7_2openalex-snapshot
Model Checking Usage Policies
inferred← citeshttps://doi.org/10.1007/978-3-642-03466-4_5openalex-snapshot
ν-Types for Effects and Freshness Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-04420-5_7openalex-snapshot
On Yen’s Path Logic for Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-12032-9_11openalex-snapshot
On the Relationship between Spatial Logics and Behavioral Simulations
inferred← citeshttps://doi.org/10.1007/978-3-642-24288-5_9openalex-snapshot
Decidability of LTL for Vector Addition Systems with One Zero-Test
inferred← citeshttps://doi.org/10.1007/978-3-642-30829-1_17openalex-snapshot
On the Realizability of Contracts in Dishonest Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31606-7_11openalex-snapshot
Nominal Automata for Resource Usage Control
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_9openalex-snapshot
Witness Runs for Counter Machines
inferred← citeshttps://doi.org/10.1007/s00165-016-0370-6openalex-snapshot
Model checking Petri nets with names using data-centric dynamic systems
inferred← citeshttps://doi.org/10.1007/s00236-008-0082-3openalex-snapshot
On decidability of LTL model checking for process rewrite systems
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.033openalex-snapshot
On Decidability of LTL+Past Model Checking for Process Rewrite Systems
inferred← citeshttps://doi.org/10.1016/j.is.2020.101563openalex-snapshot
Scenario-based process querying for compliance, reuse, and standardization
inferred← citeshttps://doi.org/10.1016/j.sysarc.2010.09.001openalex-snapshot
Secure service orchestration in open networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.05.003openalex-snapshot
Model checking for process rewrite systems and a class of action-based regular properties
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.01.019openalex-snapshot
On the complexity of resource-bounded logics
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(99)00034-1openalex-snapshot
Model checking the full modal mu-calculus for infinite sequential processes
inferred← citeshttps://doi.org/10.1017/s096012951200093xopenalex-snapshot
Model checking usage policies
inferred← citeshttps://doi.org/10.1023/a:1008753219837openalex-snapshot
Model-Checking with Coverability Graphs
inferred← citeshttps://doi.org/10.1109/csfw.2005.17openalex-snapshot
Enforcing Secure Service Composition
inferred← citeshttps://doi.org/10.1109/pcee.2002.1115202openalex-snapshot
Verification of distributed systems modelled by high-level Petri nets
inferred← citeshttps://doi.org/10.1145/1045405.1045407openalex-snapshot
Policy framings for access control
inferred← citeshttps://doi.org/10.1145/1552309.1552313openalex-snapshot
Local policies for resource usage analysis
inferred← citeshttps://doi.org/10.1145/3314221.3322484openalex-snapshot
Verifying message-passing programs with dependent behavioural types
inferred← citeshttps://doi.org/10.2168/lmcs-8(2:11)2012openalex-snapshot
Model Checking Vector Addition Systems with one zero-test
inferred← citeshttps://doi.org/10.2178/jsl/1231082313openalex-snapshot
PDL with intersection and converse: satisfiability and infinite-state model checking
inferred← citeshttps://doi.org/10.3233/jcs-2009-0357openalex-snapshot
Planning and verifying service composition
inferred← citeshttps://doi.org/10.4230/lipics.csl.2012.366openalex-snapshot
A Counting Logic for Structure Transition Systems
inferred← citeshttps://doi.org/10.48550/arxiv.1201.6188openalex-snapshot
On the realizability of contracts in dishonest systems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0312019openalex-snapshot
Verification of recursive parallel systems
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0401013openalex-snapshot
Verification of Process Rewrite Systems in normal form
inferred← citeshttps://doi.org/10.5281/zenodo.163532openalex-snapshot
Research Performance Analysis Of Some Indian Top Business Schools Using Abc Model
inferred← citeshttps://doi.org/10.5281/zenodo.210354openalex-snapshot
FIGURE 16 in A new dasyurid marsupial from eastern Queensland, Australia: the Buff-footed Antechinus, Antechinus mysticus sp. nov. (Marsupialia: Dasyuridae)
inferred← citeshttps://doi.org/10.5287/ora-7rg81n5vyopenalex-snapshot
Saturation methods for global model-checking pushdown systems
inferred← citeshttps://doi.org/10.5381/jot.2009.8.4.a1openalex-snapshot
Securing Java with Local Policies.
inferred← citeshttps://doi.org/10.7146/brics.v1i8.21662openalex-snapshot
Decidability Issues for Petri Nets
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.