Sciweavers

656 search results - page 52 / 132
» A Formalization of Transition P Systems
Sort
View
129
Voted
AGENTCL
2003
Springer
15 years 5 months ago
Nonmonotonic Commitment Machines
CHOPRA, AMIT KHUSHWANT. Nonmonotonic Commitment Machines. (Under the direction of Dr. Munindar P. Singh). Protocols in open and dynamic multiagent systems cannot be modeled via fo...
Amit K. Chopra, Munindar P. Singh
110
Voted
DSS
2006
108views more  DSS 2006»
15 years 17 days ago
Matching observed behavior and modeled behavior: An approach based on Petri nets and integer programming
Inspired by the way SAP R/3 and other transactional information systems log events, we focus on the problem to decide whether a process model and a frequency profile "fit"...
Wil M. P. van der Aalst
137
Voted
TC
2010
14 years 7 months ago
Generating Reliable Code from Hybrid-Systems Models
Hybrid systems have emerged as an appropriate formalism to model embedded systems as they capture the theme of continuous dynamics with discrete control. Under this paradigm, distr...
Madhukar Anand, Sebastian Fischmeister, Yerang Hur...
108
Voted
ITP
2010
172views Mathematics» more  ITP 2010»
14 years 11 months ago
Automated Machine-Checked Hybrid System Safety Proofs
mentation of the Abstraction Method In Coq Eelis van der Weegen Institute for Computing and Information Sciences Raboud University Nijmegen This technical report documents our deve...
Herman Geuvers, Adam Koprowski, Dan Synek, Eelis v...
MEMOCODE
2008
IEEE
15 years 7 months ago
Bisimulator 2.0: An On-the-Fly Equivalence Checker based on Boolean Equation Systems
Equivalence checking is a classical verification method determining if a finite-state concurrent system (protocol) satisfies its desired external behaviour (service) by compari...
Radu Mateescu, Emilie Oudot