On the public citation graph

Real-time behaviour of asynchronous agents

0 signed · 220 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.
Claim with ORCID
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.
See reference health

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/3-540-16761-7_81openalex-snapshot
A timed model for communicating sequential processes
inferredcites →https://doi.org/10.1007/3-540-50302-1_12openalex-snapshot
Paradigms for real-time systems
inferredcites →https://doi.org/10.1007/bfb0012760openalex-snapshot
Real time agents
inferredcites →https://doi.org/10.1016/0304-3975(83)90114-7openalex-snapshot
Calculi for synchrony and asynchrony

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.1997.2623openalex-snapshot
Time-Abstracted Bisimulation: Implicit Specifications and Decidability
inferred← citeshttps://doi.org/10.1006/inco.1998.2726openalex-snapshot
On Performance Congruences for Process Algebras
inferred← citeshttps://doi.org/10.1006/inco.1998.2755openalex-snapshot
Basic Observables for Processes
inferred← citeshttps://doi.org/10.1006/inco.1999.2821openalex-snapshot
Absolute versus Relative Time in Process Algebras
inferred← citeshttps://doi.org/10.1007/11539452_10openalex-snapshot
Modal Logics for Timed Control
inferred← citeshttps://doi.org/10.1007/11539452_13openalex-snapshot
The Coarsest Congruence for Timed Automata with Deadlines Contained in Bisimulation
inferred← citeshttps://doi.org/10.1007/11888116_29openalex-snapshot
Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets
inferred← citeshttps://doi.org/10.1007/11901433_20openalex-snapshot
Mapping RT-LOTOS Specifications into Time Petri Nets
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-44804-7_6openalex-snapshot
MoDeST — A Modelling and Description Language for Stochastic Timed Systems
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-45499-3_23openalex-snapshot
Approximate Bisimilarity
inferred← citeshttps://doi.org/10.1007/3-540-45740-2_3openalex-snapshot
Towards a Notion of Distributed Time for Petri Nets
inferred← citeshttps://doi.org/10.1007/3-540-45828-x_9openalex-snapshot
Timed Interfaces
inferred← citeshttps://doi.org/10.1007/3-540-46002-0_3openalex-snapshot
Improving the Verification of Timed Systems Using Influence Information
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-54233-7_136openalex-snapshot
CCS + time = an interleaving model for real time systems
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_103openalex-snapshot
Time-constrained automata
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_27openalex-snapshot
Translating timed process algebra into prioritized process algebra
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_30openalex-snapshot
Stepwise development of model-oriented real-time specifications from action/event models
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-55585-4_16openalex-snapshot
Simulation of Mosca specifications in Ada
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_24openalex-snapshot
Decidability of bisimulation equivalences for parallel timer processes
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-56922-7_21openalex-snapshot
Timed modal specification — Theory and tools
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-58027-1_8openalex-snapshot
Time abstracted bisimulation: Implicit specifications and decidability
inferred← citeshttps://doi.org/10.1007/3-540-58027-1_9openalex-snapshot
Timewise refinement for communicating processes
inferred← citeshttps://doi.org/10.1007/3-540-58179-0_48openalex-snapshot
Verification of context-free timed systems using linear hybrid observers
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_165openalex-snapshot
Verification of an audio control protocol
inferred← citeshttps://doi.org/10.1007/3-540-58468-4_168openalex-snapshot
Designing and implementing correct real-time systems
inferred← citeshttps://doi.org/10.1007/3-540-58715-2_129openalex-snapshot
Decidability of timed language-inclusion for networks of real-time communicating sequential processes
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-60084-1_103openalex-snapshot
Automatic synthesis of real time systems
inferred← citeshttps://doi.org/10.1007/3-540-60218-6_39openalex-snapshot
CTR: A calculus of timed refinement
inferred← citeshttps://doi.org/10.1007/3-540-60246-1_157openalex-snapshot
Synthesizing distinguishing formulae for real time systems -extended abstract
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-61052-9_54openalex-snapshot
Broadcasting in time
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-62503-8_14openalex-snapshot
Mobile processes with local clocks
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_204openalex-snapshot
Basic observables for processes
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-34867-4_21openalex-snapshot
Automatic Verification of Real-Timed Systems Using Epsilon
inferred← citeshttps://doi.org/10.1007/978-1-4471-1007-1_13openalex-snapshot
Specification of Stochastic Properties in Real-Time Systems
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-3229-5_8openalex-snapshot
Loose Real-Time Communicating Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-02508-3_8openalex-snapshot
Input/Output Stochastic Automata with Urgency: Confluence and Weak Determinism
inferred← citeshttps://doi.org/10.1007/978-3-030-61470-6_5openalex-snapshot
Parametric Timed Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-031-15629-8_13openalex-snapshot
Equivalence Checking 40 Years After: A Review of Bisimulation Tools
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_21openalex-snapshot
Convex Lattice Equation Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-90900-9_10openalex-snapshot
Stochastic Timed Graph Transformation 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-44878-7_4openalex-snapshot
Input/Output Stochastic Automata
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-39866-0_27openalex-snapshot
Confidentiality for Multithreaded Programs via Bisimulation
inferred← citeshttps://doi.org/10.1007/978-3-540-39893-6_30openalex-snapshot
Verification of Timeliness QoS Properties in Multimedia Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_9openalex-snapshot
The Element of Surprise in Timed Games
inferred← citeshttps://doi.org/10.1007/978-3-540-48654-1_16openalex-snapshot
The Observational Power of Clocks
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_22openalex-snapshot
The Power of Reachability Testing for Timed Automata
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-74407-8_2openalex-snapshot
The Saga of the Axiomatization of Parallel Composition
inferred← citeshttps://doi.org/10.1007/978-3-642-02053-7_6openalex-snapshot
Mobility Models and Behavioural Equivalence for Wireless Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-04912-5_11openalex-snapshot
Teaching Concurrency: Theory in Practice
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-24310-3_5openalex-snapshot
Performance Model Checking Scenario-Aware Dataflow
inferred← citeshttps://doi.org/10.1007/978-3-642-32054-5_114openalex-snapshot
A Model for Real-Time Systems Using Multi-Cost Timed Process Algebra
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-41157-1_12openalex-snapshot
Security Analysis in Probabilistic Distributed Protocols via Bounded Reachability
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-642-88049-0_10openalex-snapshot
Formal Specification and Timing Analysis of High-Integrity Real-Time Systems
inferred← citeshttps://doi.org/10.1007/bf01178579openalex-snapshot
From ATP to timed graphs and hybrid systems
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/bfb0014325openalex-snapshot
Symbolic bisimulation for timed processes
inferred← citeshttps://doi.org/10.1007/bfb0014337openalex-snapshot
Coalgebraic specifications and models of deterministic hybrid systems
inferred← citeshttps://doi.org/10.1007/bfb0023864openalex-snapshot
Feasibility of finite and infinite paths in data dependent programs
inferred← citeshttps://doi.org/10.1007/bfb0023865openalex-snapshot
An interleaving model for real-time systems
inferred← citeshttps://doi.org/10.1007/bfb0024438openalex-snapshot
Tackling the RPC-memory specification problem with I/O automata
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/bfb0054177openalex-snapshot
Model checking via reachability testing for timed automata
inferred← citeshttps://doi.org/10.1007/bfb0055787openalex-snapshot
Timed bisimulation and open maps
inferred← citeshttps://doi.org/10.1007/bfb0084808openalex-snapshot
Action transducers and timed automata
inferred← citeshttps://doi.org/10.1007/pl00013313openalex-snapshot
‘Closed Interval Process Algebra’ versus ‘Interval Process Algebra’
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-010-0114-7openalex-snapshot
Lifting non-finite axiomatizability results to extensions of process algebras
inferred← citeshttps://doi.org/10.1007/s10009-013-0286-xopenalex-snapshot
Real-time specifications
inferred← citeshttps://doi.org/10.1007/s10009-019-00537-zopenalex-snapshot
Verification and abstraction of real-time variability-intensive systems
inferred← citeshttps://doi.org/10.1007/s100090050006openalex-snapshot
Continuous modeling of real-time and hybrid systems: from concepts to tools
inferred← citeshttps://doi.org/10.1007/s10626-011-0102-2openalex-snapshot
On the composition of time Petri nets
inferred← citeshttps://doi.org/10.1007/s10703-013-0201-9openalex-snapshot
A modal characterization of alternating approximate bisimilarity
inferred← citeshttps://doi.org/10.1016/0164-1212(94)90024-8openalex-snapshot
Validating timing requirements for time basic net specifications
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-044482830-9/50028-xopenalex-snapshot
Process Algebra with Timing: Real Time and Discrete Time
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.030openalex-snapshot
Modularity of Behaviours for Mathematical Operational Semantics
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.02.042openalex-snapshot
On Equivalences for a Class of Timed Regular Expressions
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.2007.03.002openalex-snapshot
Coordination by Timers for Channel-Based Anonymous Communications
inferred← citeshttps://doi.org/10.1016/j.entcs.2011.09.034openalex-snapshot
A Combined Process Algebraic and Stochastic Approach to Bone Remodeling
inferred← citeshttps://doi.org/10.1016/j.entcs.2012.05.013openalex-snapshot
Towards Abstraction-Based Verification of Shape Calculus
inferred← citeshttps://doi.org/10.1016/j.ic.2005.11.003openalex-snapshot
Coalgebraic semantics for timed processes
inferred← citeshttps://doi.org/10.1016/j.ic.2008.06.001openalex-snapshot
Characterize branching distance in terms of (η,α)-bisimilarity
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.tcs.2004.04.003openalex-snapshot
Updatable timed automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.04.019openalex-snapshot
Process algebra for hybrid systems
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.2010.09.003openalex-snapshot
Weak bisimulation for Probabilistic Timed Automata
inferred← citeshttps://doi.org/10.1016/j.tcs.2011.07.016openalex-snapshot
A timed calculus for wireless systems
inferred← citeshttps://doi.org/10.1016/s0164-1212(98)10014-6openalex-snapshot
Real-time event control in active databases
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00016-0openalex-snapshot
Timewise refinement for communicating processes
inferred← citeshttps://doi.org/10.1016/s0167-6423(99)00019-2openalex-snapshot
Automated compositional Markov chain generation for a plain-old telephone system
inferred← citeshttps://doi.org/10.1016/s0169-7552(97)00134-7openalex-snapshot
Partial order models for quantitative extensions of LOTOS
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00305-4openalex-snapshot
Process algebra for performance evaluation
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00375-3openalex-snapshot
On the semantics of durational actions
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00124-4openalex-snapshot
Bisimulation indexes and their applications
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00334-1openalex-snapshot
The power of reachability testing for timed automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00292-7openalex-snapshot
A general conservative extension theorem in process algebras with inequalities
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00134-6openalex-snapshot
Testing timed automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(99)00213-3openalex-snapshot
Object-oriented hybrid systems of coalgebras plus monoid actions
inferred← citeshttps://doi.org/10.1016/s0928-4869(98)00013-5openalex-snapshot
Exact, analytic, and locally approximate solutions to discrete event-simulation problems
inferred← citeshttps://doi.org/10.1016/s1474-6670(17)50144-5openalex-snapshot
VDM + CCS + Time = MOSCA
inferred← citeshttps://doi.org/10.1016/s1567-8326(01)00004-2openalex-snapshot
Real time process algebra with time-dependent conditions
inferred← citeshttps://doi.org/10.1016/s1567-8326(02)00029-2openalex-snapshot
Revisiting timing in process algebra
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00226-9openalex-snapshot
Extending Timed Automata for Compositional Modeling Healthy Timed Systems
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80468-2openalex-snapshot
Absolute versus Relative Time in Process Algebras
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80469-4openalex-snapshot
Eager, Busy-Waiting and Lazy Actions Timed Computation
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)82503-4openalex-snapshot
The Expressive Power of Urgent, Lazy and Busy-Waiting Actions in Timed Processes
inferred← citeshttps://doi.org/10.1017/s0960129503004006openalex-snapshot
Embedding untimed into timed process algebra: the case for explicit termination
inferred← citeshttps://doi.org/10.1017/s0960129503004018openalex-snapshot
The expressive power of urgent, lazy and busy-waiting actions in timed processes
inferred← citeshttps://doi.org/10.1023/a:1008649927166openalex-snapshot
A Consistent Causality-Based View on a Timed Process Algebra Including Urgent Interactions
inferred← citeshttps://doi.org/10.1023/a:1008734703554openalex-snapshot
Analysis of Timed Systems Using Time-Abstracting Bisimulations
inferred← citeshttps://doi.org/10.1049/ic:19980529openalex-snapshot
Modelling and analysis of broadcasting embedded control systems
inferred← citeshttps://doi.org/10.1051/ita:2000131openalex-snapshot
Characteristic Formulae for Timed Automata
inferred← citeshttps://doi.org/10.1093/comjnl/38.6.443openalex-snapshot
Scheduling-Oriented Models for Real-Time Systems
inferred← citeshttps://doi.org/10.1109/32.265634openalex-snapshot
Proving properties of real-time systems through logical specifications and Petri net models
inferred← citeshttps://doi.org/10.1109/32.629494openalex-snapshot
Specification of realtime systems using ASTRAL
inferred← citeshttps://doi.org/10.1109/90.298433openalex-snapshot
A LOTOS extension for the performance analysis of distributed systems
inferred← citeshttps://doi.org/10.1109/cmpsac.1997.624976openalex-snapshot
Compiling process algebraic specifications into timed automata
inferred← citeshttps://doi.org/10.1109/emwrt.1992.637479openalex-snapshot
Let's PARTY: Process Algebra With Real-time From York
inferred← citeshttps://doi.org/10.1109/icacte.2010.5579193openalex-snapshot
Compatibility verification of real-time components' behavior
inferred← citeshttps://doi.org/10.1109/icacte.2010.5579499openalex-snapshot
Incorporating time factor into behavior protocol model
inferred← citeshttps://doi.org/10.1109/iccta35431.2014.9521621openalex-snapshot
Process Algebras, Reasoning, And Validation
inferred← citeshttps://doi.org/10.1109/iceccs.1996.558488openalex-snapshot
Modeling and analysis of complex computer systems-the MTCCS approach
inferred← citeshttps://doi.org/10.1109/icsess.2010.5552402openalex-snapshot
Formal specification and verification of components' real-time behavior
inferred← citeshttps://doi.org/10.1109/jproc.2004.831197openalex-snapshot
Formal verification of timed systems: a survey and perspective
inferred← citeshttps://doi.org/10.1109/pnpm.1999.796566openalex-snapshot
Non equivalence between time Petri nets and time stream Petri nets
inferred← citeshttps://doi.org/10.1109/real.1990.128759openalex-snapshot
A calculus for communicating systems with time and probabilities
inferred← citeshttps://doi.org/10.1109/real.1996.563703openalex-snapshot
Predictability of real-time systems: a process-algebraic approach
inferred← citeshttps://doi.org/10.1109/simsym.1995.393567openalex-snapshot
Hazard analysis of structured sequential systems
inferred← citeshttps://doi.org/10.1109/tse.2006.104openalex-snapshot
MODEST: A Compositional Modeling Formalism for Hard and Softly Timed Systems
inferred← citeshttps://doi.org/10.1109/tse.2010.4openalex-snapshot
Time and Probability-Based Information Flow Analysis
inferred← citeshttps://doi.org/10.1109/tse.2010.88openalex-snapshot
Guest Editors' Introduction: 2008 Conference on the Foundations of Software Engineering
inferred← citeshttps://doi.org/10.1109/wetice.2019.00060openalex-snapshot
Formal Verification of Radio Communication Management in Railway Systems Using Model Checking Technique
inferred← citeshttps://doi.org/10.1109/wodes.2002.1167678openalex-snapshot
Equivalence of timed state machines and safe TPN
inferred← citeshttps://doi.org/10.1142/9789812798039_0006openalex-snapshot
PARALLEL EXECUTION OF REAL-TIME PETRI NETS
inferred← citeshttps://doi.org/10.1145/151299.151302openalex-snapshot
Functional specification of time-sensitive communicating systems
inferred← citeshttps://doi.org/10.1145/2428592.2428596openalex-snapshot
Modeling local broadcast behavior of wireless sensor networks with timed automata for model checking of WCTT
inferred← citeshttps://doi.org/10.1201/9781420011746.ch31openalex-snapshot
Process-Algebraic Analysis of Timing and Schedulability Properties
inferred← citeshttps://doi.org/10.14236/ewic/rw1996.5openalex-snapshot
On Using Syntactic Action Refinement to Derive Compositionally a Timed Efficient Implementation
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.45.660.671openalex-snapshot
A Process Algebraic Description of a Temporal Wireless Network Protocol
inferred← citeshttps://doi.org/10.14279/tuj.eceasst.46.701.708openalex-snapshot
Specification and refinement of discrete timing properties in Event-B
inferred← citeshttps://doi.org/10.1504/ijmtm.2003.003411openalex-snapshot
Qualitative and quantitative specification of interorganisational workflows
inferred← citeshttps://doi.org/10.21236/ada256199openalex-snapshot
Trace Algebra for Automatic Verification of Real-Time Concurrent Systems
inferred← citeshttps://doi.org/10.2168/lmcs-11(1:18)2015openalex-snapshot
Modelling MAC-Layer Communications in Wireless Systems
inferred← citeshttps://doi.org/10.23940/ijpe.17.06.p10.886896openalex-snapshot
The Quantitative Analysis of Approximate Correctness for Real-Time Systems
inferred← citeshttps://doi.org/10.25673/2294openalex-snapshot
Konstruktion korrekter Codegeneratoren für Speicherprogrammierbare Steuerungen
inferred← citeshttps://doi.org/10.26190/unsworks/22938openalex-snapshot
Modelling and programming embedded controllers with timed automata and synchronous languages
inferred← citeshttps://doi.org/10.3233/fun-2002-53103openalex-snapshot
Process Algebra with Nonstandard Timing
inferred← citeshttps://doi.org/10.3990/1.9789036507998openalex-snapshot
Quantitative and Qualitative Extensions of Event Structures
inferred← citeshttps://doi.org/10.3990/1.9789090074610openalex-snapshot
Architectural notes: a framework for distributed systems development
inferred← citeshttps://doi.org/10.3990/1.9789090130866openalex-snapshot
Analysing industrial protocols with formal methods
inferred← citeshttps://doi.org/10.4018/978-1-7998-2460-2.ch011openalex-snapshot
Two-Level Data Collection for an Energy-Efficient Solution in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.4018/ijaeis.2016100104openalex-snapshot
Two-Level Data Collection for an Energy-Efficient Solution in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.46298/lmcs-20(1:11)2024openalex-snapshot
revTPL: The Reversible Temporal Process Language
inferred← citeshttps://doi.org/10.48550/arxiv.1009.2259openalex-snapshot
Theory of processes
inferred← citeshttps://doi.org/10.48550/arxiv.1011.2488openalex-snapshot
Shape Calculus: Timed Operational Semantics and Well-formedness
inferred← citeshttps://doi.org/10.48550/arxiv.1910.08992openalex-snapshot
Checking Timed Bisimulation with Bounded Zone-History Graphs -- Technical Report
inferred← citeshttps://doi.org/10.5281/zenodo.26431openalex-snapshot
The Ants (Formicidae), And Some Myrmecophiles, Of Sicily.
showing the first 200 of 215 · page through all 215
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.