On the public citation graph
Models and logics for true concurrency
0 signed · 57 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.1002/j.1538-7305.1961.tb03975.xopenalex-snapshot
Proving Theorems by Pattern Recognition - II
inferredcites →https://doi.org/10.1007/3-540-17945-3_13openalex-snapshot
Petri net models for algebraic theories of concurrency
inferredcites →https://doi.org/10.1007/3-540-18088-5_24openalex-snapshot
A modal logic for a subclass of event structures
inferredcites →https://doi.org/10.1007/3-540-52048-1_40openalex-snapshot
An axiomatization of event structures
inferredcites →https://doi.org/10.1007/3-540-53479-2_4openalex-snapshot
Flow event structures and flow nets
inferredcites →https://doi.org/10.1007/978-1-4613-0609-2_23openalex-snapshot
A Temporal Logic for Event Structures
inferredcites →https://doi.org/10.1007/978-3-540-47919-2openalex-snapshot
Petri Nets: Central Models and Their Properties
inferredcites →https://doi.org/10.1007/bf01379149openalex-snapshot
Modeling concurrency with partial orders
inferredcites →https://doi.org/10.1007/bf01783665openalex-snapshot
Behavioural notions for elementary net systems
inferredcites →https://doi.org/10.1007/bfb0012800openalex-snapshot
Event structure semantics for CCS and related languages
inferredcites →https://doi.org/10.1007/bfb0013030openalex-snapshot
Partial orderings descriptions and observations of nondeterministic concurrent processes
inferredcites →https://doi.org/10.1007/bfb0013032openalex-snapshot
An efficient verification method for parallel and distributed programs
inferredcites →https://doi.org/10.1007/bfb0013033openalex-snapshot
A logic for distributed transition systems
inferredcites →https://doi.org/10.1007/bfb0013037openalex-snapshot
Towards a temporal logic for causality and choice in distributed systems
inferredcites →https://doi.org/10.1016/0022-0000(87)90032-8openalex-snapshot
Concurrent histories: A basis for observing distributed systems
inferredcites →https://doi.org/10.1016/0167-6423(90)90076-popenalex-snapshot
Communication and concurrency
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(87)90012-0openalex-snapshot
Modal logics for communicating systems
inferredcites →https://doi.org/10.1016/0304-3975(87)90080-6openalex-snapshot
On regular trace languages
inferredcites →https://doi.org/10.1016/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferredcites →https://doi.org/10.1016/0304-3975(90)90193-lopenalex-snapshot
Some behavioural aspects of net theory
inferredcites →https://doi.org/10.1016/0304-3975(92)90181-eopenalex-snapshot
A logical characterization of well branching event structures
inferredcites →https://doi.org/10.1016/s0019-9958(84)80025-xopenalex-snapshot
Process algebra for synchronous communication
inferredcites →https://doi.org/10.1016/s0304-0208(08)73075-5openalex-snapshot
Recurring Dominoes: Making the Highly Undecidable Highly Understandable
inferredcites →https://doi.org/10.1051/ita/1987210200991openalex-snapshot
Notes on finite asynchronous automata
inferredcites →https://doi.org/10.1142/9789814368452_0011openalex-snapshot
Decidability and Undecidability in Distributed Transition Systems
inferredcites →https://doi.org/10.1142/s0129054192000103openalex-snapshot
TEMPORAL LOGICS FOR COMMUNICATING SEQUENTIAL AGENTS: I
inferredcites →https://doi.org/10.1145/2166.357222openalex-snapshot
Technical Correspondence: On Apt, Francez, and de Roever's ``A Proof System for Communicating Sequential Processes''
inferredcites →https://doi.org/10.1145/2455.2460openalex-snapshot
Algebraic laws for nondeterminism and concurrency
inferredcites →https://doi.org/10.1145/357103.357110openalex-snapshot
A Proof System for Communicating Sequential Processes
inferredcites →https://doi.org/10.1145/357980.358001openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/363235.363259openalex-snapshot
An axiomatic basis for computer programming
inferredcites →https://doi.org/10.1145/5397.5399openalex-snapshot
Automatic verification of finite-state concurrent systems using temporal logic specifications
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.3233/fi-1988-11406openalex-snapshot
A Non-Interleaving Semantics for CCS Based on Proved Transitions
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-56596-5_37openalex-snapshot
Towards an epistemic approach to reasoning about concurrent programs
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_104openalex-snapshot
Decidability of a partial order based temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-57163-9_26openalex-snapshot
On the relation between firing sequences and processes of Petri nets
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5openalex-snapshot
Logics for Databases and Information Systems
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_6openalex-snapshot
Logics for Specifying Concurrent Information Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-15375-4_34openalex-snapshot
Modal Logic over Higher Dimensional Automata
inferred← citeshttps://doi.org/10.1007/bfb0014430openalex-snapshot
Local specification of distributed families of sequential objects
inferred← citeshttps://doi.org/10.1007/s002360050141openalex-snapshot
Denotational semantics of object specification
inferred← citeshttps://doi.org/10.1007/s002360050167openalex-snapshot
Specifying communication in distributed information systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2009.03.038openalex-snapshot
Strategy-Based Rewrite Semantics for Membrane Systems Preserves Maximal Concurrency of Evolution Rule Actions
inferred← citeshttps://doi.org/10.1109/apsec.2012.134openalex-snapshot
Debug Concurrent Programs with Visualization and Inference of Event Structure
inferred← citeshttps://doi.org/10.1109/ecbs.2007.49openalex-snapshot
Model Checking of Computer-Based Systems
inferred← citeshttps://doi.org/10.1142/s0129054109006644openalex-snapshot
REWRITING LOGIC-BASED SEMANTICS OF P SYSTEMS AND THE MAXIMAL CONCURRENCY
inferred← citeshttps://doi.org/10.1145/1774088.1774600openalex-snapshot
A heterogeneous approach to service-oriented systems specification
inferred← citeshttps://doi.org/10.48550/arxiv.1405.4100openalex-snapshot
Higher Dimensional Modal Logic
inferred← citeshttps://doi.org/10.5815/ijcnis.2023.03.02openalex-snapshot
A Modern Mechanism for Formal Analysis of Biometric Authentication Security Protocol
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.