Pages that link to "Item:Q1110338"

The following pages link to A distributed operational semantics of CCS based on condition/event systems (Q1110338):

Displaying 43 items.

• Model-checking games for fixpoint logics with partial order models (Q532389) (← links)
• Step failures semantics and a complete proof system (Q582133) (← links)
• Extensional Petri net (Q667521) (← links)
• A multiset semantics for the pi-calculus with replication (Q672867) (← links)
• Trapping mutual exclusion in the box calculus (Q672869) (← links)
• Process versus unfolding semantics for Place/Transition Petri nets (Q672872) (← links)
• On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
• Observing localities (Q685414) (← links)
• A partial ordering semantics for CCS (Q914400) (← links)
• Petri nets are monoids (Q922720) (← links)
• Typed event structures and the linear \(\pi \)-calculus (Q964488) (← links)
• Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS (Q1007235) (← links)
• Partial ordering models for concurrency can be defined operationally (Q1111013) (← links)
• The chemical abstract machine (Q1190491) (← links)
• An algebra for process creation (Q1203719) (← links)
• A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems (Q1271643) (← links)
• A uniform approach to true-concurrency and interleaving semantics for Petri nets (Q1274975) (← links)
• Non-interleaving semantics for mobile processes (Q1285660) (← links)
• The connection between an event structure semantics and an operational semantics for TCSP (Q1323346) (← links)
• An algebraic characterization of observational equivalence (Q1351804) (← links)
• Comparing logics for rewriting: Rewriting logic, action calculi and tile logic (Q1608920) (← links)
• Zero-safe nets: Comparing the collective and individual token approaches. (Q1854323) (← links)
• The box algebra = Petri nets + process expressions (Q1854558) (← links)
• Architectural CCS (Q1914040) (← links)
• Nested-unit Petri nets (Q2423743) (← links)
• Concurrent bisimulations in Petri nets (Q2639636) (← links)
• Event structure semantics for multiparty sessions (Q2683035) (← links)
• Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets (Q2941150) (← links)
• Pierpaolo Degano (Q3460854) (← links)
• Asynchronous Traces and Open Petri Nets (Q3460864) (← links)
• Language Representability of Finite P/T Nets (Q3460873) (← links)
• When to Move to Transfer Nets (Q3460877) (← links)
• Ugo Montanari and Concurrency Theory (Q3507376) (← links)
• Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
• TTL : a formalism to describe local and global properties of distributed systems (Q3992090) (← links)
• Verification and comparison of transition systems (Q5044730) (← links)
• An algebraic view of interleaving and distributed operational semantics for CCS (Q5096249) (← links)
• An algebraic semantics for hierarchical P/T nets (Q5096359) (← links)
• Dynamic matrices and the cost analysis of concurrent programs (Q5096393) (← links)
• Towards a Truly Concurrent Semantics for Reversible CCS (Q5162605) (← links)
• Compositional process semantics of Petri Boxes (Q5890051) (← links)
• Algebraic characterizations of trace and decorated trace equivalences over tree-like structures (Q5940926) (← links)
• Process calculi for biological processes (Q6062000) (← links)