On the public citation graph
Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency
0 signed · 248 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/bfb0013030openalex-snapshot
Partial orderings descriptions and observations of nondeterministic concurrent processes
inferredcites →https://doi.org/10.1007/bfb0013033openalex-snapshot
A logic for distributed transition systems
inferredcites →https://doi.org/10.1007/bfb0013034openalex-snapshot
Fully abstract models for a process language with refinement
inferredcites →https://doi.org/10.1007/bfb0013037openalex-snapshot
Towards a temporal logic for causality and choice in distributed systems
inferredcites →https://doi.org/10.1007/bfb0013038openalex-snapshot
Correctness and full abstraction of metric semantics for concurrency
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/int.4550060302openalex-snapshot
Temporal reasoning: A relativistic model
inferred← citeshttps://doi.org/10.1002/int.4550080404openalex-snapshot
A learning algorithm for the classification of dynamic events using a neuron-like dynamic tree
inferred← citeshttps://doi.org/10.1006/inco.1996.0026openalex-snapshot
Comparing Syntactic and Semantic Action Refinement
inferred← citeshttps://doi.org/10.1006/inco.1998.2755openalex-snapshot
Basic Observables for Processes
inferred← citeshttps://doi.org/10.1006/inco.1999.2825openalex-snapshot
Tile Formats for Located and Mobile Systems
inferred← citeshttps://doi.org/10.1006/inco.2000.2894openalex-snapshot
Pushdown Processes: Games and Model-Checking
inferred← citeshttps://doi.org/10.1006/inco.2001.2927openalex-snapshot
Objects and Classes in Algol-Like Languages
inferred← citeshttps://doi.org/10.1006/inco.2001.3050openalex-snapshot
Functorial Models for Petri Nets
inferred← citeshttps://doi.org/10.1006/inco.2001.3074openalex-snapshot
Decidability of Split Equivalence
inferred← citeshttps://doi.org/10.1006/jcss.1996.0022openalex-snapshot
Temporal Interactions of Intervals in Distributed Systems
inferred← citeshttps://doi.org/10.1007/11526988_4openalex-snapshot
Evolution and Reactivity for the Web
inferred← citeshttps://doi.org/10.1007/11575467_6openalex-snapshot
An Abstract Interpretation Perspective on Linear vs. Branching Time
inferred← citeshttps://doi.org/10.1007/11888116_19openalex-snapshot
Reducing Software Architecture Models Complexity: A Slicing and Abstraction Approach
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-40911-4_4openalex-snapshot
Formalizing Timing Diagrams as Causal Dependencies for Verification Purposes
inferred← citeshttps://doi.org/10.1007/3-540-44637-0_2openalex-snapshot
A Truly Concurrent Model for Interacting Agents
inferred← citeshttps://doi.org/10.1007/3-540-44659-1_30openalex-snapshot
Towards a Machine-Checked Java Specification Book
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_51openalex-snapshot
Decidability Results for the Propositional Fluent Calculus
inferred← citeshttps://doi.org/10.1007/3-540-45315-6_21openalex-snapshot
Model Checking CTL+ and FCTL Is Hard
inferred← citeshttps://doi.org/10.1007/3-540-45319-9_1openalex-snapshot
Branching vs. Linear Time: Final Showdown
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-48683-6_18openalex-snapshot
A Complete Finite Prefix for Process Algebra
inferred← citeshttps://doi.org/10.1007/3-540-48737-9_5openalex-snapshot
An Event-Based Structural Operational Semantics of Multi-threaded Java
inferred← citeshttps://doi.org/10.1007/3-540-48778-6_1openalex-snapshot
Fully Abstract Characterization of Probabilistic May Testing
inferred← citeshttps://doi.org/10.1007/3-540-49057-4_13openalex-snapshot
Emergent Mental Attitudes in Layered Agents
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-52559-9_86openalex-snapshot
Predicates, predicate transformers and refinement
inferred← citeshttps://doi.org/10.1007/3-540-52885-7_111openalex-snapshot
Dynamic logic as a uniform framework for theorem proving in intensional logic
inferred← citeshttps://doi.org/10.1007/3-540-53479-2_10openalex-snapshot
Causal trees interleaving + causality
inferred← citeshttps://doi.org/10.1007/3-540-54233-7_126openalex-snapshot
Safety for branching time semantics
inferred← citeshttps://doi.org/10.1007/3-540-55092-5_31openalex-snapshot
Formal specification of fault tolerant real time systems using minimal 3-sorted modal logic
inferred← citeshttps://doi.org/10.1007/3-540-55251-0_13openalex-snapshot
Graph grammars as context-dependent rewriting systems: A partial ordering semantics
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-55610-9_180openalex-snapshot
A survey of equivalence notions for net based systems
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_32openalex-snapshot
A categorical view of process refinement
inferred← citeshttps://doi.org/10.1007/3-540-56596-5_37openalex-snapshot
Towards an epistemic approach to reasoning about concurrent programs
inferred← citeshttps://doi.org/10.1007/3-540-56610-4_59openalex-snapshot
Yeast: A case study for a practical use of formal methods
inferred← citeshttps://doi.org/10.1007/3-540-56939-1_103openalex-snapshot
Temporal logic and categories of Petri nets
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-57887-0_106openalex-snapshot
On syntactic and semantic action refinement
inferred← citeshttps://doi.org/10.1007/3-540-58201-0_79openalex-snapshot
Reasoning about programs by exploiting the environment
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-60692-0_67openalex-snapshot
Determinizing Büchi asynchronous automata
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-62686-7_25openalex-snapshot
Control architectures for autonomous and interacting agents: A survey
inferred← citeshttps://doi.org/10.1007/3-540-63010-4_26openalex-snapshot
Extending LOTOS with time: A true concurrency perspective
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-64359-1_780openalex-snapshot
Testing of synchronization conditions for distributed real-time applications
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-585-32314-5_2openalex-snapshot
The Concept of Time in the Specification of Real-Time Systems
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_12openalex-snapshot
A Causality-based Semantics for CCS
inferred← citeshttps://doi.org/10.1007/978-1-4471-3217-2_4openalex-snapshot
A Process Calculus with Incomparable Priorities
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-540-30080-9_4openalex-snapshot
Expressiveness of Timed Events and Timed Languages
inferred← citeshttps://doi.org/10.1007/978-3-540-30206-3_17openalex-snapshot
The Influence of Durational Actions on Time Equivalences
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-31847-7_23openalex-snapshot
A Formal Framework for the Development of Concurrent Object-Based Systems
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-39893-6_14openalex-snapshot
Adding Action Refinement to Stochastic True Concurrency Models
inferred← citeshttps://doi.org/10.1007/978-3-540-39958-2_6openalex-snapshot
Inheritance of Temporal Logic Properties
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-45187-7_4openalex-snapshot
Bundle Event Structures and CCSP
inferred← citeshttps://doi.org/10.1007/978-3-540-68237-0_12openalex-snapshot
A Model Checking Language for Concurrent Value-Passing Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_1openalex-snapshot
Ugo Montanari in a Nutshell
inferred← citeshttps://doi.org/10.1007/978-3-540-68679-8_24openalex-snapshot
Ugo Montanari and Concurrency Theory
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-68855-6_15openalex-snapshot
Timed Mobile Ambients for Network Protocols
inferred← citeshttps://doi.org/10.1007/978-3-540-69619-3_12openalex-snapshot
Belief Updating by Communication Channel
inferred← citeshttps://doi.org/10.1007/978-3-540-69850-0_1openalex-snapshot
The Birth of Model Checking
inferred← citeshttps://doi.org/10.1007/978-3-540-70881-0_39openalex-snapshot
Real-Time Stable Event Structures and Marked Scott Domains: An Adjunction
inferred← citeshttps://doi.org/10.1007/978-3-540-71410-1_9openalex-snapshot
On the Automated Synthesis of Proof-Carrying Temporal Reference Monitors
inferred← citeshttps://doi.org/10.1007/978-3-540-73228-0_15openalex-snapshot
Weakly Distributive Domains
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-76637-7_10openalex-snapshot
Scalable Simulation of Cellular Signaling Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-77312-2_10openalex-snapshot
Causality in Membrane Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-77312-2_13openalex-snapshot
Events, Causality, and Concurrency in Membrane Systems
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-540-78127-1_1openalex-snapshot
From Logic to Theoretical Computer Science – An Update
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_19openalex-snapshot
Some Results on the Expressive Power and Complexity of LSCs
inferred← citeshttps://doi.org/10.1007/978-3-540-78127-1_3openalex-snapshot
Boris A. Trakhtenbrot: Academic Genealogy and Publications
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-540-78769-3_14openalex-snapshot
Action Refinement in Process Algebra and Security Issues
inferred← citeshttps://doi.org/10.1007/978-3-540-85758-7_23openalex-snapshot
Evaluation of OrViA Framework for Model-Driven SOA Implementations: An Industrial Case Study
inferred← citeshttps://doi.org/10.1007/978-3-642-02273-9_9openalex-snapshot
Partial Orders, Event Structures and Linear Strategies
inferred← citeshttps://doi.org/10.1007/978-3-642-11512-7_1openalex-snapshot
A Bibliography of Willem-Paul de Roever
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-24690-6_9openalex-snapshot
dCTL: A Branching Time Temporal Logic for Fault-Tolerant System Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-28024-5_6openalex-snapshot
Quantitative Causality in Membrane Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-31131-4_8openalex-snapshot
On the α-Reconstructibility of Workflow Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-32784-1_10openalex-snapshot
From Transitions to Executions
inferred← citeshttps://doi.org/10.1007/978-3-642-36315-3_17openalex-snapshot
A Verification Technique for Reversible Process Algebra
inferred← citeshttps://doi.org/10.1007/978-3-642-38088-4_3openalex-snapshot
Improved on-the-Fly Livelock Detection
inferred← citeshttps://doi.org/10.1007/978-3-642-60665-6_21openalex-snapshot
Coordination of Multiple Input Modes in User Interfaces
inferred← citeshttps://doi.org/10.1007/978-3-642-88049-0_14openalex-snapshot
Is Time a Real Time? An Overview of Time Ontology in Informatics
inferred← citeshttps://doi.org/10.1007/978-94-009-0349-4_20openalex-snapshot
Model Checking ACTL Constrained Processes
inferred← citeshttps://doi.org/10.1007/bf00117599openalex-snapshot
Lattice structure of temporal interval relations
inferred← citeshttps://doi.org/10.1007/bf00121261openalex-snapshot
Automatic verification of distributed systems: The process algebra approach
inferred← citeshttps://doi.org/10.1007/bf00871719openalex-snapshot
New and used temporal models: An issue of time
inferred← citeshttps://doi.org/10.1007/bf00871721openalex-snapshot
A relativistic temporal algebra for efficient design of distributed 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/bf03180567openalex-snapshot
Multitraces, hypertraces and partial order semantics
inferred← citeshttps://doi.org/10.1007/bf03259392openalex-snapshot
Automatizing Parametric Reasoning on Distributed Concurrent Systems
inferred← citeshttps://doi.org/10.1007/bfb0000464openalex-snapshot
From sequential to multi-threaded Java: An event-based operational semantics
inferred← citeshttps://doi.org/10.1007/bfb0014000openalex-snapshot
A stuttering closed temporal logic for modular reasoning about concurrent programs
inferred← citeshttps://doi.org/10.1007/bfb0014430openalex-snapshot
Local specification of distributed families of sequential objects
inferred← citeshttps://doi.org/10.1007/bfb0015012openalex-snapshot
Weak sequential composition in process algebras
inferred← citeshttps://doi.org/10.1007/bfb0022434openalex-snapshot
On the limitation of the global time assumption in distributed systems
inferred← citeshttps://doi.org/10.1007/bfb0028115openalex-snapshot
Time, tense, and relativity revisited
inferred← citeshttps://doi.org/10.1007/bfb0029990openalex-snapshot
Dependency-based action refinement
inferred← citeshttps://doi.org/10.1007/bfb0030640openalex-snapshot
Action refinement as an implementation relation
inferred← citeshttps://doi.org/10.1007/bfb0035991openalex-snapshot
Effective scheduling of tasks under weak temporal interval constraints
inferred← citeshttps://doi.org/10.1007/bfb0036207openalex-snapshot
Behavioural characterizations of partial order logics
inferred← citeshttps://doi.org/10.1007/s00165-006-0088-yopenalex-snapshot
Action Refinement Applied to Late Decisions
inferred← citeshttps://doi.org/10.1007/s002360050090openalex-snapshot
Fundamentals of modelling concurrency using discrete relational structures
inferred← citeshttps://doi.org/10.1007/s002360100070openalex-snapshot
Process algebra with action dependencies
inferred← citeshttps://doi.org/10.1007/s10703-006-0019-9openalex-snapshot
Bounded model checking of infinite state 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(96)00111-1openalex-snapshot
Modelling causality via action dependencies in branching time semantics
inferred← citeshttps://doi.org/10.1016/0141-9331(94)90109-0openalex-snapshot
A case study in specifying and testing architectural features
inferred← citeshttps://doi.org/10.1016/0164-1212(93)90019-topenalex-snapshot
An efficient implementation model for the FP2 parallel language
inferred← citeshttps://doi.org/10.1016/0165-6074(92)90381-gopenalex-snapshot
Verifying networks of processes that communicate via shared variables
inferred← citeshttps://doi.org/10.1016/0167-6423(94)00011-5openalex-snapshot
Petri-net-based deadlock analysis of Process Algebra programs
inferred← citeshttps://doi.org/10.1016/0169-7552(93)90047-8openalex-snapshot
An action-based framework for veryfying logical and behavioural properties of concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90060-uopenalex-snapshot
Comparative metric semantics for concurrent prolog
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90054-jopenalex-snapshot
Defining conditional independence using collapses
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90181-eopenalex-snapshot
A logical characterization of well branching event structures
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90182-fopenalex-snapshot
Conditional rewriting logic as a unified model of concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00174-hopenalex-snapshot
On the nature of events: another perspective in concurrency
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00206-xopenalex-snapshot
On using temporal logic for refinement and compositional verification of concurrent systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90168-6openalex-snapshot
A semantic characterisation for faults in replicated systems
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00035-uopenalex-snapshot
A hierarchy of temporal logics with past
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00230-8openalex-snapshot
Free shuffle algebras in language varieties
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00262-6openalex-snapshot
Metric completion versus ideal completion
inferred← citeshttps://doi.org/10.1016/0890-5401(91)90036-2openalex-snapshot
Comparative semantics for flow of control in logic programming without logic
inferred← citeshttps://doi.org/10.1016/0950-5849(89)90159-6openalex-snapshot
Survey of fairness notions
inferred← citeshttps://doi.org/10.1016/b978-0-408-02938-4.50016-4openalex-snapshot
Key references in distributed computer systems 1959–1989
inferred← citeshttps://doi.org/10.1016/b978-044482830-9/50027-8openalex-snapshot
Verification on Infinite Structures
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1453-5.50021-0openalex-snapshot
An Epistemic Proof System for Parallel Processes**A full version appeared as Technical Report No. 93-17.
inferred← citeshttps://doi.org/10.1016/b978-1-55860-203-8.50043-7openalex-snapshot
Deliberation and its Role in the Formation of Intentions**This research was in part supported by a Generic Industry Research and Development Grant from the Department of Industry, Technology and Commerce, Australia and in part by the Australian Civil Aviation Authority.
inferred← citeshttps://doi.org/10.1016/j.artint.2017.01.005openalex-snapshot
An initial study of time complexity in infinite-domain constraint satisfaction
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.024openalex-snapshot
Event Structures for Interrupt Process Algebras
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.04.042openalex-snapshot
Formal Specification and Verification of Multi-Agent Systems
inferred← citeshttps://doi.org/10.1016/j.entcs.2005.04.019openalex-snapshot
Model-checking the Preservation of Temporal Properties upon Feature Integration
inferred← citeshttps://doi.org/10.1016/j.entcs.2013.09.012openalex-snapshot
History-Preserving Bisimilarity for Higher-Dimensional Automata via Open Maps
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.ic.2006.01.001openalex-snapshot
Incompleteness of states w.r.t. traces in model checking
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104603openalex-snapshot
Team equivalences for finite-state machines with silent moves
inferred← citeshttps://doi.org/10.1016/j.ic.2020.104644openalex-snapshot
A parametric framework for reversible π-calculi
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104887openalex-snapshot
Characterising spectra of equivalences for event structures, logically
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.07.004openalex-snapshot
Reversibility and asymmetric conflict in event structures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2015.12.007openalex-snapshot
Declarative event based models of concurrency and refinement in psi-calculi
inferred← citeshttps://doi.org/10.1016/j.jlamp.2017.11.002openalex-snapshot
Semantics of global view of choreographies
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.01.001openalex-snapshot
Towards a categorical representation of reversible event structures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100582openalex-snapshot
Specifying reversibility with TLA+
inferred← citeshttps://doi.org/10.1016/j.jlamp.2020.100631openalex-snapshot
Conflict vs causality in event structures
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100686openalex-snapshot
Event structure semantics of (controlled) reversible CCS
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100700openalex-snapshot
Strategies, model checking and branching-time properties in Maude
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100720openalex-snapshot
Event structures for the reversible early internal π-calculus
inferred← citeshttps://doi.org/10.1016/j.jlamp.2022.100799openalex-snapshot
Processes against tests: On defining contextual equivalences
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.009openalex-snapshot
Synchronous Kleene algebra
inferred← citeshttps://doi.org/10.1016/j.jss.2011.05.024openalex-snapshot
Policy-based Awareness Management (PAM): Case study of a wireless communication system at a hospital
inferred← citeshttps://doi.org/10.1016/j.scico.2013.07.005openalex-snapshot
A verified algebra for read–write Linked Data
inferred← citeshttps://doi.org/10.1016/j.tcs.2021.09.037openalex-snapshot
A study on team bisimulation and H-team bisimulation for BPP nets
inferred← citeshttps://doi.org/10.1016/s0004-3702(03)00075-4openalex-snapshot
Point algebras for temporal reasoning: Algorithms and complexity
inferred← citeshttps://doi.org/10.1016/s0004-3702(98)00104-0openalex-snapshot
Reasoning about nondeterministic and concurrent actions: A process algebra approach
inferred← citeshttps://doi.org/10.1016/s0020-0190(00)00038-7openalex-snapshot
A rely–guarantee discipline for open distributed systems design
inferred← citeshttps://doi.org/10.1016/s0164-1212(96)00162-8openalex-snapshot
G-Nets: A petri net based approach for logical and timing analysis of complex software systems
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00130-2openalex-snapshot
Infinitary relations and their representation
inferred← citeshttps://doi.org/10.1016/s0167-6423(96)00028-7openalex-snapshot
Verification of XTP context management closing procedure in style of TLA
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00044-5openalex-snapshot
Testing preorders for probabilistic processes can be characterized by simulations
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00012-6openalex-snapshot
Representation of computations in concurrent automata by dependence orders
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00165-xopenalex-snapshot
Specification of abstract dynamic-data types: A temporal logic approach
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(97)00195-3openalex-snapshot
A framework for viewing atomic events in distributed computations
inferred← citeshttps://doi.org/10.1016/s1570-8683(03)00008-9openalex-snapshot
Mathematical modal logic: A view of its evolution
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)00024-6openalex-snapshot
Concurrent Semantics for the π-calculus
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80593-0openalex-snapshot
Deduction Systems for BDI Logics with Mental State Consistency
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80194-xopenalex-snapshot
Concurrent Derivations as Single Pushout Graph Grammar Processes
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80237-3openalex-snapshot
True Concurrency = Interleaving Concurrency + Weak Conflict
inferred← citeshttps://doi.org/10.1016/s1571-0661(05)80306-8openalex-snapshot
On the Semantics of Message Passing Processes
showing the first 200 of 243 · page through all 243
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.