On the public citation graph
A temporal calculus of communicating systems
0 signed · 326 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-10235-3openalex-snapshot
A Calculus of Communicating Systems
inferredcites →https://doi.org/10.1007/bfb0017309openalex-snapshot
Concurrency and automata on infinite sequences
inferredcites →https://doi.org/10.1145/800221.806721openalex-snapshot
Real-time programming and asynchronous message passing
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/inco.1994.1083openalex-snapshot
The Algebra of Timed Processes, ATP: Theory and Application
inferred← citeshttps://doi.org/10.1006/inco.1995.1014openalex-snapshot
An Operational Semantics for Timed CSP
inferred← citeshttps://doi.org/10.1006/inco.1995.1041openalex-snapshot
A Process Algebra for Timed Systems
inferred← citeshttps://doi.org/10.1006/inco.1995.1151openalex-snapshot
An Effective Axiomatization for Real Time ACP
inferred← citeshttps://doi.org/10.1006/inco.1996.0060openalex-snapshot
Forward and Backward Simulations
inferred← citeshttps://doi.org/10.1006/inco.1997.2623openalex-snapshot
Time-Abstracted Bisimulation: Implicit Specifications and Decidability
inferred← citeshttps://doi.org/10.1006/inco.1997.2657openalex-snapshot
A Complete Axiomatization of Finite-state ACSR Processes
inferred← citeshttps://doi.org/10.1006/inco.1998.2726openalex-snapshot
On Performance Congruences for Process Algebras
inferred← citeshttps://doi.org/10.1006/inco.1998.2729openalex-snapshot
A Conservative Look at Operational Semantics with Variable Binding
inferred← citeshttps://doi.org/10.1006/inco.1999.2821openalex-snapshot
Absolute versus Relative Time in Process Algebras
inferred← citeshttps://doi.org/10.1006/inco.1999.2879openalex-snapshot
A Timed Concurrent Constraint Language
inferred← citeshttps://doi.org/10.1007/11601548_15openalex-snapshot
Timing the Untimed: Terminating Successfully While Being Conservative
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_18openalex-snapshot
A Faster-than Relation for Asynchronous Processes
inferred← citeshttps://doi.org/10.1007/3-540-44685-0_6openalex-snapshot
Performance Evaluation:= (Process Algebra + Model Checking) X Markov Chains
inferred← citeshttps://doi.org/10.1007/3-540-45465-9_45openalex-snapshot
Bialgebraic Modelling of Timed Processes
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_18openalex-snapshot
Extending the Petri Box Calculus with Time
inferred← citeshttps://doi.org/10.1007/3-540-47910-4_17openalex-snapshot
A Timed Calculus for Distributed Objects with Clocks
inferred← citeshttps://doi.org/10.1007/3-540-48068-4_24openalex-snapshot
Translating TPAL Specifications into Timed-Arc Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-48919-3_23openalex-snapshot
Static Analysis of Real-Time Component-based Systems Congurations
inferred← citeshttps://doi.org/10.1007/3-540-53982-4_23openalex-snapshot
A complete proof system for timed observations
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_73openalex-snapshot
A model for real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_101openalex-snapshot
Completeness in real time process algebra
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_104openalex-snapshot
Relating processes with respect to speed
inferred← citeshttps://doi.org/10.1007/3-540-54430-5_98openalex-snapshot
Abstract timed observation and process algebra
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_23openalex-snapshot
TAM: A formal framework for the development of distributed real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_26openalex-snapshot
Asynchronous communication in real space process algebra
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_27openalex-snapshot
Translating timed process algebra into prioritized process algebra
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_28openalex-snapshot
Operational semantics for timed observations
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_4openalex-snapshot
Modelling real-time behavior with an interval time calculus
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_9openalex-snapshot
Broadcast communication for real-time processes
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_36openalex-snapshot
An overview and synthesis on timed process algebras
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_40openalex-snapshot
A linear time process algebra
inferred← citeshttps://doi.org/10.1007/3-540-55179-4_41openalex-snapshot
Deciding properties of regular real timed processes
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_104openalex-snapshot
Behavioural abstraction in TCCS
inferred← citeshttps://doi.org/10.1007/3-540-56287-7_114openalex-snapshot
Real-time calculi and expansion theorems
inferred← citeshttps://doi.org/10.1007/3-540-56496-9_18openalex-snapshot
A case study in safety-critical design
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_47openalex-snapshot
Some issues in the semantics of facile distributed programming
inferred← citeshttps://doi.org/10.1007/3-540-56891-3_17openalex-snapshot
A Kahn principle for networks of nonmonotonic real-time processes
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_29openalex-snapshot
A model for real-time process algebras (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-57182-5_61openalex-snapshot
Deciding testing equivalence for real-time processes with dense time
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_29openalex-snapshot
ACSR: An algebra of communicating shared resources with dense time and priorities
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_30openalex-snapshot
An Elimination Theorem for regular behaviours with integration
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_33openalex-snapshot
A congruence theorem for structured operational semantics with predicates
inferred← citeshttps://doi.org/10.1007/3-540-57208-2_8openalex-snapshot
On the ill-timed but well-caused
inferred← citeshttps://doi.org/10.1007/3-540-57880-3_4openalex-snapshot
An asynchronous process algebra with multiple clocks
inferred← citeshttps://doi.org/10.1007/3-540-58021-2_20openalex-snapshot
The PEPA workbench: A tool to support a process algebra-based approach to performance modelling
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_10openalex-snapshot
Axiomatising real-timed processes
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_11openalex-snapshot
A predicative semantics for the refinement of real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_8openalex-snapshot
Time abstracted bisimulation: Implicit specifications and decidability
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_190openalex-snapshot
Algebraic reasoning for real-time probabilistic processes with uncertain information
inferred← citeshttps://doi.org/10.1007/3-540-59293-8_224openalex-snapshot
Describing a Signal Analyzer in the process algebra PMC — A case study
inferred← citeshttps://doi.org/10.1007/3-540-60249-6_38openalex-snapshot
Discrete time process algebra with abstraction
inferred← citeshttps://doi.org/10.1007/3-540-60630-0_9openalex-snapshot
Analytic and locally approximate solutions to properties of probabilistic processes
inferred← citeshttps://doi.org/10.1007/3-540-60915-6_5openalex-snapshot
Modal and temporal logics for processes
inferred← citeshttps://doi.org/10.1007/3-540-61055-3_36openalex-snapshot
Durations for truly-concurrent transitions
inferred← citeshttps://doi.org/10.1007/3-540-61474-5_89openalex-snapshot
XVERSA: An integrated graphical and textual toolset for the specification and analysis of resource-bound real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-61648-9_37openalex-snapshot
A calculus for timed automata
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_10openalex-snapshot
Regular processes and timed automata
inferred← citeshttps://doi.org/10.1007/3-540-63141-0_12openalex-snapshot
An algebraic theory of multiple clocks
inferred← citeshttps://doi.org/10.1007/3-540-65193-4_18openalex-snapshot
Verification of clocked and hybrid systems
inferred← citeshttps://doi.org/10.1007/3540539816_71openalex-snapshot
Using higher order logic for modelling real-time protocols
inferred← citeshttps://doi.org/10.1007/978-0-387-09680-3_21openalex-snapshot
Lifting Non-Finite Axiomatizability Results to Extensions of Process Algebras
inferred← citeshttps://doi.org/10.1007/978-0-387-34892-6_13openalex-snapshot
Validation, verification and implementation of timed protocols using AORTA
inferred← citeshttps://doi.org/10.1007/978-0-387-35079-0_17openalex-snapshot
Time-Action Alternating Model for Timed LOTOS and its Symbolic Verification of Bisimulation Equivalence
inferred← citeshttps://doi.org/10.1007/978-0-387-35271-8_20openalex-snapshot
Dynamic priorities for modeling real-time
inferred← citeshttps://doi.org/10.1007/978-1-4471-2120-6_7openalex-snapshot
Real Time Process Algebra with Infinitesimals
inferred← citeshttps://doi.org/10.1007/978-1-4471-3182-3_3openalex-snapshot
Process Algebra as a Tool for Real Time Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_1openalex-snapshot
Real-Time Calculi and Expansion Theorems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_14openalex-snapshot
The Total Order Assumption
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_2openalex-snapshot
Modal Logics in Timed Process Algebras
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_3openalex-snapshot
Process Communication Environment
inferred← citeshttps://doi.org/10.1007/978-1-4471-3227-1_6openalex-snapshot
Rigorous specification of real-time systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3229-5_8openalex-snapshot
Loose Real-Time Communicating Agents
inferred← citeshttps://doi.org/10.1007/978-1-4471-3431-2_6openalex-snapshot
Real-Time and Safety-Critical Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3860-0_17openalex-snapshot
Timed Concurrent Processes
inferred← citeshttps://doi.org/10.1007/978-1-84800-223-4_2openalex-snapshot
Deterministically Timed Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-030-38800-3_9openalex-snapshot
Origins and Development of Formal Methods
inferred← citeshttps://doi.org/10.1007/978-3-030-61470-6_5openalex-snapshot
Parametric Timed Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-030-64881-7_4openalex-snapshot
Learning Abstracted Non-deterministic Finite State Machines
inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2openalex-snapshot
Tools and Algorithms for the Construction and Analysis of Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-42626-1_2openalex-snapshot
Causal Reversibility for Timed Process Calculi with Lazy/Eager Durationless Actions and Time Additivity
inferred← citeshttps://doi.org/10.1007/978-3-031-95497-9_5openalex-snapshot
Noninterference Analysis of Stochastically Timed Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-95589-1_7openalex-snapshot
Decidability Problems for Micro-Stipula
inferred← citeshttps://doi.org/10.1007/978-3-032-05792-1_16openalex-snapshot
Noninterference Analysis of Deterministically Timed Reversible Systems
inferred← citeshttps://doi.org/10.1007/978-3-032-35298-9_19openalex-snapshot
Witnesses and Counterexamples for Timed Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-319-72044-9_7openalex-snapshot
A Calculus of Virtually Timed Ambients
inferred← citeshttps://doi.org/10.1007/978-3-540-24727-2_24openalex-snapshot
Bisimulation on Speed: Lower Time Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-30080-9_3openalex-snapshot
Timed Process Algebra (With a Focus on Explicit Termination and Relative-Timing)
inferred← citeshttps://doi.org/10.1007/978-3-540-30080-9_4openalex-snapshot
Expressiveness of Timed Events and Timed Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30233-9_11openalex-snapshot
A Bounded True Concurrency Process Algebra for Performance Evaluation
inferred← citeshttps://doi.org/10.1007/978-3-540-31982-5_5openalex-snapshot
Bisimulation on Speed: A Unified Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_32openalex-snapshot
A congruence theorem for structured operational semantics with predicates and negative premises
inferred← citeshttps://doi.org/10.1007/978-3-540-49020-3_4openalex-snapshot
Yet Another Real-Time Specification for the Steam Boiler: Local Clocks to Statically Measure Systems Performance
inferred← citeshttps://doi.org/10.1007/978-3-540-68855-6_15openalex-snapshot
Timed Mobile Ambients for Network Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-68894-5_8openalex-snapshot
Process Algebras in Systems Biology
inferred← citeshttps://doi.org/10.1007/978-3-540-72522-0_4openalex-snapshot
Stochastic Process Algebras
inferred← citeshttps://doi.org/10.1007/978-3-540-73859-6_6openalex-snapshot
Impossibility Results for the Equational Theory of Timed CCS
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_19openalex-snapshot
C WS: A Timed Service-Oriented Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-75292-9_4openalex-snapshot
Mobile Ambients with Timers and Types
inferred← citeshttps://doi.org/10.1007/978-3-540-78743-3_16openalex-snapshot
Modelling and Verification of Timed Interaction and Migration
inferred← citeshttps://doi.org/10.1007/978-3-642-04164-8_7openalex-snapshot
Structural Operational Semantics for Weighted Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-04368-0_15openalex-snapshot
A Compositional Translation of Timed Automata with Deadlines to Uppaal Timed Automata
inferred← citeshttps://doi.org/10.1007/978-3-642-11623-0_13openalex-snapshot
A Timed Calculus for Wireless Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-38493-6_2openalex-snapshot
Modelling MAC-Layer Communications in Wireless Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-40229-6_13openalex-snapshot
On Fixed Points of Strictly Causal Functions
inferred← citeshttps://doi.org/10.1007/978-3-642-40561-7_3openalex-snapshot
Real-Time Migration Properties of rTiMo Verified in Uppaal
inferred← citeshttps://doi.org/10.1007/978-3-642-40725-3_9openalex-snapshot
Encoding Timed Models as Uniform Labeled Transition Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-76309-0_10openalex-snapshot
Formal Description, Time and Performance Analysis a Framework
inferred← citeshttps://doi.org/10.1007/978-3-642-79917-4_2openalex-snapshot
Stochastic Process Algebra for Discrete Event Simulation
inferred← citeshttps://doi.org/10.1007/978-3-642-85165-0_20openalex-snapshot
The Tick-Tock Case Study for the Assessment of Timed FDTs
inferred← citeshttps://doi.org/10.1007/978-3-662-02880-3_11openalex-snapshot
Timed Process Algebras: A Tutorial
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9openalex-snapshot
Introduction to Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-662-04293-9_9openalex-snapshot
Structural Operational Semantics
inferred← citeshttps://doi.org/10.1007/978-3-662-46823-4_14openalex-snapshot
A Proof-Based Method for Modelling Timed Systems
inferred← citeshttps://doi.org/10.1007/978-3-662-49498-1_5openalex-snapshot
A Timed Process Algebra for Wireless Networks with an Application in Routing
inferred← citeshttps://doi.org/10.1007/bf01178579openalex-snapshot
From ATP to timed graphs and hybrid systems
inferred← citeshttps://doi.org/10.1007/bf01200261openalex-snapshot
Verification of an active control system using temporal process algebra
inferred← citeshttps://doi.org/10.1007/bf01211248openalex-snapshot
Recursion induction for real-time processes
inferred← citeshttps://doi.org/10.1007/bf01211867openalex-snapshot
Processes with probabilities, priority and time
inferred← citeshttps://doi.org/10.1007/bf01211907openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1007/bf02811338openalex-snapshot
An introduction to compositional methods for concurrency and their application to real-time
inferred← citeshttps://doi.org/10.1007/bfb0000494openalex-snapshot
Extending process languages with time
inferred← citeshttps://doi.org/10.1007/bfb0020933openalex-snapshot
Verifying clocked transition systems
inferred← citeshttps://doi.org/10.1007/bfb0024310openalex-snapshot
Integrating behavioural and simulation modelling
inferred← citeshttps://doi.org/10.1007/bfb0024649openalex-snapshot
Applications of modal logic for the specification of real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0030441openalex-snapshot
Design and verification of real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0031989openalex-snapshot
The state operator in real time process algebra
inferred← citeshttps://doi.org/10.1007/bfb0031990openalex-snapshot
Timed process algebras with urgent interactions and a unique powerful binary operator
inferred← citeshttps://doi.org/10.1007/bfb0031999openalex-snapshot
Abstraction in real time process algebra
inferred← citeshttps://doi.org/10.1007/bfb0032002openalex-snapshot
Forward and backward simulations for timing-based systems
inferred← citeshttps://doi.org/10.1007/bfb0032006openalex-snapshot
An overview and synthesis on timed process algebras
inferred← citeshttps://doi.org/10.1007/bfb0032007openalex-snapshot
From ATP to timed graphs and hybrid systems
inferred← citeshttps://doi.org/10.1007/bfb0032009openalex-snapshot
Predicative specification of timed processes
inferred← citeshttps://doi.org/10.1007/bfb0055626openalex-snapshot
Priority and maximal progress are completely axiomatisable (extended abstract)
inferred← citeshttps://doi.org/10.1007/bfb0084803openalex-snapshot
Using CSP to verify a timed protocol over a fair medium
inferred← citeshttps://doi.org/10.1007/bfb0084804openalex-snapshot
Timed Ethernet: Real-time formal specification of Ethernet
inferred← citeshttps://doi.org/10.1007/bfb0084808openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1007/pl00013291openalex-snapshot
Symbolic Approaches to Probability Distributions in Process Algebra
inferred← citeshttps://doi.org/10.1007/pl00013313openalex-snapshot
‘Closed Interval Process Algebra’ versus ‘Interval Process Algebra’
inferred← citeshttps://doi.org/10.1007/s00165-011-0185-4openalex-snapshot
Model-checking timed automata with deadlines with Uppaal
inferred← citeshttps://doi.org/10.1007/s00165-014-0294-yopenalex-snapshot
Analysing neurobiological models using communicating automata
inferred← citeshttps://doi.org/10.1007/s001650050015openalex-snapshot
A Formal Definition of Time in LOTOS
inferred← citeshttps://doi.org/10.1007/s00236-002-0094-3openalex-snapshot
Comparing the worst-case efficiency of asynchronous systems with PAFAS
inferred← citeshttps://doi.org/10.1007/s00236-003-0117-8openalex-snapshot
Towards action refinement for true concurrent real time
inferred← citeshttps://doi.org/10.1007/s00236-010-0114-7openalex-snapshot
Lifting non-finite axiomatizability results to extensions of process algebras
inferred← citeshttps://doi.org/10.1007/s00236-020-00394-3openalex-snapshot
Sound reasoning in tock-CSP
inferred← citeshttps://doi.org/10.1007/s002360050047openalex-snapshot
Timing and causality in process algebra
inferred← citeshttps://doi.org/10.1007/s002360050177openalex-snapshot
Verification of clocked and hybrid systems
inferred← citeshttps://doi.org/10.1007/s10009-003-0134-5openalex-snapshot
Unit verification: the CARA experience
inferred← citeshttps://doi.org/10.1007/s10009-026-00841-5openalex-snapshot
Clause-reachability is undecidable in legal contracts
inferred← citeshttps://doi.org/10.1016/0164-1212(92)90045-lopenalex-snapshot
Formal methods for the specification and design of real-time safety critical systems
inferred← citeshttps://doi.org/10.1016/0164-1212(94)00059-vopenalex-snapshot
A model for timed-probabilistic behaviors
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00030-iopenalex-snapshot
Proving properties of real-time semaphores
inferred← citeshttps://doi.org/10.1016/0169-7552(93)90049-aopenalex-snapshot
A LOTOS based performance evaluation tool
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00169-jopenalex-snapshot
A brief history of Timed CSP
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00285-9openalex-snapshot
A complete axiomatization of timed bisimulation for a class of timed regular behaviours
inferred← citeshttps://doi.org/10.1016/0920-5489(94)90002-7openalex-snapshot
Converging towards a timed LOTOS standard
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50009-5openalex-snapshot
Concurrency Theory: A Historical Perspective on Coinduction and Process Calculi
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50025-4openalex-snapshot
An upward compatible timed extension to LOTOS
inferred← citeshttps://doi.org/10.1016/b978-0-444-89402-1.50027-8openalex-snapshot
LOTOS-like process algebras with urgent or timed interactions
inferred← citeshttps://doi.org/10.1016/b978-0-7506-1102-2.50011-6openalex-snapshot
Formal methods: use and relevance for the development of safety-critical systems
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50028-xopenalex-snapshot
Process Algebra with Timing: Real Time and Discrete Time
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.03.020openalex-snapshot
Integrating Time and Resource into Circus
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.12.093openalex-snapshot
Timed CSP: A Retrospective
inferred← citeshttps://doi.org/10.1016/j.entcs.2014.12.007openalex-snapshot
Formalization and Verification of REST on HTTP Using CSP
inferred← citeshttps://doi.org/10.1016/j.ic.2002.08.001openalex-snapshot
Bisimulation on speed: worst-case efficiency
inferred← citeshttps://doi.org/10.1016/j.ic.2013.04.001openalex-snapshot
Structural operational semantics for stochastic and weighted transition systems
inferred← citeshttps://doi.org/10.1016/j.jal.2011.11.002openalex-snapshot
A calculus for orchestration of web services
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.10.001openalex-snapshot
Virtually timed ambients: A calculus of nested virtualization
inferred← citeshttps://doi.org/10.1016/j.jlap.2004.03.002openalex-snapshot
Process languages with discrete relative time based on the Ordered SOS format and rooted eager bisimulation
inferred← citeshttps://doi.org/10.1016/j.jlap.2006.08.003openalex-snapshot
Duplication of constants in process algebra
inferred← citeshttps://doi.org/10.1016/j.jlap.2007.06.003openalex-snapshot
A process algebraic view of shared dataspace coordination
inferred← citeshttps://doi.org/10.1016/j.scico.2005.10.011openalex-snapshot
On the expressiveness of timed coordination models
inferred← citeshttps://doi.org/10.1016/j.simpat.2006.08.001openalex-snapshot
Behavioural equivalence in simulation modelling
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.07.036openalex-snapshot
A brief history of process algebra
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.02.009openalex-snapshot
A translation of TPALp into a class of timed-probabilistic Petri nets
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.004openalex-snapshot
Bisimulation on speed: A unified approach
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.12.019openalex-snapshot
SOS formats and meta-theory: 20 years after
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.016openalex-snapshot
A timed calculus for wireless systems
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.01.036openalex-snapshot
The fixed-point theory of strictly causal functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.02.022openalex-snapshot
Timed process calculi with deterministic or stochastic delays: Commuting between durational and durationless actions
inferred← citeshttps://doi.org/10.1016/s0020-0190(01)00215-0openalex-snapshot
The cones and foci proof technique for timed transition systems
inferred← citeshttps://doi.org/10.1016/s0166-5316(02)00105-0openalex-snapshot
Performance evaluation with temporal rewards
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00085-0openalex-snapshot
Static analysis of real-time component-based systems configurations
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00031-7openalex-snapshot
Modeling and verifying active structural control systems
showing the first 200 of 321 · page through all 321
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.