On the public citation graph
Modeling concurrency with partial orders
0 signed · 609 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-10699-5_102openalex-snapshot
Scenarios: A model of non-determinate computation
inferredcites →https://doi.org/10.1007/3-540-12920-0_13openalex-snapshot
A new definition of morphism on Petri nets
inferredcites →https://doi.org/10.1007/3-540-15648-8_22openalex-snapshot
Some constructions for order-theoretic models of concurrency
inferredcites →https://doi.org/10.1007/3-540-15670-4_12openalex-snapshot
Categories of models for concurrency
inferredcites →https://doi.org/10.1007/3-540-15670-4_9openalex-snapshot
The pomset model of parallel processes: Unifying the temporal and the spatial
inferredcites →https://doi.org/10.1007/3-540-16047-7openalex-snapshot
The Analysis of Concurrent Systems
inferredcites →https://doi.org/10.1007/3-540-16047-7_39openalex-snapshot
Two-way channel with disconnect
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony
inferredcites →https://doi.org/10.1145/567446.567462openalex-snapshot
On the temporal analysis of fairness
inferredcites →https://doi.org/10.1145/582153.582177openalex-snapshot
On the composition of processes
inferredcites →https://doi.org/10.1145/800222.806733openalex-snapshot
A temporal logic for reasoning about partially ordered computations (Extended Abstract)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70484openalex-snapshot
Weak Memory Model Formalisms: Introduction and Survey
inferred← citeshttps://doi.org/10.1006/inco.1997.2634openalex-snapshot
The Difference between Splitting innandn+1
inferred← citeshttps://doi.org/10.1007/10692867_14openalex-snapshot
NSA’s MISSI Reference Architecture – Moving from Prose to Precise Specifications
inferred← citeshttps://doi.org/10.1007/11423348_6openalex-snapshot
Models for Data-Flow Sequential Processes
inferred← citeshttps://doi.org/10.1007/11494744_17openalex-snapshot
Can I Execute My Scenario in Your Net?
inferred← citeshttps://doi.org/10.1007/11591962_5openalex-snapshot
Behavioral Types for Embedded Software – A Survey
inferred← citeshttps://doi.org/10.1007/11603771_4openalex-snapshot
Safe Composition of Distributed Programs Communicating over Order-Preserving Imperfect Channels
inferred← citeshttps://doi.org/10.1007/11767589_17openalex-snapshot
Towards Synthesis of Petri Nets from Scenarios
inferred← citeshttps://doi.org/10.1007/11767589_6openalex-snapshot
The Synthesis Problem of Netcharts
inferred← citeshttps://doi.org/10.1007/11784180_20openalex-snapshot
Realizability Criteria for Compositional MSC
inferred← citeshttps://doi.org/10.1007/11863908_24openalex-snapshot
Deriving Secrecy in Key Establishment Protocols
inferred← citeshttps://doi.org/10.1007/11951148_6openalex-snapshot
Timed High-Level Message Sequence Charts for Real-Time System Design
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-18317-5_14openalex-snapshot
Pomset interpretations of parallel functional programs
inferred← citeshttps://doi.org/10.1007/3-540-19488-6_147openalex-snapshot
Some behavioural aspects of net theory
inferred← citeshttps://doi.org/10.1007/3-540-36131-6_85openalex-snapshot
A Pomset-Based Model for Estimating Workcells’ Setups in Assembly Sequence Planning
inferred← citeshttps://doi.org/10.1007/3-540-36135-9_8openalex-snapshot
Formal Test Purposes and the Validity of Test Cases
inferred← citeshttps://doi.org/10.1007/3-540-37437-x_10openalex-snapshot
Parallelisierung, Nebenläufigkeit und alternative Modelle
inferred← citeshttps://doi.org/10.1007/3-540-44520-x_97openalex-snapshot
Implementing Declarative Concurrency in Java
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_31openalex-snapshot
Pomsets for Local Trace Languages
inferred← citeshttps://doi.org/10.1007/3-540-44618-4_38openalex-snapshot
Emptiness Is Decidable for Asynchronous Cellular Machines
inferred← citeshttps://doi.org/10.1007/3-540-44988-4_6openalex-snapshot
Reducing k-Safe Petri Nets to Pomset-Equivalent 1-Safe Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45022-x_55openalex-snapshot
Infinite Series-Parallel Posets: Logic and Languages
inferred← citeshttps://doi.org/10.1007/3-540-45314-8_9openalex-snapshot
Strengthening UML Collaboration Diagrams by State Transformations
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_22openalex-snapshot
On Regular Message Sequence Chart Languages and Relationships to Mazurkiewicz Trace Theory
inferred← citeshttps://doi.org/10.1007/3-540-45449-7_23openalex-snapshot
Using Multiple Levels of Abstractions in Embedded Software Design
inferred← citeshttps://doi.org/10.1007/3-540-45591-4_43openalex-snapshot
Declarative concurrency in Java
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_27openalex-snapshot
Regular Sets of Pomsets with Autoconcurrency
inferred← citeshttps://doi.org/10.1007/3-540-45694-5_31openalex-snapshot
Traces, Pomsets, Fairness and Full Abstraction for Communicating Processes
inferred← citeshttps://doi.org/10.1007/3-540-46691-6_25openalex-snapshot
Series and Parallel Operations on Pomsets
inferred← citeshttps://doi.org/10.1007/3-540-46852-8_9openalex-snapshot
A Formal Semantics for UML Interactions
inferred← citeshttps://doi.org/10.1007/3-540-48213-x_22openalex-snapshot
Some Pathological Message Sequence Charts, and How to Detect Them
inferred← citeshttps://doi.org/10.1007/3-540-48224-5_5openalex-snapshot
Modelling with Partial Orders — Why and Why Not?
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_10openalex-snapshot
Model Checking of Message Sequence Charts
inferred← citeshttps://doi.org/10.1007/3-540-48320-9_37openalex-snapshot
Event Structures as Presheaves—Two Representation Theorems
inferred← citeshttps://doi.org/10.1007/3-540-48762-x_89openalex-snapshot
Complex Visual Activity Recognition Using a Temporally Ordered Database
inferred← citeshttps://doi.org/10.1007/3-540-48912-6_63openalex-snapshot
Event Mining with Event Processing Networks
inferred← citeshttps://doi.org/10.1007/3-540-49019-1_19openalex-snapshot
Matching Specifications for Message Sequence Charts
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-49538-x_18openalex-snapshot
Interface-Based Protocol Specification of Open Systems using PSL
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_29openalex-snapshot
Modelling knowledge and action in distributed systems: Preliminary report
inferred← citeshttps://doi.org/10.1007/3-540-50403-6_42openalex-snapshot
A state transformation equivalence for concurrent systems: Exhibited functionality-equivalence
inferred← citeshttps://doi.org/10.1007/3-540-50517-2_90openalex-snapshot
McCarthy's amb cannot implement fair merge
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_71openalex-snapshot
Equivalence notions for concurrent systems and refinement of actions
inferred← citeshttps://doi.org/10.1007/3-540-51486-4_83openalex-snapshot
Pomset semantics for true concurrency with synchronization and recursion
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_20openalex-snapshot
Interleaving set temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-51803-7_31openalex-snapshot
Enforcing nondeterminism via linear time temporal logic specifications using hiding
inferred← citeshttps://doi.org/10.1007/3-540-52048-1_41openalex-snapshot
Deducing causal relationships in CCS
inferred← citeshttps://doi.org/10.1007/3-540-52282-4_51openalex-snapshot
Failures semantics based on interval semiwords is a congruence for refinement
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_35openalex-snapshot
Petri net systems and their closure properties
inferred← citeshttps://doi.org/10.1007/3-540-52494-0_42openalex-snapshot
Representation of a swapping class by one net
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-52559-9_68openalex-snapshot
Refinement of actions in causality based models
inferred← citeshttps://doi.org/10.1007/3-540-52590-4_47openalex-snapshot
Towards the unification of models for concurrency
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_2openalex-snapshot
Metric pomset semantics for a concurrent language with recursion
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-53487-3_53openalex-snapshot
Observational logics and concurrency models
inferred← citeshttps://doi.org/10.1007/3-540-53863-1_19openalex-snapshot
A survey of behaviour and equivalence preserving refinements of petri nets
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_1openalex-snapshot
Full abstraction for series-parallel pomsets
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-54152-7_58openalex-snapshot
Invariants and paradigms of concurrency theory
inferred← citeshttps://doi.org/10.1007/3-540-54152-7_60openalex-snapshot
Models for dynamically placed concurrent processes
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_55openalex-snapshot
Atomic refinement in process description languages
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_78openalex-snapshot
CCS dynamic bisimulation is progressing
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_106openalex-snapshot
Fairness in models with true concurrency
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_96openalex-snapshot
Action systems and action refinement in the development of parallel systems
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_97openalex-snapshot
Invariant semantics of nets with inhibitor arcs
inferred← citeshttps://doi.org/10.1007/3-540-54967-6_63openalex-snapshot
Failures semantics for a simple process language with refinement
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_17openalex-snapshot
Protocol design by layered decomposition
inferred← citeshttps://doi.org/10.1007/3-540-55160-3_34openalex-snapshot
Flexible program structures for concurrent programming
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_31openalex-snapshot
Partial-order model checking: A guide for the perplexed
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_33openalex-snapshot
Complexity results for POMSET languages
inferred← citeshttps://doi.org/10.1007/3-540-55253-7_18openalex-snapshot
A semantics for multiprocessor systems
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-55511-0_19openalex-snapshot
On relating concurrency and nondeterminism
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_128openalex-snapshot
Back and forth bisimulations on prime event structures
inferred← citeshttps://doi.org/10.1007/3-540-55599-4_129openalex-snapshot
Dynamic concurrent processes
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_171openalex-snapshot
A fifo-net model for processes with asynchronous communication
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_176openalex-snapshot
Partial words versus processes: A short comparison
inferred← citeshttps://doi.org/10.1007/3-540-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-55613-3_5openalex-snapshot
Semantic layers of object-based concurrent computing
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-55676-1_2openalex-snapshot
Combining Petri Nets and other formal methods
inferred← citeshttps://doi.org/10.1007/3-540-55676-1_3openalex-snapshot
Place bisimulations in Petri nets
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_11openalex-snapshot
Verifying timed behavior automata with nonbinary delay constraints
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-56891-3_30openalex-snapshot
B(PN) 2 — a basic Petri net programming notation
inferred← citeshttps://doi.org/10.1007/3-540-56922-7_35openalex-snapshot
Verifying timed behavior automata with input/output critical races
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-57182-5_9openalex-snapshot
The second calculus of binary relations
inferred← citeshttps://doi.org/10.1007/3-540-57529-4_68openalex-snapshot
Order structures and generalisations of Szpilrajn's theorem
inferred← citeshttps://doi.org/10.1007/3-540-57659-2_7openalex-snapshot
Event-based composition of concurrent programs
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_12openalex-snapshot
Compositional process semantics of Petri Boxes
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-58131-6_54openalex-snapshot
Bisimulation, games, and logic
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_174openalex-snapshot
Fault-tolerant bisimulation and process transformations
inferred← citeshttps://doi.org/10.1007/3-540-59155-9_10openalex-snapshot
Concurrency and Concurrent Constraint Programming
inferred← citeshttps://doi.org/10.1007/3-540-59175-3_84openalex-snapshot
Free shuffle algebras in language varieties extended abstract
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_190openalex-snapshot
Rational mechanics and natural mathematics
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_204openalex-snapshot
Nonfinite axiomatizability of shuffle inequalities
inferred← citeshttps://doi.org/10.1007/3-540-60043-4_59openalex-snapshot
Causality and true concurrency: A data-flow analysis of the Pi-Calculus
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_113openalex-snapshot
Causality for mobile processes
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_60openalex-snapshot
Nonfinite axiomatizability of the equational theory of shuffle
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_47openalex-snapshot
Efficient rewriting in cograph trace monoids
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_45openalex-snapshot
The expressive power of indeterminate primitives in asynchronous computation
inferred← citeshttps://doi.org/10.1007/3-540-60692-0_54openalex-snapshot
Observing behaviour categorically
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-61604-7_65openalex-snapshot
Truly concurrent constraint programming
inferred← citeshttps://doi.org/10.1007/3-540-61604-7_80openalex-snapshot
Asynchronous cellular automata for pomsets without auto-concurrency
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-63141-0_22openalex-snapshot
Causal ambiguity and partial orders in event structures
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_9openalex-snapshot
Adding partial orders to linear temporal logic
inferred← citeshttps://doi.org/10.1007/3-540-63531-9_24openalex-snapshot
A design framework for internet-scale event observation and notification
inferred← citeshttps://doi.org/10.1007/3-540-65306-6_23openalex-snapshot
Petri nets and other models of concurrency
inferred← citeshttps://doi.org/10.1007/978-0-387-34735-6_20openalex-snapshot
Completing Categorical Algebras
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_4openalex-snapshot
True versus artificial concurrency
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-0-387-35271-8_1openalex-snapshot
Specification-based testing of concurrent systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35561-0_1openalex-snapshot
Semantic Interactivity in Presence Systems
inferred← citeshttps://doi.org/10.1007/978-0-387-35563-4_17openalex-snapshot
Event-Based Execution Architectures for Dynamic Software Systems
inferred← citeshttps://doi.org/10.1007/978-1-4020-6254-4_20openalex-snapshot
On the Polychronous Approach to Embedded Software Design
inferred← citeshttps://doi.org/10.1007/978-1-4471-3544-9_8openalex-snapshot
The Design of a Delay-Insensitive Stack
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_20openalex-snapshot
Modelling Reactive Hardware Processes Using Partial Orders
inferred← citeshttps://doi.org/10.1007/978-1-4612-2822-6_17openalex-snapshot
Concurrent Programs as Strategies in Games
inferred← citeshttps://doi.org/10.1007/978-1-4615-4493-7_8openalex-snapshot
A (Max,+) Approach for Time in Message Sequence Charts
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-030-01042-3_8openalex-snapshot
Realizability of Service Specifications
inferred← citeshttps://doi.org/10.1007/978-3-030-03424-5_23openalex-snapshot
Static Code Verification Through Process Models
inferred← citeshttps://doi.org/10.1007/978-3-030-30690-8_2openalex-snapshot
Deriving Distributed Design Models from Global State Machines Requirements
inferred← citeshttps://doi.org/10.1007/978-3-030-50029-0_2openalex-snapshot
Choreographic Development of Message-Passing Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-95120-7_1openalex-snapshot
Algebraic Means of Heterogeneous Cyber-Physical Systems Design
inferred← citeshttps://doi.org/10.1007/978-3-031-20872-0_11openalex-snapshot
Realisability of Branching Pomsets
inferred← citeshttps://doi.org/10.1007/978-3-031-33620-1_16openalex-snapshot
Token Trail Semantics – Modeling Behavior of Petri Nets with Labeled Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-031-61433-0_8openalex-snapshot
Relational Structures for Interval Order Semantics of Concurrent Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-61433-0_9openalex-snapshot
Token Trail Semantics II - Petri Nets And Their Net Language
inferred← citeshttps://doi.org/10.1007/978-3-031-63501-4_12openalex-snapshot
Sequent Systems on Undirected Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-68279-7_3openalex-snapshot
Presenting Interval Pomsets with Interfaces
inferred← citeshttps://doi.org/10.1007/978-3-031-94571-7_4openalex-snapshot
$$\text {eST}^2$$ Miner - Process Discovery Based on Firing Partial Orders
inferred← citeshttps://doi.org/10.1007/978-3-031-97439-7_11openalex-snapshot
Featured Message Sequence Graphs
inferred← citeshttps://doi.org/10.1007/978-3-032-11176-0_22openalex-snapshot
Pomsets for Process Management: A Healthcare Case Study
inferred← citeshttps://doi.org/10.1007/978-3-032-17618-9_35openalex-snapshot
Automated Conformance Checking Between Process Models and Their Generalized Reference Process Models
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_10openalex-snapshot
Conformance Checking for Partially Ordered Event Logs Using Token-Based Replay
inferred← citeshttps://doi.org/10.1007/978-3-032-27879-1_12openalex-snapshot
Towards General Trace Theory
inferred← citeshttps://doi.org/10.1007/978-3-319-04447-7_10openalex-snapshot
Attack Pattern Recognition Through Correlating Cyber Situational Awareness in Computer Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_2openalex-snapshot
Endowing Concurrent Kleene Algebra with Communication Actions
inferred← citeshttps://doi.org/10.1007/978-3-319-06251-8_3openalex-snapshot
Concurrent Kleene Algebra with Tests
inferred← citeshttps://doi.org/10.1007/978-3-319-07734-5_13openalex-snapshot
On Weighted Petri Net Transducers
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-19195-9_2openalex-snapshot
On Partial Order Semantics for SAT/SMT-Based Symbolic Encodings of Weak Memory Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-319-19488-2_3openalex-snapshot
Modeling Quantitative Aspects of Concurrent Systems Using Weighted Petri Net Transducers
inferred← citeshttps://doi.org/10.1007/978-3-319-46750-4_8openalex-snapshot
Schedulers and Finishers: On Generating the Behaviours of an Event Structure
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_9openalex-snapshot
Independence Abstractions and Models of Concurrency
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-95246-8_3openalex-snapshot
Interfaces for Stream Processing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-27793-4_23openalex-snapshot
Eliminating Internal Behaviour in Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-28644-8_7openalex-snapshot
The Pros and Cons of Netcharts
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_26openalex-snapshot
Open Maps and Trace Semantics for Timed Partial Order Models
inferred← citeshttps://doi.org/10.1007/978-3-540-40965-6_12openalex-snapshot
Hierarchical Structure of 1-Safe Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_3openalex-snapshot
Compression of Partially Ordered Strings
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_14openalex-snapshot
A Framework for NLC and ESM: Local Action Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-46464-8_31openalex-snapshot
A Model Making Automation Process (MMAP) Using a Graph Grammar Formalism
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_18openalex-snapshot
Algebras of Processes of Timed Petri Nets
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_29openalex-snapshot
Bisimulation for Models in Concurrency
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_33openalex-snapshot
A Kleene Iteration for Parallelism
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_23openalex-snapshot
A Heterogeneous Approach to UML Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_44openalex-snapshot
Approximating Behaviors in Embedded System Design
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-73196-2_11openalex-snapshot
Event Correlation with Boxed Pomsets
inferred← citeshttps://doi.org/10.1007/978-3-540-74107-7_2openalex-snapshot
Abstract State Machines for the Classroom
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_11openalex-snapshot
A Nice Labelling for Tree-Like Event Structures of Degree 3
inferred← citeshttps://doi.org/10.1007/978-3-540-74407-8_12openalex-snapshot
Causal Message Sequence Charts
showing the first 200 of 595 · page through all 595
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.