Conditional rewriting logic as a unified model of concurrency
From MaRDI portal
(Redirected from Publication:1190488)
Recommendations
Cites work
- scientific article; zbMATH DE number 4013996 (Why is no real title available?)
- scientific article; zbMATH DE number 4016167 (Why is no real title available?)
- scientific article; zbMATH DE number 4130339 (Why is no real title available?)
- scientific article; zbMATH DE number 4180819 (Why is no real title available?)
- scientific article; zbMATH DE number 4191145 (Why is no real title available?)
- scientific article; zbMATH DE number 4164155 (Why is no real title available?)
- scientific article; zbMATH DE number 3904807 (Why is no real title available?)
- scientific article; zbMATH DE number 3911679 (Why is no real title available?)
- scientific article; zbMATH DE number 3949706 (Why is no real title available?)
- scientific article; zbMATH DE number 3988695 (Why is no real title available?)
- scientific article; zbMATH DE number 4033040 (Why is no real title available?)
- scientific article; zbMATH DE number 4037157 (Why is no real title available?)
- scientific article; zbMATH DE number 4039251 (Why is no real title available?)
- scientific article; zbMATH DE number 4043232 (Why is no real title available?)
- scientific article; zbMATH DE number 4045127 (Why is no real title available?)
- scientific article; zbMATH DE number 4048997 (Why is no real title available?)
- scientific article; zbMATH DE number 4060701 (Why is no real title available?)
- scientific article; zbMATH DE number 4085643 (Why is no real title available?)
- scientific article; zbMATH DE number 4090765 (Why is no real title available?)
- scientific article; zbMATH DE number 4099289 (Why is no real title available?)
- scientific article; zbMATH DE number 4103051 (Why is no real title available?)
- scientific article; zbMATH DE number 3684925 (Why is no real title available?)
- scientific article; zbMATH DE number 3703962 (Why is no real title available?)
- scientific article; zbMATH DE number 3730111 (Why is no real title available?)
- scientific article; zbMATH DE number 3735770 (Why is no real title available?)
- scientific article; zbMATH DE number 3774867 (Why is no real title available?)
- scientific article; zbMATH DE number 42752 (Why is no real title available?)
- scientific article; zbMATH DE number 177812 (Why is no real title available?)
- scientific article; zbMATH DE number 3522194 (Why is no real title available?)
- scientific article; zbMATH DE number 3574082 (Why is no real title available?)
- scientific article; zbMATH DE number 3597848 (Why is no real title available?)
- scientific article; zbMATH DE number 3633737 (Why is no real title available?)
- scientific article; zbMATH DE number 4124993 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- scientific article; zbMATH DE number 4119615 (Why is no real title available?)
- scientific article; zbMATH DE number 3280068 (Why is no real title available?)
- scientific article; zbMATH DE number 3316072 (Why is no real title available?)
- scientific article; zbMATH DE number 3367095 (Why is no real title available?)
- A mathematical approach to nondeterminism in data types
- Actor grammars
- Adjointness in Foundations
- Algebraic semantics
- An abstract formulation for rewrite systems
- Aspects of topoi
- Compiling concurrent rewriting onto the Rewrite Rule Machine
- Completion of a Set of Rules Modulo a Set of Equations
- Computing in systems described by equations
- Concurrent transition systems
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Fair termination is decidable for ground systems
- From Petri nets to linear logic
- General recursive functions of natural numbers
- Graph expressions and graph rewritings
- Implementing term rewriting by graph reduction: Termination of combined systems
- Infinite trees in normal form and recursive equations having a unique solution
- Initial Algebra Semantics and Continuous Algebras
- On ``On graph rewritings
- On graph rewritings
- Operational and Semantic Equivalence Between Recursive Programs
- Petri nets are monoids
- Subequalizers
- Termination for direct sums of left-linear complete term rewriting systems
- The categorical abstract machine
- The gamma model and its discipline of programming
- The lambda calculus. Its syntax and semantics. Rev. ed.
- The linear abstract machine
- Varieties of chain-complete algebras
- Varieties of ordered algebras
Cited in
(only showing first 100 items - show all)- Conditional rewriting logic: Deduction, models and concurrency
- The rewriting logic semantics project: a progress report
- Backwards type analysis of asynchronous method calls
- Validating timed models of deployment components with parametric concurrency
- Categorical rewriting of term-like structures
- Compositional specification in rewriting logic
- The rewriting logic semantics project: a progress report
- Travelling salesman problem in tissue P systems with costs
- Behavioural specification for hierarchical object composition
- Twenty years of rewriting logic
- Strict coherence of conditional rewriting modulo axioms
- Towards Erlang verification by term rewriting
- An Object-Oriented Component Model for Heterogeneous Nets
- A rewriting framework and logic for activities subject to regulations
- A Modular Equational Generalization Algorithm
- Confluence by critical pair analysis revisited
- Specification of abstract dynamic-data types: A temporal logic approach
- Symbolic computation in Maude: some tapas
- Composing proof terms
- Strategy-based rewrite semantics for membrane systems preserves maximal concurrency of evolution rule actions
- Equational formulas and pattern operations in initial order-sorted algebras
- Dynamic connectors for concurrency
- Semantics of non-terminating rewrite systems using minimal coverings
- Building correct-by-construction systems with formal patterns
- Two case studies of semantics execution in Maude: CCS and LOTOS
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- scientific article; zbMATH DE number 7566052 (Why is no real title available?)
- Rewriting on cyclic structures: Equivalence between the operational and the categorical description
- Reflection in conditional rewriting logic
- The rewriting logic semantics project
- A partial evaluation framework for order-sorted equational programs modulo axioms
- Structural induction in institutions
- Herbrand theorems in arbitrary institutions
- Read atomic transactions with prevention of lost updates: ROLA and its formal analysis
- A compositional view of derivations as interactive processes with applications to regulated and distributed rewriting
- An algebraic semantics for MOF
- A rewriting logic approach to operational semantics
- A Maude specification of an object-oriented model for telecommunication networks
- Actor theories in rewriting logic
- Tile formats for located and mobile systems.
- Effectively Checking the Finite Variant Property
- Rewriting logic as a semantic framework for concurrency: a progress report
- Fundamentals of context-sensitive rewriting
- A rewriting logic framework for soft constraints
- Efficient safety enforcement for Maude programs via program specialization in the \textsf{ÁTAME} system
- Towards Modelling Actor-Based Concurrency in Term Rewriting
- Business processes resource management using rewriting logic and deep-learning-based predictive monitoring
- A foundation for higher-order concurrent constraint programming
- Semantic foundations for generalized rewrite theories
- Model checking TLR* guarantee formulas on infinite systems
- SOS formats and meta-theory: 20 years after
- Algebraic specification of agent computation
- Relaxed models for rewriting logic
- Rewriting strategies and strategic rewrite programs
- Formal verification of complex business processes based on high-level Petri nets
- Structured theories and institutions
- A connector algebra for P/T nets interactions
- Formalization and correctness of the PALS architectural pattern for distributed real-time systems
- Rewriting semantics of production rule sets
- Priority rewriting: Semantics, confluence, and conditionals
- The Maude LTL model checker
- TAGED Approximations for Temporal Properties Model-Checking
- Testing Concurrent Objects with Application-Specific Schedulers
- Declarative Debugging of Rewriting Logic Specifications
- Resource provisioning strategies for BPMN processes: specification and analysis using Maude
- A Distributed Computing Model for Dataflow, Controlflow, and Workflow in Fractionated Cyber-Physical Systems
- Specification and analysis of the AER/NCA active network protocol suite in real-time Maude
- Theorem proving in a mathematical information environment
- Tiles for Reo
- Specification of real-time and hybrid systems in rewriting logic
- Verifying hierarchical Ptolemy II discrete-event models using real-time maude
- scientific article; zbMATH DE number 1231543 (Why is no real title available?)
- A rewriting-based model checker for the linear temporal logic of rewriting
- Logical foundations of CafeOBJ
- Formal modeling and validation of a power-efficient grouping protocol for WSNs
- Probabilistic real-time rewrite theories and their expressive power
- Modeling and analyzing mobile ad hoc networks in Real-Time Maude
- REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS
- Reflection in membership equational logic, many-sorted equational logic, Horn logic with equality, and rewriting logic
- A process calculus BigrTiMo of mobile systems and its formal semantics
- Formal Methods in Software and Systems Modeling
- More problems in rewriting
- Applications and extensions of context-sensitive rewriting
- Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
- Strategies, model checking and branching-time properties in Maude
- A new generic scheme for functional logic programming with constraints
- Representing the MSR cryptoprotocol specification language in an extension of rewriting logic with dependent types
- Debugging Maude programs via runtime assertion checking and trace slicing
- scientific article; zbMATH DE number 1231542 (Why is no real title available?)
- Optimizing Maude programs via program specialization
- Strand spaces with choice via a process algebra semantics
- Detection and diagnosis of deviations in distributed systems of autonomous agents
- Strategy-based proof calculus for membrane systems
- Abstraction and model checking of core Erlang programs in Maude
- Coinduction for preordered algebra
- Invariant-driven specifications in Maude
- Comparing higher-order encodings in logical frameworks and tile logic
- Comparing logics for rewriting: Rewriting logic, action calculi and tile logic
- Tiling transactions in rewriting logic
- scientific article; zbMATH DE number 7809760 (Why is no real title available?)
This page was built for publication: Conditional rewriting logic as a unified model of concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1190488)
