On the public citation graph

Unfolding and finite prefix for nets with read arcs

0 signed · 79 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.1995.1153openalex-snapshot

Semantics of Inhibitor Nets

inferredcites →https://doi.org/10.1007/3-540-56863-8_47openalex-snapshot

Coloured Petri nets extended with place capacities, test arcs and inhibitor arcs

inferredcites →https://doi.org/10.1007/3-540-60218-6_11openalex-snapshot

A Petri net semantics for π-calculus

inferredcites →https://doi.org/10.1007/3-540-61042-1_40openalex-snapshot

An improvement of McMillan's unfolding algorithm

inferredcites →https://doi.org/10.1007/3-540-61363-3_7openalex-snapshot

Non sequential semantics for contextual P/T nets

inferredcites →https://doi.org/10.1007/3-540-61474-5_93openalex-snapshot

Symbolic model checking

inferredcites →https://doi.org/10.1007/3-540-63139-9_26openalex-snapshot

Model checking LTL using constraint programming

inferredcites →https://doi.org/10.1007/978-1-4615-3190-6openalex-snapshot

Symbolic Model Checking

inferredcites →https://doi.org/10.1007/bf01178907openalex-snapshot

Contextual nets

inferredcites →https://doi.org/10.1007/bf01463946openalex-snapshot

Branching processes of Petri nets

inferredcites →https://doi.org/10.1007/bfb0029994openalex-snapshot

Partial order semantics and read arcs

inferredcites →https://doi.org/10.1007/bfb0053542openalex-snapshot

An event structure semantics for P/T contextual nets: Asymmetric event structures

inferredcites →https://doi.org/10.1007/bfb0055644openalex-snapshot

Unfolding and finite prefix for nets with read arcs

inferredcites →https://doi.org/10.1016/0304-3975(81)90112-2openalex-snapshot

Petri nets, event structures and domains, part I

inferredcites →https://doi.org/10.1016/0304-3975(91)90084-fopenalex-snapshot

Executions: a new partial-order semantics of Petri nets

inferredcites →https://doi.org/10.1016/0304-3975(95)00119-0openalex-snapshot

Trapping mutual exclusion in the box calculus

inferredcites →https://doi.org/10.1016/s0167-9260(96)00010-7openalex-snapshot

Modelling, analysis and synthesis of asynchronous control circuits using Petri nets

inferredcites →https://doi.org/10.1016/s0304-3975(01)00234-1openalex-snapshot

Partial order semantics and read arcs

inferredcites →https://doi.org/10.1023/a:1014746130920openalex-snapshot

An Improvement of McMillan's Unfolding Algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781394229086.ch5openalex-snapshot

Boolean Networks

inferred← citeshttps://doi.org/10.1006/inco.2001.3060openalex-snapshot

Contextual Petri Nets, Asymmetric Event Structures, and Processes

inferred← citeshttps://doi.org/10.1007/11767589_19openalex-snapshot

On the Step Explosion Problem

inferred← citeshttps://doi.org/10.1007/11767589_8openalex-snapshot

Complete Finite Prefixes of Symbolic Unfoldings of Safe Time Petri Nets

inferred← citeshttps://doi.org/10.1007/11787006_36openalex-snapshot

Timed Petri Nets and Timed Automata: On the Discriminating Power of Zeno Sequences

inferred← citeshttps://doi.org/10.1007/11901914_23openalex-snapshot

Timed Unfoldings for Networks of Timed Automata

inferred← citeshttps://doi.org/10.1007/3-540-44618-4_32openalex-snapshot

Functional Concurrent Semantics for Petri Nets with Read and Inhibitor Arcs

inferred← citeshttps://doi.org/10.1007/3-540-44685-0_26openalex-snapshot

A Static Analysis Technique for Graph Transformation Systems

inferred← citeshttps://doi.org/10.1007/3-540-45711-9_11openalex-snapshot

Bisimulation Equivalences for Graph Grammars

inferred← citeshttps://doi.org/10.1007/3-540-45740-2_22openalex-snapshot

Partial S-Invariants for the Verification of Infinite Systems Families

inferred← citeshttps://doi.org/10.1007/978-3-030-64276-1_7openalex-snapshot

The Complexity of Boolean State Separation

inferred← citeshttps://doi.org/10.1007/978-3-030-64276-1_8openalex-snapshot

Occupancy Number Restricted Boolean Petri Net Synthesis: A Fixed-Parameter Algorithm

inferred← citeshttps://doi.org/10.1007/978-3-031-34241-7_3openalex-snapshot

Modelling and Execution of Data-Driven Processes with JSON-Nets

inferred← citeshttps://doi.org/10.1007/978-3-031-94634-9_16openalex-snapshot

Decidability Problems for Weak Time Petri Nets with Read, Reset and Transfer Arcs

inferred← citeshttps://doi.org/10.1007/978-3-319-13350-8_28openalex-snapshot

A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems

inferred← citeshttps://doi.org/10.1007/978-3-319-19488-2_4openalex-snapshot

On Interval Process Semantics of Petri Nets with Inhibitor Arcs

inferred← citeshttps://doi.org/10.1007/978-3-319-19488-2_6openalex-snapshot

Non-atomic Transition Firing in Contextual Nets

inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_6openalex-snapshot

Verifying Finite-State Graph Grammars: An Unfolding-Based Approach

inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_1openalex-snapshot

On the Concurrent Semantics of Algebraic Graph Grammars

inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_3openalex-snapshot

Unfolding Graph Transformation Systems: Theory and Applications to Verification

inferred← citeshttps://doi.org/10.1007/978-3-540-73094-1_30openalex-snapshot

Workcraft: A Static Data Flow Structure Editing, Visualisation and Analysis Tool

