On the public citation graph
Basic notions of trace theory
0 signed · 215 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-08921-7_77openalex-snapshot
Synthesis of concurrent schemes
inferredcites →https://doi.org/10.1007/3-540-10856-4_86openalex-snapshot
An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages
inferredcites →https://doi.org/10.1007/3-540-15204-0_10openalex-snapshot
Fair serializability of iterated transactions using fifo-nets
inferredcites →https://doi.org/10.1007/3-540-15204-0_20openalex-snapshot
Semantics of concurrent systems: A modular fixed-point trace approach
inferredcites →https://doi.org/10.1007/3-540-16078-7_76openalex-snapshot
Equations in free partially commutative monoids
inferredcites →https://doi.org/10.1007/978-3-540-47919-2_4openalex-snapshot
Behaviour of Elementary Net Systems
inferredcites →https://doi.org/10.1007/978-3-642-72822-8_11openalex-snapshot
On the Structure of Dependence Graphs
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_23openalex-snapshot
Words over a Partially Commutative Alphabet
inferredcites →https://doi.org/10.1007/978-3-642-82921-5_9openalex-snapshot
Concurrent Computations and VLSI Circuits
inferredcites →https://doi.org/10.1007/bfb0012757openalex-snapshot
Equivalence and membership problems for regular trace languages
inferredcites →https://doi.org/10.1007/bfb0027048openalex-snapshot
Petri nets: Basic notions, structure, behaviour
inferredcites →https://doi.org/10.1007/bfb0030293openalex-snapshot
Traces, histories, graphs: Instances of a process monoid
inferredcites →https://doi.org/10.1007/bfb0079468openalex-snapshot
Problèmes combinatoires de commutation et réarrangements
inferredcites →https://doi.org/10.1016/0020-0190(85)90121-8openalex-snapshot
Some properties of commutation in free partially commutative monoids
inferredcites →https://doi.org/10.1016/0020-0190(86)90056-6openalex-snapshot
Square-free words on partially commutative free monoids
inferredcites →https://doi.org/10.1016/0166-218x(85)90080-0openalex-snapshot
Traces, dependency graphs and DNLC grammars
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(84)90053-7openalex-snapshot
Partial commutations and faithful rational transductions
inferredcites →https://doi.org/10.1016/0304-3975(85)90013-1openalex-snapshot
Recognizable subsets of some partially abelian monoids
inferredcites →https://doi.org/10.1016/0304-3975(85)90206-3openalex-snapshot
Maximal serializability of iterated transactions
inferredcites →https://doi.org/10.1016/0304-3975(87)90080-6openalex-snapshot
On regular trace languages
inferredcites →https://doi.org/10.1016/0890-5401(89)90051-5openalex-snapshot
Membership problems for regular and context-free trace languages
inferredcites →https://doi.org/10.1051/ita/1985190100211openalex-snapshot
Automates et commutations partielles
inferredcites →https://doi.org/10.1051/ita/1986200201031openalex-snapshot
Trace languages defined by regular string languages
inferredcites →https://doi.org/10.1051/ita/1987210200991openalex-snapshot
Notes on finite asynchronous automata
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/800220.806697openalex-snapshot
On serializability of iterated transactions
inferredcites →https://doi.org/10.25405/ncl.34127697openalex-snapshot
Formal Theory of the Basic COSY Notation
inferredcites →https://doi.org/10.3233/fi-1981-4305openalex-snapshot
A Classification and Closure Properties of Languages for Describing Concurrent System Behaviours
inferredcites →https://doi.org/10.3233/fi-1984-7108openalex-snapshot
Some Properties of Trace Languages
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/11495628_3openalex-snapshot
Deciding Properties of Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/11539452_38openalex-snapshot
A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs
inferred← citeshttps://doi.org/10.1007/3-540-36206-1_26openalex-snapshot
Hereditary History Preserving Bisimulation Is Decidable for Trace-Labelled Systems
inferred← citeshttps://doi.org/10.1007/3-540-45484-5_2openalex-snapshot
Towards Formal Specification and Verification in Cyberspace
inferred← citeshttps://doi.org/10.1007/3-540-45941-3_26openalex-snapshot
Efficient Model Checking of Causal-Knowledge Protocols
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_17openalex-snapshot
Synthesizing Distributed Transition Systems from Global Specifications
inferred← citeshttps://doi.org/10.1007/3-540-49213-5_24openalex-snapshot
Compositional Transformational Design for Concurrent Programs
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-53487-3_52openalex-snapshot
Defining process fairness for non-interleaving concurrency
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_3openalex-snapshot
On the domain of traces and sequential composition
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_154openalex-snapshot
On logics, tilings, and automata
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-55511-0_18openalex-snapshot
Trade-offs in true concurrency: Pomsets and mazurkiewicz traces
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-55895-0_498openalex-snapshot
The design of a parallel algorithm to solve the word problem for free partially commutative groups
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_45openalex-snapshot
Axiomatizations of temporal logics on trace systems
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_59openalex-snapshot
Deterministic behavioural models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_5openalex-snapshot
Modular completeness for Communication Closed Layers
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_7openalex-snapshot
A classification of models for concurrency
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_71openalex-snapshot
Keeping track of the latest gossip: Bounded time-stamps suffice
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_13openalex-snapshot
On the specification of elementary reactive behaviour
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_25openalex-snapshot
Relationships between models of concurrency
inferred← citeshttps://doi.org/10.1007/3-540-58043-3_30openalex-snapshot
Partial order based design of concurrent systems
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_63openalex-snapshot
Determinizing asynchronous automata
inferred← citeshttps://doi.org/10.1007/3-540-58843-4_20openalex-snapshot
Analysis of dynamical systems using predicate transformers: Attraction and composition
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_12openalex-snapshot
A complete theory of deterministic event structures
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_57openalex-snapshot
Computing Petri net languages by reductions
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_67openalex-snapshot
Determinizing Büchi asynchronous automata
inferred← citeshttps://doi.org/10.1007/3-540-61363-3_25openalex-snapshot
Behavioural equivalence for infinite systems — Partially decidable!
inferred← citeshttps://doi.org/10.1007/3-540-61377-3_41openalex-snapshot
Languages and logical definability in concurrency monoids
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_79openalex-snapshot
Towards automata for branching time and partial order
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_81openalex-snapshot
Action refinement and property inheritance in systems of sequential agents
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_49openalex-snapshot
Partial orders and verification of real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_52openalex-snapshot
On specifying real-time systems in a causality-based setting
inferred← citeshttps://doi.org/10.1007/3-540-63166-6_34openalex-snapshot
Partial-order reduction in symbolic state space exploration
inferred← citeshttps://doi.org/10.1007/978-0-387-35198-8_16openalex-snapshot
On test case generation from asynchronously communicating state machines
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_18openalex-snapshot
A Local Presentation of Synchronizing Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3078-9_2openalex-snapshot
CALIBAN - Esprit Basic Research WG 6067
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_15openalex-snapshot
Concurrency, Fairness and Logical Complexity
inferred← citeshttps://doi.org/10.1007/978-1-4471-3503-6_16openalex-snapshot
Concurrency and Conflict in CSP
inferred← citeshttps://doi.org/10.1007/978-1-4757-3851-3_9openalex-snapshot
Global State Considered Unnecessary: Introduction to Object-Based Semantics
inferred← citeshttps://doi.org/10.1007/978-1-4757-6656-1_2openalex-snapshot
From Global Specifications to Distributed Implementations
inferred← citeshttps://doi.org/10.1007/978-3-030-50029-0_16openalex-snapshot
A True Concurrent Model of Smart Contracts Executions
inferred← citeshttps://doi.org/10.1007/978-3-030-78142-2_11openalex-snapshot
A Theory of Automated Market Makers in DeFi
inferred← citeshttps://doi.org/10.1007/978-3-031-43835-6_19openalex-snapshot
Causal Reversibility Implies Time Reversibility
inferred← citeshttps://doi.org/10.1007/978-3-319-15579-1_54openalex-snapshot
Order Structures for Subclasses of Generalised Traces
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7openalex-snapshot
Language and Automata Theory and Applications
inferred← citeshttps://doi.org/10.1007/978-3-319-53733-7_24openalex-snapshot
Merging Relations: A Way to Compact Petri Nets’ Behaviors Uniformly
inferred← citeshttps://doi.org/10.1007/978-3-540-31847-7_22openalex-snapshot
Loose Semantics of Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-40022-6_15openalex-snapshot
Team Automata for CSCW – A Survey –
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_20openalex-snapshot
Weak Sequential Composition in Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-70545-1_47openalex-snapshot
Producing Short Counterexamples Using “Crucial Events”
inferred← citeshttps://doi.org/10.1007/978-3-540-77966-7_12openalex-snapshot
Test Case Generation for Ultimately Periodic Paths
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-16901-4_23openalex-snapshot
Automating Cut-off for Multi-parameterized Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-22110-1_50openalex-snapshot
Fully Symbolic Model Checking for Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-662-25209-3_20openalex-snapshot
Parallel complexity in the design and analysis of concurrent systems
inferred← citeshttps://doi.org/10.1007/978-3-662-55862-1_9openalex-snapshot
Multiplicative Transition Systems
inferred← citeshttps://doi.org/10.1007/bf00464356openalex-snapshot
Specification and automatic verification of self-timed queues
inferred← citeshttps://doi.org/10.1007/bf01215409openalex-snapshot
When is partial trace equivalence adequate?
inferred← citeshttps://doi.org/10.1007/bf01783665openalex-snapshot
Behavioural notions for elementary net systems
inferred← citeshttps://doi.org/10.1007/bf01806032openalex-snapshot
Global state considered unnecessary: An introduction to object-based semantics
inferred← citeshttps://doi.org/10.1007/bf02108193openalex-snapshot
Specification and analysis of self-timed circuits
inferred← citeshttps://doi.org/10.1007/bf02717184openalex-snapshot
Distributed automata in an assumption-commitment framework
inferred← citeshttps://doi.org/10.1007/bfb0014001openalex-snapshot
A hierarchy of partial order temporal properties
inferred← citeshttps://doi.org/10.1007/bfb0015012openalex-snapshot
Weak sequential composition in process algebras
inferred← citeshttps://doi.org/10.1007/bfb0015456openalex-snapshot
Event automata as a generic model of reactive systems
inferred← citeshttps://doi.org/10.1007/bfb0023731openalex-snapshot
Using partial orders to improve automatic verification methods
inferred← citeshttps://doi.org/10.1007/bfb0029990openalex-snapshot
Dependency-based action refinement
inferred← citeshttps://doi.org/10.1007/bfb0034753openalex-snapshot
Refinement mapping for general (discrete event) systems theory
inferred← citeshttps://doi.org/10.1007/bfb0035386openalex-snapshot
Model-checking for a subclass of event structures
inferred← citeshttps://doi.org/10.1007/bfb0040252openalex-snapshot
A generalized Kahn Principle for abstract asynchronous networks
inferred← citeshttps://doi.org/10.1007/s002360050072openalex-snapshot
Net-based control versus rational control The relation between ITNC vector languages and rational relations
inferred← citeshttps://doi.org/10.1007/s002360100070openalex-snapshot
Process algebra with action dependencies
inferred← citeshttps://doi.org/10.1007/s004460050031openalex-snapshot
Keeping track of the latest gossip in a distributed system
inferred← citeshttps://doi.org/10.1007/s004460050062openalex-snapshot
Proving refinement using transduction
inferred← citeshttps://doi.org/10.1007/s10849-009-9118-5openalex-snapshot
Automata for Epistemic Temporal Logic with Synchronous Communication
inferred← citeshttps://doi.org/10.1016/0020-0190(91)90224-6openalex-snapshot
The parallel complexity of two problems on concurrency
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90007-iopenalex-snapshot
On undecidability of propositional temporal logics on trace systems
inferred← citeshttps://doi.org/10.1016/0020-0190(92)90187-zopenalex-snapshot
Decidability of the Star Problem in
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00065-4openalex-snapshot
Logics and decidability for labelled pre- and partially ordered Kripke structures
inferred← citeshttps://doi.org/10.1016/0020-0190(96)00111-1openalex-snapshot
Modelling causality via action dependencies in branching time semantics
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00122-0openalex-snapshot
Petri nets and bisimulation
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00254-5openalex-snapshot
Interval logics and their decision procedures
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50035-7openalex-snapshot
Algebraic Process Verification
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1453-5.50023-4openalex-snapshot
Knowledge and the ordering of events in distributed systems Extended Abstract
inferred← citeshttps://doi.org/10.1016/j.artint.2005.01.002openalex-snapshot
A formal framework for the decentralised diagnosis of large scale discrete event systems and its application to telecommunication networks
inferred← citeshttps://doi.org/10.1016/j.entcs.2007.03.008openalex-snapshot
Concurrent Logic and Automata Combined: A Semantics for Components
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.05.007openalex-snapshot
A Boolean Algebra of Contracts for Assume-guarantee Reasoning
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.06.005openalex-snapshot
Transaction Scripts: Making Implicit Scenarios Explicit
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.013openalex-snapshot
A Geometric View of Partial Order Reduction
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.06.006openalex-snapshot
Extending Propositional Dynamic Logic for Petri Nets
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.04.008openalex-snapshot
A Calculus for Automatic Verification of Petri Nets Based on Resolution and Dynamic Logics
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.05.002openalex-snapshot
Classifying invariant structures of step traces
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100582openalex-snapshot
Specifying reversibility with TLA+
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.009openalex-snapshot
Synchronous Kleene algebra
inferred← citeshttps://doi.org/10.1016/j.scico.2015.08.002openalex-snapshot
Fully symbolic TCTL model checking for complete and incomplete real-time systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.01.029openalex-snapshot
Domain theory for concurrency
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.03.030openalex-snapshot
EMSO-logic and automata related to homogeneous flow event structures
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.022openalex-snapshot
Algebraic topology and concurrency
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.019openalex-snapshot
Relational structures for concurrent behaviours
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00011-4openalex-snapshot
Models for concurrency: Towards a classification
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)80705-5openalex-snapshot
Metric completion versus ideal completion
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00342-4openalex-snapshot
Metric semantics for true concurrent real time
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80484-5openalex-snapshot
Specification and Verification using Message Sequence Charts
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80627-9openalex-snapshot
Distributed Timed Automata
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82524-1openalex-snapshot
Model checking of causal knowledge formulas
inferred← citeshttps://doi.org/10.1017/s0960129503004067openalex-snapshot
Concurrent computing machines and physical space-time
inferred← citeshttps://doi.org/10.1023/a:1008767206905openalex-snapshot
Partial-Order Reduction in Symbolic State-Space Exploration
inferred← citeshttps://doi.org/10.1023/a:1022407907596openalex-snapshot
Synchronizations in Team Automata for Groupware Systems
inferred← citeshttps://doi.org/10.1093/jigpal/jzu010openalex-snapshot
Propositional dynamic logic for Petri nets
inferred← citeshttps://doi.org/10.1109/acsd.2014.10openalex-snapshot
Layered Reduction for Abstract Probabilistic Automata
inferred← citeshttps://doi.org/10.1109/ase.2011.6100045openalex-snapshot
Scalable and precise symbolic analysis for atomicity violations
inferred← citeshttps://doi.org/10.1109/ase.2011.6100134openalex-snapshot
BEST: A symbolic testing tool for predicting multi-threaded program failures
inferred← citeshttps://doi.org/10.1109/ase.2013.6693064openalex-snapshot
Efficient data race prediction with incremental reasoning on time-stamped lock history
inferred← citeshttps://doi.org/10.1109/async.1994.656281openalex-snapshot
Bounded delay timing analysis of a class of CSP programs with choice
inferred← citeshttps://doi.org/10.1109/async.2000.836774openalex-snapshot
Formal verification of safety properties in timed circuits
inferred← citeshttps://doi.org/10.1109/csd.2001.981761openalex-snapshot
Overcoming heterophobia: modeling concurrency in heterogeneous systems
inferred← citeshttps://doi.org/10.1109/csd.2003.1207706openalex-snapshot
Component-based design: towards guided composition
inferred← citeshttps://doi.org/10.1109/dest.2008.4635168openalex-snapshot
Long-running Transactions: Semantics, schemas, implementation
inferred← citeshttps://doi.org/10.1109/dest.2012.6227907openalex-snapshot
An animation tool for exploring transactions in a DE
inferred← citeshttps://doi.org/10.1109/ftdcs.1992.217516openalex-snapshot
Using Petri nets as a model for Petri nets
inferred← citeshttps://doi.org/10.1109/isvd.2006.25openalex-snapshot
Map updates in a dynamic Voronoi data structure
inferred← citeshttps://doi.org/10.1109/isvd.2013.19openalex-snapshot
Spatio-temporal Map Generalizations with the Hierarchical Voronoi Data Structure
inferred← citeshttps://doi.org/10.1109/rtcsa.1998.726415openalex-snapshot
A state graph manipulator tool for real-time system specification and verification
inferred← citeshttps://doi.org/10.1109/sct.1991.160267openalex-snapshot
Adaptive logspace and depth-bounded reducibilities
inferred← citeshttps://doi.org/10.1109/seep.1998.707635openalex-snapshot
Independence in architectural descriptions
inferred← citeshttps://doi.org/10.1109/tdsc.2006.17openalex-snapshot
Automated Online Monitoring of Distributed Applications through External Monitors
inferred← citeshttps://doi.org/10.1142/9789814271059_0009openalex-snapshot
Automata on Distributed Alphabets
inferred← citeshttps://doi.org/10.1142/s021819679800017xopenalex-snapshot
Topology for Computations of Concurrent Automata
inferred← citeshttps://doi.org/10.1145/1101908.1101913openalex-snapshot
Exploiting predicate structure for efficient reachability detection
inferred← citeshttps://doi.org/10.1145/2043643.2043650openalex-snapshot
Relativistic Causality and Clockless Circuits
inferred← citeshttps://doi.org/10.1145/332740.332741openalex-snapshot
Using shape analysis to reduce finite-state models of concurrent Java programs
inferred← citeshttps://doi.org/10.1305/ndjfl/1040046090openalex-snapshot
Algebra and Theory of Order-Deterministic Pomsets
inferred← citeshttps://doi.org/10.13140/rg.2.2.26708.19841openalex-snapshot
Towards Partial Order Reductions for Fragments of Alternating-Time Temporal Logic
inferred← citeshttps://doi.org/10.17084/2013.iv-1(16).6openalex-snapshot
A FOATA NORMAL FORM AND ITS APPLICATION FOR THE PURPOSE OF ACCELERATING COMPUTATIONS BY A MULTI-GPU
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3257081/v1openalex-snapshot
Dynamic Partial Order Reduction Based on Interference Solution
inferred← citeshttps://doi.org/10.21236/ada256199openalex-snapshot
Trace Algebra for Automatic Verification of Real-Time Concurrent Systems
inferred← citeshttps://doi.org/10.24355/dbbs.084-200511080100-103openalex-snapshot
Foundations of a Module Concept for Distributed Object Systems
inferred← citeshttps://doi.org/10.3233/fi-2009-210openalex-snapshot
An Algebraic Framework for Defining Behaviours of Concurrent Systems. Part 2: The Axiomatic Presentation
inferred← citeshttps://doi.org/10.3233/fi-2011-505openalex-snapshot
Multiplicative Transition Systems
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/fi-2017-1562openalex-snapshot
Alphabets of Acyclic Invariant Structures
inferred← citeshttps://doi.org/10.3233/fi-2017-1574openalex-snapshot
Invariant Structures and Dependence Relations
inferred← citeshttps://doi.org/10.3233/fun-2005-681-206openalex-snapshot
Towards a Framework for Modelling Systems with Rich Internal Structures of States and Processes
inferred← citeshttps://doi.org/10.3390/a7030339openalex-snapshot
Model Checking Properties on Reduced Trace Systems
inferred← citeshttps://doi.org/10.3990/1.9789036507998openalex-snapshot
Quantitative and Qualitative Extensions of Event Structures
inferred← citeshttps://doi.org/10.4204/eptcs.223.7openalex-snapshot
A Modular Formalization of Reversibility for Concurrent Models and Languages
inferred← citeshttps://doi.org/10.4310/hha.2003.v5.n2.a5openalex-snapshot
Some geometric perspectives in concurrency theory
inferred← citeshttps://doi.org/10.46298/lmcs-17(4:10)2021openalex-snapshot
A theory of transaction parallelism in blockchains
inferred← citeshttps://doi.org/10.46298/lmcs-18(4:12)2022openalex-snapshot
A theory of Automated Market Makers in DeFi
inferred← citeshttps://doi.org/10.48550/arxiv.1301.1629openalex-snapshot
Partial Orders for Efficient BMC of Concurrent Software
inferred← citeshttps://doi.org/10.48550/arxiv.1405.4100openalex-snapshot
Higher Dimensional Modal Logic
inferred← citeshttps://doi.org/10.70675/221bda79z69baz42a6z9c28zaa941fac0f04openalex-snapshot
Testing concurrent systems through event structures
inferred← citeshttps://doi.org/10.70675/ae3ebcfbz1d22z4d74z911cz0c7246123c5copenalex-snapshot
Directed homotopy and homology theories for geometric models of true concurrency
inferred← citeshttps://doi.org/10.7146/brics.v2i4.19506openalex-snapshot
Petri Nets and Bisimulations
inferred← citeshttps://doi.org/10.7146/brics.v2i55.19956openalex-snapshot
Behavioural Equivalence for Infinite Systems—Partially Decidable!
inferred← citeshttps://doi.org/10.7146/brics.v2i58.19959openalex-snapshot
Determinizing Asynchronous Automata on Infinite Inputs
inferred← citeshttps://doi.org/10.7146/dpb.v20i353.6583openalex-snapshot
Transition Systems, Event Structures and Unfoldings
inferred← citeshttps://doi.org/10.7146/dpb.v21i399.6633openalex-snapshot
Transition System Models for Concurrency
inferred← citeshttps://doi.org/10.7146/dpb.v22i456.6929openalex-snapshot
Relationships between Models of Concurency
inferred← citeshttps://doi.org/10.7494/csci.2020.21.4.3728openalex-snapshot
CAUSAL REVERSIBILITY IN INDIVIDUAL TOKEN INTERPRETATION OF PETRI NETS
inferred← citeshttps://doi.org/10.7561/sacs.2018.2.237openalex-snapshot
A Precise Characterisation of Step Traces and Their Concurrent Histories
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.