Automatizing parametric reasoning on distributed concurrent systems

DOI10.1007/BF03259392zbMath0829.68052OpenAlexW2078614932MaRDI QIDQ1346610

Daniel Yankelevich, Paola Inverardi, Corrado Priami

Publication date: 6 April 1995

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03259392

zbMATH Keywords

concurrent systemssemantic modelconcurrent distributed system

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items

Assisting requirement formalization by means of natural language translation, A static view of localities, Automatizing parametric reasoning on distributed concurrent systems, Read-write causality, Equivalence checking 40 years after: a review of bisimulation tools, Extended transition systems for parametric bisimulation, Automatic verification of distributed systems: the process algebra approach., A parametric approach to localities

Uses Software

• LOTOS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• LOTOS
• Universal axioms for bisimulations
• Algèbre de processus et synchronisation
• Calculi for synchrony and asynchrony
• Algebra of communicating processes with abstraction
• Higher-level synchronising devices in Meije-SCCS
• Concurrent histories: a basis for observing distributed systems
• Modeling concurrency with partial orders
• Petri nets, algebras, morphisms, and compositionality
• Linear time, branching time and partial order in logics and models for concurrency. School/workshop, Noordwijkerhout, The Netherlands, May 30- June 3, 1988. Proceedings
• A functional logic for higher level reasoning about computation
• A theory of processes with localities
• Automatizing parametric reasoning on distributed concurrent systems
• The non-sequential behaviour of Petri nets
• CIRCAL and the representation of communication, concurrency, and time
• Ready-Trace Semantics for Concrete Process Algebra with the Priority Operator
• A Unified Approach to Path Problems
• Fast Algorithms for Solving Path Problems
• On Stochastic Scheduling with In-Tree Precedence Constraints