Nets, Terms and Formulas
From MaRDI portal
Publication:3997896
DOI10.1017/CBO9780511526589zbMath0741.68002MaRDI QIDQ3997896
Publication date: 17 September 1992
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items
A case study in transformational design of concurrent systems ⋮ Ernst-Rüdiger Olderog: A Life for Meaning ⋮ Structure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSP ⋮ Model-checking discrete duration calculus ⋮ Language Representability of Finite P/T Nets ⋮ Encoding Asynchronous Interactions Using Open Petri Nets ⋮ The difference between splitting in \(n\) and \(n+1\) ⋮ Conjunction on processes: Full abstraction via ready-tree semantics ⋮ Nested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary Nets ⋮ Processes with infinite liveness requirements ⋮ Verification of finite-state machines: a distributed approach ⋮ A refined view of the box algebra ⋮ Petri nets, traces, and local model checking ⋮ A Study on Team Bisimulations for BPP Nets ⋮ Axiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\) ⋮ Just testing ⋮ Synchronous development of asynchronous systems ⋮ Nested-unit Petri nets ⋮ Ugo Montanari and Concurrency Theory ⋮ Decidability of Two Truly Concurrent Equivalences for Finite Bounded Petri Nets ⋮ Bisimulation, games, and logic ⋮ Team equivalences for finite-state machines with silent moves ⋮ Petri nets and regular processes ⋮ Team bisimilarity, and its associated modal logic, for BPP nets ⋮ A multiset semantics for the pi-calculus with replication ⋮ On the implementation of concurrent calculi in net calculi: two case studies ⋮ Solving recursive net equations ⋮ Petri games: synthesis of distributed systems with causal memory ⋮ Causal Semantics for BPP Nets with Silent Moves ⋮ Safe reasoning with logic LTS ⋮ Ensuring liveness properties of distributed systems: open problems ⋮ A translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri nets ⋮ Safe Reasoning with Logic LTS ⋮ Ready simulation for concurrency: it's logical! ⋮ Divergence in testing and readiness semantics ⋮ Effective Representation of RT-LOTOS Terms by Finite Time Petri Nets ⋮ Interfaces between languages for communicating systems ⋮ Processes with local and global liveness requirements ⋮ Distributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCS ⋮ A theory of structural stationarity in the \(\pi\)-calculus ⋮ A study on team bisimulation and H-team bisimulation for BPP nets ⋮ A formal approach to the integration of performance aspects in the modeling and analysis of concurrent systems ⋮ Basic observables for processes ⋮ Process synchronisation as fusion ⋮ CCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptions ⋮ The box algebra = Petri nets + process expressions ⋮ Branching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves
