Nets, Terms and Formulas

From MaRDI portal
Publication:3997896

DOI10.1017/CBO9780511526589zbMath0741.68002MaRDI QIDQ3997896

Ernst-Ruediger Olderog

Publication date: 17 September 1992





Related Items

A case study in transformational design of concurrent systemsErnst-Rüdiger Olderog: A Life for MeaningStructure Preserving Bisimilarity, Supporting an Operational Petri Net Semantics of CCSPModel-checking discrete duration calculusLanguage Representability of Finite P/T NetsEncoding Asynchronous Interactions Using Open Petri NetsThe difference between splitting in \(n\) and \(n+1\)Conjunction on processes: Full abstraction via ready-tree semanticsNested-Unit Petri Nets: A Structural Means to Increase Efficiency and Scalability of Verification on Elementary NetsProcesses with infinite liveness requirementsVerification of finite-state machines: a distributed approachA refined view of the box algebraPetri nets, traces, and local model checkingA Study on Team Bisimulations for BPP NetsAxiomatizing Lüttgen \& Vogler's ready simulation for finite processes in \(\mathrm{CLL}_{R}\)Just testingSynchronous development of asynchronous systemsNested-unit Petri netsUgo Montanari and Concurrency TheoryDecidability of Two Truly Concurrent Equivalences for Finite Bounded Petri NetsBisimulation, games, and logicTeam equivalences for finite-state machines with silent movesPetri nets and regular processesTeam bisimilarity, and its associated modal logic, for BPP netsA multiset semantics for the pi-calculus with replicationOn the implementation of concurrent calculi in net calculi: two case studiesSolving recursive net equationsPetri games: synthesis of distributed systems with causal memoryCausal Semantics for BPP Nets with Silent MovesSafe reasoning with logic LTSEnsuring liveness properties of distributed systems: open problemsA translation of \(\text{TPAL}_{p}\) into a class of timed-probabilistic Petri netsSafe Reasoning with Logic LTSReady simulation for concurrency: it's logical!Divergence in testing and readiness semanticsEffective Representation of RT-LOTOS Terms by Finite Time Petri NetsInterfaces between languages for communicating systemsProcesses with local and global liveness requirementsDistributed semantics for the \(\pi \)-calculus based on Petri nets with inhibitor ARCSA theory of structural stationarity in the \(\pi\)-calculusA study on team bisimulation and H-team bisimulation for BPP netsA formal approach to the integration of performance aspects in the modeling and analysis of concurrent systemsBasic observables for processesProcess synchronisation as fusionCCS: it's not fair! Fair schedulers cannot be implemented in CCS-like languages even under progress and certain fairness assumptionsThe box algebra = Petri nets + process expressionsBranching place bisimilarity: a decidable behavioral equivalence for finite Petri nets with silent moves