On the public citation graph
Adequate path expressions
0 signed · 75 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-09510-1_46openalex-snapshot
A formal semantics for concurrent systems
inferredcites →https://doi.org/10.1007/bf00264564openalex-snapshot
Formal semantics of a class of high-level primitives for coordinating concurrent processes
inferredcites →https://doi.org/10.1007/bf00266047openalex-snapshot
COSY ? a system specification language based on paths and processes
inferredcites →https://doi.org/10.1007/bfb0029355openalex-snapshot
The specification of process synchronization by path expressions
inferredcites →https://doi.org/10.1145/954587.954591openalex-snapshot
Abstract specification of resource accessing disciplines
inferredcites →https://doi.org/10.7146/dpb.v6i78.7691openalex-snapshot
Concurrent Program Schemes and their Interpretations
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_16openalex-snapshot
Specification of highly parallel and distributed resource management
inferred← citeshttps://doi.org/10.1007/3-540-10007-5_46openalex-snapshot
Design and analysis of highly parallel and distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-10009-1_10openalex-snapshot
Specification and verification of real-time, distributed systems using the theory of constraints
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_95openalex-snapshot
Formal behavioural specification of concurrent systems without globality assumptions
inferred← citeshttps://doi.org/10.1007/3-540-12727-5_7openalex-snapshot
Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets
inferred← citeshttps://doi.org/10.1007/3-540-12925-1_36openalex-snapshot
A method for developing concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_26openalex-snapshot
Deterministic asynchronous automata
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_11openalex-snapshot
Concurrent behaviour: Sequences, processes and axioms
inferred← citeshttps://doi.org/10.1007/3-540-15670-4_13openalex-snapshot
Maximally concurrent evolution of non-sequential systems
inferred← citeshttps://doi.org/10.1007/3-540-17906-2_33openalex-snapshot
COSY: Its relation to nets and to CSP
inferred← citeshttps://doi.org/10.1007/3-540-18086-9_21openalex-snapshot
On equivalent execution semantics of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_51openalex-snapshot
Adequacy-preserving transformations of COSY path programs
inferred← citeshttps://doi.org/10.1007/3-540-51285-3_34openalex-snapshot
Towards a theory of simulation for verification of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_173openalex-snapshot
The effect of Vector synchronization: Residue and loss
inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_8openalex-snapshot
Interval Traces with Mutex Relation
inferred← citeshttps://doi.org/10.1007/978-3-540-68746-7_18openalex-snapshot
Modelling Concurrency with Quotient Monoids
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_20openalex-snapshot
An Introduction to the Macro Cosy Notation
inferred← citeshttps://doi.org/10.1007/978-3-662-73305-9_3openalex-snapshot
Semantics of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-94-009-7760-0_25openalex-snapshot
Synchronization of Concurrent Processes without Globality Assumptions
inferred← citeshttps://doi.org/10.1007/bf00267866openalex-snapshot
The Merlin-Randell problem of train journeys
inferred← citeshttps://doi.org/10.1007/bf00290705openalex-snapshot
A formal semantics for concurrent systems with a priority relation
inferred← citeshttps://doi.org/10.1007/bfb0017129openalex-snapshot
On models and algebras for concurrent processes
inferred← citeshttps://doi.org/10.1007/bfb0020791openalex-snapshot
On the concatenation of infinite traces
inferred← citeshttps://doi.org/10.1007/bfb0022514openalex-snapshot
On atomic nets and concurrency relations
inferred← citeshttps://doi.org/10.1007/bfb0022534openalex-snapshot
Verifying concurrent system specifications in COSY
inferred← citeshttps://doi.org/10.1007/s001650050058openalex-snapshot
Overtaking in Asynchronous Periodic Systems
inferred← citeshttps://doi.org/10.1016/0164-1212(89)90038-1openalex-snapshot
Synchronizing events in replicated systems
inferred← citeshttps://doi.org/10.1016/0304-3975(82)90020-2openalex-snapshot
Adequacy properties of path programs
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90029-5openalex-snapshot
Transforming sequential systems into concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90177-5openalex-snapshot
Concurrent and maximally concurrent evolution of nonsequential systems
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90090-9openalex-snapshot
Sequential and concurrent behaviour in Petri net theory
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90117-zopenalex-snapshot
Transformations of sequential specifications into concurrent specifications by synchronization guards
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90327-copenalex-snapshot
Adequacy-preserving transformations of COSY path programs
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90209-copenalex-snapshot
On the concatenation of infinite traces
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50007-3openalex-snapshot
Concepts and notations for concurrent programming**Reprinted from: ACM Computing Surveys, 15(1), March 1983 with permission of the Association for Computing Machinery Inc.
inferred← citeshttps://doi.org/10.1016/j.ic.2011.08.001openalex-snapshot
Modelling concurrency with comtraces and generalized comtraces
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.05.002openalex-snapshot
Classifying invariant structures of step traces
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00105-3openalex-snapshot
Restrictions and representations of vector controlled concurrent system behaviours
inferred← citeshttps://doi.org/10.1109/32.56100openalex-snapshot
Specifying Ada server tasks with executable formal grammars
inferred← citeshttps://doi.org/10.1109/csd.2003.1207706openalex-snapshot
Component-based design: towards guided composition
inferred← citeshttps://doi.org/10.1109/icci.1992.227675openalex-snapshot
On operational equivalence of COSY programs
inferred← citeshttps://doi.org/10.1109/icse.1989.714440openalex-snapshot
Timing Analysis Of Cyclic Concurrent Programs
inferred← citeshttps://doi.org/10.1109/icsmc.2003.1245648openalex-snapshot
Interacting DES: modelling and analysis
inferred← citeshttps://doi.org/10.1109/tse.1983.234783openalex-snapshot
A Causal Model for Analyzing Distributed Concurrency Control Algorithms
inferred← citeshttps://doi.org/10.1145/100348.100367openalex-snapshot
Specifying and automatically generating Ada tasks in Prolog
inferred← citeshttps://doi.org/10.1145/100348.100371openalex-snapshot
A simple realization of a parallel device recognizing regular trace languages
inferred← citeshttps://doi.org/10.1145/322609.322790openalex-snapshot
How to relieve a programmer from synchronization details
inferred← citeshttps://doi.org/10.1145/356901.356903openalex-snapshot
Concepts and Notations for Concurrent Programming
inferred← citeshttps://doi.org/10.1145/74587.74629openalex-snapshot
Timing analysis of cyclic concurrent programs
inferred← citeshttps://doi.org/10.1145/75427.75455openalex-snapshot
Complete sequential specification allows for concurrent execution
inferred← citeshttps://doi.org/10.1145/954312.954317openalex-snapshot
Synchronization of concurrent processes without globality assumptions
inferred← citeshttps://doi.org/10.3233/fi-1999-402308openalex-snapshot
An Acceptance Vector Semantics for Path Programs
inferred← citeshttps://doi.org/10.3233/fi-2010-278openalex-snapshot
Infinite Product of Traces Represented by Projections
inferred← citeshttps://doi.org/10.3233/fi-2015-1222openalex-snapshot
True Concurrency in Long-running Transactions for Digital Ecosystems
inferred← citeshttps://doi.org/10.3233/fun-2004-59405openalex-snapshot
A Set-Theoretic Framework for Component Composition
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.