Models of Computation: A Tribute to Ugo Montanari’s Vision
From MaRDI portal
Publication:3507385
DOI10.1007/978-3-540-68679-8_31zbMath1143.68393OpenAlexW1853106524MaRDI QIDQ3507385
Roberto Bruni, Vladimiro Sassone
Publication date: 19 June 2008
Published in: Concurrency, Graphs and Models (Search for Journal in Brave)
Full work available at URL: https://eprints.soton.ac.uk/268597/1/intro-moc-introOff.pdf
History of mathematics in the 20th century (01A60) Biographies, obituaries, personalia, bibliographies (01A70) History of computer science (68-03)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Process versus unfolding semantics for Place/Transition Petri nets
- A basic algebra of stateless connectors
- Unfolding semantics of graph transformation
- A\(^ 2\)CCS: Atomic actions for CCS
- Petri nets are monoids
- Conditional rewriting logic as a unified model of concurrency
- An algebraic semantics for structured transition systems and its application to logic programs
- An abstract machine for concurrent modular systems: CHARM
- Dynamic connectors for concurrency
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Observational congruences for dynamically reconfigurable tile systems
- Normal forms for algebras of connections.
- Zero-safe nets: Comparing the collective and individual token approaches.
- Tile formats for located and mobile systems.
- Functorial models for Petri nets
- Contextual Petri nets, asymmetric event structures, and processes
- Axiomatizing the algebra of net computations and processes
- Graph rewriting, constraint solving and tiles for coordinating distributed systems
- A compositional coalgebraic model of fusion calculus
- Structured coalgebras and minimal HD-automata for the \(\pi\)-calculus
- GS·Λ Theories
- Synchronised Hyperedge Replacement as a Model for Service Oriented Computing
- An Efficient Unification Algorithm
- Symmetric monoidal and cartesian double categories as a semantic framework for tile logic
- Structured transition systems with parametric observations: observational congruences and minimal realizations
- On the semantics of place/transition Petri nets
- An interactive semantics of logic programming
- Axiomatizing permutation equivalence
- Lectures on Concurrency and Petri Nets
- Event Structure Semantics for Nominal Calculi
- Theoretical Computer Science
- CONCUR 2005 – Concurrency Theory
- CONCUR 2005 – Concurrency Theory
- Recent Trends in Algebraic Development Techniques