inferred← citeshttps://doi.org/10.1007/978-3-540-89287-8_11openalex-snapshot

Directed Unfolding of Petri Nets

inferred← citeshttps://doi.org/10.1007/978-3-540-89287-8_12openalex-snapshot

McMillan’s Complete Prefix for Contextual Nets

inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_1openalex-snapshot

A False History of True Concurrency: From Petri to Tools

inferred← citeshttps://doi.org/10.1007/978-3-642-15928-2_7openalex-snapshot

On the Computation of McMillan’s Prefix for Contextual Nets and Graph Grammars

inferred← citeshttps://doi.org/10.1007/978-3-642-16164-3_13openalex-snapshot

A False History of True Concurrency: From Petri to Tools

inferred← citeshttps://doi.org/10.1007/978-3-642-21834-7_6openalex-snapshot

An Algorithm for Direct Construction of Complete Merged Processes

inferred← citeshttps://doi.org/10.1007/978-3-642-22600-7_3openalex-snapshot

Construction and SAT-Based Verification of Contextual Unfoldings

inferred← citeshttps://doi.org/10.1007/978-3-642-23217-6_23openalex-snapshot

Efficient Contextual Unfolding

inferred← citeshttps://doi.org/10.1007/978-3-642-38697-8_3openalex-snapshot

Contextual Merged Processes

inferred← citeshttps://doi.org/10.1007/s10009-007-0030-5openalex-snapshot

A negative result on depth-first net unfoldings

inferred← citeshttps://doi.org/10.1007/s10515-014-0150-6openalex-snapshot

Unfolding based automated testing of multithreaded programs

inferred← citeshttps://doi.org/10.1007/s10703-013-0188-2openalex-snapshot

Symbolic unfolding of parametric stopwatch Petri nets

inferred← citeshttps://doi.org/10.1016/j.ic.2007.10.004openalex-snapshot

Timed Petri nets and timed automata: On the discriminating power of zeno sequences

inferred← citeshttps://doi.org/10.1016/j.scico.2017.10.002openalex-snapshot

Simulation of multicellular populations with Petri nets and genome scale intracellular networks

inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.001openalex-snapshot

Domain and event structure semantics for Petri nets with read and inhibitor arcs

inferred← citeshttps://doi.org/10.1016/j.tcs.2012.04.046openalex-snapshot

Efficient unfolding of contextual Petri nets

inferred← citeshttps://doi.org/10.1016/j.tcs.2014.02.044openalex-snapshot

Branching cells for asymmetric event structures

inferred← citeshttps://doi.org/10.1016/j.tcs.2018.03.003openalex-snapshot

Interval semantics for Petri nets with inhibitor arcs

inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00234-1openalex-snapshot

Partial order semantics and read arcs

inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80192-0openalex-snapshot

Concurrency for Graph Grammars in a Petri net shell

inferred← citeshttps://doi.org/10.1017/s096012951200031xopenalex-snapshot

Processes and unfoldings: concurrent computations in adhesive categories

inferred← citeshttps://doi.org/10.1109/async.2008.18openalex-snapshot

Automated Verification of Asynchronous Circuits Using Circuit Petri Nets

inferred← citeshttps://doi.org/10.1109/edoc.2008.22openalex-snapshot

A Novel Approach to Decentralized Workflow Enactment

inferred← citeshttps://doi.org/10.1109/etfa.1999.815367openalex-snapshot

Simultaneity in signal-event systems

inferred← citeshttps://doi.org/10.1109/icpads.2016.0073openalex-snapshot

Checking the Inconsistent Data in Concurrent Systems by Petri Nets with Data Operations

inferred← citeshttps://doi.org/10.1109/iita.2008.531openalex-snapshot

Research on the Key Technologies of Asynchronous Circuit Design Based on Petri Net

inferred← citeshttps://doi.org/10.1109/jas.2017.7510766openalex-snapshot

Detecting data-flow errors based on Petri nets with data operations

inferred← citeshttps://doi.org/10.1145/1363686.1363712openalex-snapshot

Model and infrastructure for decentralized workflow enactment

inferred← citeshttps://doi.org/10.1145/1497308.1497324openalex-snapshot

Using tuplespaces to enact petri net-based workflow definitions

inferred← citeshttps://doi.org/10.1504/ijwgs.2010.032190openalex-snapshot

Tuplespace middleware for Petri net-based workflow execution

inferred← citeshttps://doi.org/10.1609/icaps.v19i1.13343openalex-snapshot

Optimality Properties of Planning Via Petri Net Unfolding: A Formal Analysis

inferred← citeshttps://doi.org/10.18419/opus-2679openalex-snapshot

A tuplespace based execution model for decentralized workflow enactment : applied for BPEL

inferred← citeshttps://doi.org/10.23638/lmcs-14(3:25)2018openalex-snapshot

Event Structures for Petri nets with Persistence

inferred← citeshttps://doi.org/10.25405/ncl.34126722openalex-snapshot

Applying Petri Net Unfoldings for Verification of Mobile Systems

inferred← citeshttps://doi.org/10.25405/ncl.34129893openalex-snapshot

Processes of Nets with Range Arcs

inferred← citeshttps://doi.org/10.3233/fi-2000-43123416openalex-snapshot

Analyzing and Reducing Simultaneous Firing in Signal-Event Nets

inferred← citeshttps://doi.org/10.3390/sym15091775openalex-snapshot

Depth-First Net Unfoldings and Equivalent Reduction

inferred← citeshttps://doi.org/10.48550/arxiv.2010.00825openalex-snapshot

The Complexity of Boolean State Separation (Technical Report)

showing the first 59 of 60 · page through all 60

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.