On the public citation graph
Petri nets, event structures and domains
0 signed · 356 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/bfb0059689openalex-snapshot
Symposium on Semantics of Algorithmic Languages
inferredcites →https://doi.org/10.1016/0096-0551(83)90036-xopenalex-snapshot
Denotational semantics: The scott-strachey approach to programming language theory
inferredcites →https://doi.org/10.3233/fi-1980-3107openalex-snapshot
A theorem on the characteristics of non-sequential processes
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.1002/malq.201600020openalex-snapshot
Normal forms, linearity, and prime algebraicity over nonflat domains
inferred← citeshttps://doi.org/10.1002/sec.794openalex-snapshot
Modeling and formal verification of smart environments
inferred← citeshttps://doi.org/10.1006/inco.1994.1003openalex-snapshot
Lambda-Calculi for (Strict) Parallel Functions
inferred← citeshttps://doi.org/10.1006/inco.1995.1032openalex-snapshot
A Trace Semantics for Petri Nets
inferred← citeshttps://doi.org/10.1006/inco.1998.2752openalex-snapshot
Context-Free Event Domains Are Recognizable
inferred← citeshttps://doi.org/10.1006/inco.2001.3050openalex-snapshot
Functorial Models for Petri Nets
inferred← citeshttps://doi.org/10.1006/inco.2001.3060openalex-snapshot
Contextual Petri Nets, Asymmetric Event Structures, and Processes
inferred← citeshttps://doi.org/10.1007/11690634_9openalex-snapshot
Distributed Unfolding of Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-09981-6_7openalex-snapshot
Processus non-sequentiels et leurs observations en univers non-centralise
inferred← citeshttps://doi.org/10.1007/3-540-10001-6_27openalex-snapshot
The relative strength of K-density
inferred← citeshttps://doi.org/10.1007/3-540-10699-5_113openalex-snapshot
A proposal for operational semantics and equivalence of finite asynchronous processes
inferred← citeshttps://doi.org/10.1007/3-540-12920-0_13openalex-snapshot
A new definition of morphism on Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_18openalex-snapshot
On the relationship of CCS and petri nets
inferred← citeshttps://doi.org/10.1007/3-540-13346-1_5openalex-snapshot
Using information systems to solve reoursive domain equations effectively
inferred← citeshttps://doi.org/10.1007/3-540-13883-8_66openalex-snapshot
Degrees of non-determinism and concurrency: A Petri net view
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_11openalex-snapshot
Csp-programs as nets with individual tokens
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_17openalex-snapshot
On structural properties of generalized processes
inferred← citeshttps://doi.org/10.1007/3-540-15204-0_3openalex-snapshot
Concurrency axioms and D-continuous posets
inferred← citeshttps://doi.org/10.1007/3-540-15641-0_26openalex-snapshot
Deterministic asynchronous automata
inferred← citeshttps://doi.org/10.1007/3-540-17660-8_52openalex-snapshot
On the semantics of concurrency: Partial orders and transition systems
inferred← citeshttps://doi.org/10.1007/3-540-17945-3_13openalex-snapshot
Petri net models for algebraic theories of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-19020-1_18openalex-snapshot
dI-domains as a model of polymorphism
inferred← citeshttps://doi.org/10.1007/3-540-40911-4_4openalex-snapshot
Formalizing Timing Diagrams as Causal Dependencies for Verification Purposes
inferred← citeshttps://doi.org/10.1007/3-540-44667-2_11openalex-snapshot
General Distributions in Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_34openalex-snapshot
Compositional Modeling of Reactive Systems Using Open Nets
inferred← citeshttps://doi.org/10.1007/3-540-44881-0_33openalex-snapshot
Stable Computational Semantics of Conflict-Free Rewrite Systems (Partial Orders with Duplication)
inferred← citeshttps://doi.org/10.1007/3-540-45605-8_7openalex-snapshot
Probabilistic Unfoldings and Partial Order Fairness in Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_27openalex-snapshot
Black Box Unfolding with Local First Search
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_20openalex-snapshot
Regular Event Structures and Finite Petri Nets: The Conflict-Free Case
inferred← citeshttps://doi.org/10.1007/3-540-48437-x_8openalex-snapshot
Protocol Engineering for Multi-agent Interaction
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_16openalex-snapshot
Model Checking Logics for Communicating Sequential Agents
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_30openalex-snapshot
Requirement and design specification for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-51237-3_6openalex-snapshot
Concurrent processes with synchronization: Net and algebraic approach
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_57openalex-snapshot
Concurrent nondeterministic processes: Adequacy of structure and behaviour
inferred← citeshttps://doi.org/10.1007/3-540-52494-0_26openalex-snapshot
Descriptive and analytical process algebras
inferred← citeshttps://doi.org/10.1007/3-540-52494-0_44openalex-snapshot
CEDISYS compositional distributed systems state of the art, research goals, references
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_10openalex-snapshot
Causal trees interleaving + causality
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_16openalex-snapshot
Observers, experiments, and agents: A comprehensive approach to parallelism
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_19openalex-snapshot
On distributed languages and models for distributed computation
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_4openalex-snapshot
Flow event structures and flow nets
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_5openalex-snapshot
Three equivalent semantics for CCS
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_8openalex-snapshot
Transition systems with algebraic structure as models of computations
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_2openalex-snapshot
On causality observed incrementally, finally
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_89openalex-snapshot
The observation algebra of spatial pomsets
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_94openalex-snapshot
Geometric logic, causality and event structures
inferred← citeshttps://doi.org/10.1007/3-540-54458-5_55openalex-snapshot
The consistency of a noninterleaving and an interleaving model for full TCSP
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_175openalex-snapshot
On distributed languages and models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-55613-3_7openalex-snapshot
Trace semantics for actor systems
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_53openalex-snapshot
On relating some models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_93openalex-snapshot
Model checking using net unfoldings
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_69openalex-snapshot
A disabling of event structures
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_20openalex-snapshot
A generalized event structure for the Muller unfolding of a safe net
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_32openalex-snapshot
Local event structures and Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_21openalex-snapshot
On relating rewriting systems and graph grammars to event structures
inferred← citeshttps://doi.org/10.1007/3-540-57787-4_5openalex-snapshot
Graph-grammar semantics of a higher-order programming language for distributed systems
inferred← citeshttps://doi.org/10.1007/3-540-58152-9_14openalex-snapshot
A term representation of P/T systems
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_81openalex-snapshot
Bistructures, bidomains and linear logic
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_13openalex-snapshot
Characterizing behavioural congruences for Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-60688-2_41openalex-snapshot
Complexity as a basis for comparing semantic models of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-61042-1_40openalex-snapshot
An improvement of McMillan's unfolding algorithm
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_102openalex-snapshot
Marrella: A tool for simulation and verification
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_35openalex-snapshot
Deadlock checking using net unfoldings
inferred← citeshttps://doi.org/10.1007/3-540-65307-4_49openalex-snapshot
Petri nets and digital hardware design
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_15openalex-snapshot
Possible and Guaranteed Concurrency in CSP
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_7openalex-snapshot
Graphs for Generalized Traces
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_15openalex-snapshot
Rendez- Vous with Bundle Event Structures
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_9openalex-snapshot
Causal Automata I: Confluence ≡ {AND, OR} Causality
inferred← citeshttps://doi.org/10.1007/978-1-84800-356-9_4openalex-snapshot
Social Trust of Virtual Identities
inferred← citeshttps://doi.org/10.1007/978-3-031-06653-5_17openalex-snapshot
Aligning Event Logs to Resource-Constrained $$\nu $$-Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-031-24117-8_9openalex-snapshot
The Mays and Musts of Concurrent Strategies
inferred← citeshttps://doi.org/10.1007/978-3-031-35355-0_13openalex-snapshot
Relating Reversible Petri Nets and Reversible Event Structures, Categorically
inferred← citeshttps://doi.org/10.1007/978-3-319-03998-5_10openalex-snapshot
Two Semantic Models for Clock Relations in the Clock Constraint Specification Language
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_12openalex-snapshot
The 4C Spectrum of Fundamental Behavioral Relations for Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-17581-2_12openalex-snapshot
Coalgebraic Semantic Model for the Clock Constraint Specification Language
inferred← citeshttps://doi.org/10.1007/978-3-319-25150-9_6openalex-snapshot
On Probabilistic Distributed Strategies
inferred← citeshttps://doi.org/10.1007/978-3-319-51963-0_11openalex-snapshot
Configuration- and Residual-Based Transition Systems for Event Structures with Asymmetric Conflict
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_3openalex-snapshot
A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus
inferred← citeshttps://doi.org/10.1007/978-3-319-57861-3_11openalex-snapshot
Model Checking Concurrency and Causality
inferred← citeshttps://doi.org/10.1007/978-3-319-59746-1_9openalex-snapshot
Many-to-Many Information Flow Policies
inferred← citeshttps://doi.org/10.1007/978-3-319-68270-9_4openalex-snapshot
Delayed-Choice Semantics for Pomset Families and Message Sequence Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-91268-4_7openalex-snapshot
From Event-Oriented Models to Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-96142-2_22openalex-snapshot
Quasi-Optimal Partial Order Reduction
inferred← citeshttps://doi.org/10.1007/978-3-319-99498-7_7openalex-snapshot
Event Structure Semantics of (controlled) Reversible CCS
inferred← citeshttps://doi.org/10.1007/978-3-540-24617-6_13openalex-snapshot
Automatic Generation of Test Purposes for Testing Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24698-5_49openalex-snapshot
Distributed Games and Distributed Control for Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27755-2_22openalex-snapshot
Communicating Transaction Processes: An MSC-Based Model of Computation for Reactive Embedded Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27812-2_18openalex-snapshot
On the Formal Modelling of Trust in Reputation-Based Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-28629-5_42openalex-snapshot
Event Structures for Resolvable Conflict
inferred← citeshttps://doi.org/10.1007/978-3-540-39724-3_33openalex-snapshot
Efficient Hybrid Reachability Analysis for Asynchronous Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_1openalex-snapshot
Distributed Monitoring of Concurrent and Asynchronous Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-47919-2_4openalex-snapshot
Behaviour of Elementary Net Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_47openalex-snapshot
Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_27openalex-snapshot
Asynchronous Games: Innocence Without Alternation
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_3openalex-snapshot
Rule-Based Modelling of Cellular Signalling
inferred← citeshttps://doi.org/10.1007/978-3-540-76637-7_10openalex-snapshot
Scalable Simulation of Cellular Signaling Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-85762-4_5openalex-snapshot
Non-interleaving Semantics with Causality for Nondeterministic Dataflow
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_9openalex-snapshot
Partial Orders, Event Structures and Linear Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_6openalex-snapshot
Critical Paths in the Partial Order Unfolding of a Stochastic Petri Net
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/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-16023-3_17openalex-snapshot
Modeling and Analyzing Periodic Distributed Computations
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_14openalex-snapshot
On the Origin of Events: Branching Cells as Stubborn Sets
inferred← citeshttps://doi.org/10.1007/978-3-642-38164-5_2openalex-snapshot
Imperfect Information in Logic and Concurrent Games
inferred← citeshttps://doi.org/10.1007/978-3-642-40184-8_36openalex-snapshot
Borel Determinacy of Concurrent Games
inferred← citeshttps://doi.org/10.1007/978-3-642-60729-5_11openalex-snapshot
A description model to support test suite derivation for concurrent systems
inferred← citeshttps://doi.org/10.1007/978-3-642-68353-4_15openalex-snapshot
An Exercise in Processes with Infinite Pasts
inferred← citeshttps://doi.org/10.1007/978-3-642-72822-8_27openalex-snapshot
Algebraic Models of Parallelism and Net Theory
inferred← citeshttps://doi.org/10.1007/978-3-642-74127-2_3openalex-snapshot
Spezifikation und Entwurf komplexer, kausal vernetzter Systeme
inferred← citeshttps://doi.org/10.1007/978-3-642-79361-5_8openalex-snapshot
Action Structures and the Pi Calculus
inferred← citeshttps://doi.org/10.1007/978-3-662-46669-8_24openalex-snapshot
Composite Replicated Data Types
inferred← citeshttps://doi.org/10.1007/bf00122081openalex-snapshot
A unified signal transition graph model for asynchronous control circuit synthesis
inferred← citeshttps://doi.org/10.1007/bf00122082openalex-snapshot
On the models for asynchronous circuit behaviour with OR causality
inferred← citeshttps://doi.org/10.1007/bf00263648openalex-snapshot
A functional model for describing and reasoning about time behaviour of computing systems
inferred← citeshttps://doi.org/10.1007/bf01178923openalex-snapshot
The connection between an event structure semantics and an operational semantics forTCSP
inferred← citeshttps://doi.org/10.1007/bf01211434openalex-snapshot
Towards a formal foundation of the specification and description language SDL
inferred← citeshttps://doi.org/10.1007/bf01388999openalex-snapshot
Partial ordering models for concurrency can be defined operationally
inferred← citeshttps://doi.org/10.1007/bf01888216openalex-snapshot
Branching versus linear logics yet again
inferred← citeshttps://doi.org/10.1007/bf02277859openalex-snapshot
Detecting causal relationships in distributed computations: In search of the holy grail
inferred← citeshttps://doi.org/10.1007/bf02733067openalex-snapshot
Some properties of event structures
inferred← citeshttps://doi.org/10.1007/bf02915446openalex-snapshot
A distributed operational semantics for CCS based on condition/event systems
inferred← citeshttps://doi.org/10.1007/bf03036469openalex-snapshot
Axiomatizing the algebra of net computations and processes
inferred← citeshttps://doi.org/10.1007/bf03180567openalex-snapshot
Multitraces, hypertraces and partial order semantics
inferred← citeshttps://doi.org/10.1007/bfb0012772openalex-snapshot
Some properties of D-continuous causal nets
inferred← citeshttps://doi.org/10.1007/bfb0012800openalex-snapshot
Event structure semantics for CCS and related languages
inferred← citeshttps://doi.org/10.1007/bfb0012801openalex-snapshot
Domains for denotational semantics
inferred← citeshttps://doi.org/10.1007/bfb0013030openalex-snapshot
Partial orderings descriptions and observations of nondeterministic concurrent processes
inferred← citeshttps://doi.org/10.1007/bfb0016226openalex-snapshot
Petri nets, morphisms and compositionality
inferred← citeshttps://doi.org/10.1007/bfb0017129openalex-snapshot
On models and algebras for concurrent processes
inferred← citeshttps://doi.org/10.1007/bfb0019966openalex-snapshot
Delays in synchronized elementary net systems
inferred← citeshttps://doi.org/10.1007/bfb0028746openalex-snapshot
Model checking LTL using net unforldings
inferred← citeshttps://doi.org/10.1007/bfb0029970openalex-snapshot
Relating conflict-free stable transition and event models (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0030632openalex-snapshot
Verification of message sequence charts via template matching
inferred← citeshttps://doi.org/10.1007/bfb0036207openalex-snapshot
Behavioural characterizations of partial order logics
inferred← citeshttps://doi.org/10.1007/bfb0036914openalex-snapshot
Processes of place/transition-nets
inferred← citeshttps://doi.org/10.1007/bfb0039711openalex-snapshot
Observing some properties of event structures
inferred← citeshttps://doi.org/10.1007/bfb0052092openalex-snapshot
Representation theorems for Petri Nets
inferred← citeshttps://doi.org/10.1007/bfb0054163openalex-snapshot
Verification based on local states
inferred← citeshttps://doi.org/10.1007/s00165-009-0103-1openalex-snapshot
Atomic actions, and their refinements to isolated protocols
inferred← citeshttps://doi.org/10.1007/s00165-012-0235-6openalex-snapshot
Deterministic concurrent strategies
inferred← citeshttps://doi.org/10.1007/s00165-014-0329-4openalex-snapshot
Untanglings: a novel approach to analyzing concurrent systems
inferred← citeshttps://doi.org/10.1007/s00165-016-0405-zopenalex-snapshot
An empirical comparison of formalisms for modelling and analysis of dynamic reconfiguration of dependable systems
inferred← citeshttps://doi.org/10.1007/s10009-021-00616-0openalex-snapshot
DisCoveR: accurate and efficient discovery of declarative process models
inferred← citeshttps://doi.org/10.1007/s10626-005-5238-5openalex-snapshot
Distributed Monitoring of Concurrent and Asynchronous Systems*
inferred← citeshttps://doi.org/10.1007/s10626-006-0001-0openalex-snapshot
Trellis Processes : A Compact Representation for Runs of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/s10626-007-0016-1openalex-snapshot
Partial Order Techniques for Distributed Discrete Event Systems: Why You Cannot Avoid Using Them
inferred← citeshttps://doi.org/10.1007/s10626-011-0121-zopenalex-snapshot
What topology tells us about diagnosability in partial order semantics
inferred← citeshttps://doi.org/10.1007/s10703-020-00350-4openalex-snapshot
Quasi-optimal partial order reduction
inferred← citeshttps://doi.org/10.1007/s11047-008-9101-0openalex-snapshot
A Petri net model for membrane systems with dynamic structure
inferred← citeshttps://doi.org/10.1007/s13740-020-00112-9openalex-snapshot
Declarative and Hybrid Process Discovery: Recent Advances and Open Challenges
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00019-0openalex-snapshot
Model checking using net unfoldings
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90026-6openalex-snapshot
Synthesis and equivalence of concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90096-5openalex-snapshot
Concurrency and atomicity
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90050-9openalex-snapshot
Concurrent transition systems
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90052-2openalex-snapshot
Concurrent systems and inevitability
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90134-4openalex-snapshot
Un modèle asynchrone pour les systèmes distribués
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90157-dopenalex-snapshot
On Scott's thesis for domains of information and well-quasi-orderings
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90193-lopenalex-snapshot
Some behavioural aspects of net theory
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90087-iopenalex-snapshot
Event structures and trace monoids
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90304-kopenalex-snapshot
An algebra of concurrent non-deterministic processes
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90305-lopenalex-snapshot
Connectedness and synchronization
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90181-eopenalex-snapshot
A logical characterization of well branching event structures
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90089-copenalex-snapshot
Historical introduction to “concrete domains” by G. Kahn and G.D. Plotkin
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90247-qopenalex-snapshot
The poset of infinitary traces
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90361-vopenalex-snapshot
Refinement of actions in event structures and causal trees
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00046-8openalex-snapshot
Denotational semantics in the cpo and metric approach
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90009-4openalex-snapshot
Proving partial order properties
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00121-2openalex-snapshot
Process versus unfolding semantics for Place/Transition Petri nets
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00133-6openalex-snapshot
Quasi-prime algebraic domains
inferred← citeshttps://doi.org/10.1016/0306-4379(91)90001-popenalex-snapshot
Formal techniques for systems specification and verification
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90032-0openalex-snapshot
Petri nets, algebras, morphisms, and compositionality
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90051-5openalex-snapshot
Membership problems for regular and context-free trace languages
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90068-dopenalex-snapshot
Using information systems to solve recursive domain equations
inferred← citeshttps://doi.org/10.1016/b978-0-12-394397-2.00065-9openalex-snapshot
Online e-Reputation Management Services
inferred← citeshttps://doi.org/10.1016/b978-0-12-803843-7.00086-7openalex-snapshot
e-Reputation and Online Reputation Management Survey
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50024-xopenalex-snapshot
Operational and Algebraic Semantics of Concurrent Processes
inferred← citeshttps://doi.org/10.1016/j.artint.2023.103919openalex-snapshot
Reasoning about causality in games
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.08.016openalex-snapshot
Simulations as Homotopies
inferred← citeshttps://doi.org/10.1016/j.entcs.2006.10.055openalex-snapshot
Event Structure Spans for Nondeterministic Dataflow
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.017openalex-snapshot
A Bayesian Model for Event-based Trust
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.02.022openalex-snapshot
Event Structures with Symmetry
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.05.007openalex-snapshot
Formal Relationships Between Geometrical and Classical Models for Concurrency
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.008openalex-snapshot
On Concurrent Games with Payoff
inferred← citeshttps://doi.org/10.1016/j.ic.2010.12.002openalex-snapshot
Model-checking games for fixpoint logics with partial order models
inferred← citeshttps://doi.org/10.1016/j.ic.2013.11.002openalex-snapshot
Modeling, analyzing and slicing periodic distributed computations
inferred← citeshttps://doi.org/10.1016/j.ins.2019.05.021openalex-snapshot
Deadlock detection-oriented unfolding of unbounded Petri nets
showing the first 200 of 348 · page through all 348
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.