The following pages link to (Q4027626):
Displaying 22 items.
- Modelling concurrency with comtraces and generalized comtraces (Q651308) (← links)
- On the implementation of concurrent calculi in net calculi: two case studies (Q673785) (← links)
- Cameo: an alternative model of concurrency for Eiffel (Q846117) (← links)
- Concurrent transition systems (Q1119395) (← links)
- Observational structures and their logic (Q1190494) (← links)
- An algebraic semantics for structured transition systems and its application to logic programs (Q1199528) (← links)
- A true concurrency model of CCS semantics (Q1802071) (← links)
- Tile formats for located and mobile systems. (Q1854326) (← links)
- An equational modeling of asynchronous concurrent programming (Q2037432) (← links)
- Building a Modal Interface Theory for Concurrency and Data (Q2890318) (← links)
- An Institution for Graph Transformation (Q2890329) (← links)
- Ugo Montanari and Concurrency Theory (Q3507376) (← links)
- Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra (Q3507401) (← links)
- Modelling Concurrency with Quotient Monoids (Q3510871) (← links)
- (Q4823421) (← links)
- A Concurrent Graph Semantics for Mobile Ambients1 1Research partly supported by the EC TMR Network General Theory of Graph Transformation Systems (GETGRATS); by the EC Esprit WG Applications of Graph Transformations (APPLIGRAPH); and by the Italian MURST (Q4917051) (← links)
- Unifying Semantics for Concurrent Programming (Q4922078) (← links)
- Verification and comparison of transition systems (Q5044730) (← links)
- Simplicial Models for Concurrency (Q5179017) (← links)
- Proved trees (Q5204353) (← links)
- Models, Languages, and Tools for Concurrent and Distributed Programming (Q5230474) (← links)
- Theoretical Aspects of Computing – ICTAC 2005 (Q5395108) (← links)
